68 search results - page 3 / 14 » Resolution Tunnels for Improved SAT Solver Performance |
SAT
2009
Springer
14 years 23 days ago
2009
Springer
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
SAT
2009
Springer
14 years 23 days 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
2007
Springer
14 years 12 days ago
2007
Springer
As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed down over the past few years. On the other hand, w...
DAC
2004
ACM
14 years 7 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
JSAT
2006
13 years 6 months ago
2006
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...