283 search results - page 19 / 57 » Solving Over-Constrained Problems with SAT |
AIPS
2008
13 years 10 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suļ¬er from the memory explosion problem and do not...
JAIR
2007
13 years 7 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliļ¬...
CP
2004
Springer
14 years 1 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instanceās empirical hardness. We con...
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...