62 search results - page 5 / 13 » On SAT instance classes and a method for reliable performanc... |
JSAT
2008
13 years 7 months ago
2008
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...
EXPCS
2007
13 years 11 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
AI
2005
Springer
13 years 7 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
CSCLP
2004
Springer
14 years 1 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...
SAT
2010
Springer
13 years 6 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...