101 search results - page 5 / 21 » A Case for Simple SAT Solvers |
CP
2007
Springer
14 years 1 months ago
2007
Springer
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
AAAI
2006
13 years 8 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
ICCD
2005
IEEE
14 years 4 months ago
2005
IEEE
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
CADE
2002
Springer
14 years 7 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...