25 search results - page 2 / 5 » A new hybrid solution to boost SAT solver performance |
ASPDAC
2005
ACM
13 years 11 months ago
2005
ACM
Abstract— Learning is an essential pruning technique in modern SAT solvers, but it exploits a relatively small amount of information that can be deduced from the conflicts. Rece...
NMR
2004
Springer
13 years 11 months 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...
JSAT
2006
13 years 5 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...
CP
2007
Springer
13 years 12 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
DAC
2001
ACM
14 years 6 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...