Sciweavers

ICTAI
2003
IEEE
13 years 10 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
SAT
2009
Springer
108views Hardware» more  SAT 2009»
13 years 11 months ago
On-the-Fly Clause Improvement
Most current propositional SAT solvers apply resolution at various stages to derive new clauses or simplify existing ones. The former happens during conflict analysis, while the l...
HyoJung Han, Fabio Somenzi