Sciweavers

68 search results - page 3 / 14
» Resolution Tunnels for Improved SAT Solver Performance
Sort
View
SAT
2009
Springer
113views Hardware» more  SAT 2009»
14 years 23 days ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
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...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...
SAT
2009
Springer
111views Hardware» more  SAT 2009»
14 years 23 days ago
Restart Strategy Selection Using Machine Learning Techniques
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...
Shai Haim, Toby Walsh
CP
2007
Springer
14 years 12 days ago
A Case for Simple SAT Solvers
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...
Jinbo Huang
DAC
2004
ACM
14 years 7 months ago
Refining the SAT decision ordering for bounded model checking
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...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...
JSAT
2006
109views more  JSAT 2006»
13 years 6 months ago
Decomposing SAT Problems into Connected Components
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...
Armin Biere, Carsten Sinz