62 search results - page 1 / 13 » On SAT instance classes and a method for reliable performanc... |
88
Voted
AMAI
2005
Springer
15 years 3 months ago
2005
Springer
110
Voted
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
Due to the widespread demands for efficient SAT solvers in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. We pr...
136
click to vote
DAC
2004
ACM
16 years 4 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...
115
Voted
AAAI
2010
15 years 1 months ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
121
Voted
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...