610 search results - page 16 / 122 » Using SAT in QBF |
JSAT
2008
13 years 7 months ago
2008
In this technical report we briefly describe the instances submitted to the 2006 and 2007 MaxSAT Evaluations. First, we introduce the instances that can be directly encoded as Max...
AI
2010
Springer
13 years 7 months ago
2010
Springer
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
AI
2008
Springer
13 years 7 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
MJ
2007
13 years 7 months ago
2007
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...