610 search results - page 19 / 122 » Using SAT in QBF |
MEMOCODE
2003
IEEE
14 years 29 days ago
2003
IEEE
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance...
CP
2005
Springer
13 years 9 months ago
2005
Springer
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
SAT
2009
Springer
14 years 7 days ago
2009
Springer
Execution of most of the modern DPLL-based SAT solvers is guided by a number of heuristics. Decisions made during the search process are usually driven by some fixed heuristic pol...