633 search results - page 1 / 127 » Locality and Hard SAT-Instances |
64
Voted
JSAT
2006
14 years 10 months ago
2006
In this note we construct a family of SAT-instance based on Eulerian graphs which are aimed at being hard for resolution based SAT-solvers. We discuss some experiments made with i...
88
Voted
KI
1999
Springer
15 years 2 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...
97
Voted
AAAI
2008
15 years 17 days ago
2008
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
68
Voted
IRI
2007
IEEE
15 years 4 months ago
2007
IEEE
This last decade, propositional reasoning and search has been one of the hottest topics of research in the A.I. community, as the Boolean framework has been recognized as a powerf...
80
Voted
JAIR
2000
14 years 10 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...