127 search results - page 5 / 26 » Measuring the Hardness of SAT Instances |
SAT
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
KI
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
AAAI
2010
13 years 8 months ago
2010
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
CP
2007
Springer
14 years 1 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...