SAT @ UCD

Welcome to the SAT Team @ UCD website. This website summarizes our work on decision and optimization procedures.

Date News Brief
29/Jun/2015 Paper “Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing” accepted at SAT'2015
29/Jun/2015 Paper “SAT-Based Formula Simplification” accepted at SAT'2015
29/Jun/2015 Paper “SAT-Based Horn Least Upper Bounds” accepted at SAT'2015
29/Jun/2015 Paper “Computing Maximal Autarkies with Few and Simple Oracle Queries” accepted at SAT'2015
27/Jun/2015 Paper “Efficient Axiom Pinpointing with EL2MCS” accepted at KI'2015
11/Jun/2015 Paper “Smallest MUS Extraction with Minimal Hitting Set Dualization” accepted at CP'2015
16/Apr/2015 Paper “Efficient Model Based Diagnosis with Maximum Satisfiability” accepted at IJCAI'2015
16/Apr/2015 Paper “Literal-Based MCS Extraction” accepted at IJCAI'2015
16/Apr/2015 Paper “Prime Compilation of Non-Clausal Formulae” accepted at IJCAI'2015
16/Apr/2015 Paper “Solving QBF by Clause Selection” accepted at IJCAI'2015
03/Sep/2014 Paper “Efficient Relaxations of Over-Constrained CSPs” accepted at ICTAI'2014
05/Jul/2014 Paper “Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form” accepted at JELIA'2014

Please follow links for additional information. The start page is this one. Alternatively, just click the image on the top right corner of any page.

start.txt · Last modified: 2015/06/29 23:38 by joao
 
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki