Sciweavers

AAAI
2008
13 years 7 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
SAT
2004
Springer
99views Hardware» more  SAT 2004»
13 years 10 months ago
Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
Carlos Ansótegui, Felip Manyà