15 search results - page 1 / 3 » : The Design and Analysis of an Algorithm Portfolio for SAT |
CP
2007
Springer
13 years 10 months ago
2007
Springer
It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
AAAI
2010
13 years 5 months ago
2010
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
CP
2000
Springer
13 years 8 months ago
2000
Springer
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
DAC
2004
ACM
14 years 5 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...
DAC
2001
ACM
14 years 5 months ago
2001
ACM
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...