283 search results - page 38 / 57 » Solving Over-Constrained Problems with SAT |
JACM
2007
13 years 9 months ago
2007
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
SAT
2004
Springer
14 years 2 months ago
2004
Springer
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
CSCLP
2004
Springer
14 years 2 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
JAIR
2008
13 years 9 months ago
2008
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...