62 search results - page 7 / 13 » A Complete Multi-valued SAT Solver |
NMR
2004
Springer
14 years 25 days ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
AAAI
2004
13 years 9 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
SAT
2005
Springer
14 years 29 days ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
CAV
2009
Springer
13 years 11 months ago
2009
Springer
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
ENTCS
2007
13 years 7 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...