115 search results - page 1 / 23 » : Compiling problem specifications into SAT |
76
Voted
AI
2005
Springer
14 years 9 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...
SAT
2005
Springer
15 years 3 months ago
2005
Springer
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
JSAT
2008
14 years 9 months ago
2008
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based o...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
105
click to vote
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Propositional reasoning (SAT) is an essential part of many reasoning tasks. Many problems in computer science can be compiled to SAT and then effectively decided using state-of-th...