159 search results - page 7 / 32 » On the Complexity of SAT |
168
click to vote
AAAI
2008
15 years 8 months 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...
150
click to vote
AI
2005
Springer
15 years 5 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...
181
click to vote
ESSLLI
2009
Springer
15 years 3 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
160
click to vote
CP
2007
Springer
15 years 12 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...
168
click to vote
ISMVL
2000
IEEE
15 years 10 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...