155
click to vote
SAT
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...
SAT
2010
Springer
15 years 8 months ago
2010
Springer
146
click to vote
SAT
2010
Springer
15 years 8 months ago
2010
Springer
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
128
click to vote
SAT
2010
Springer
15 years 8 months ago
2010
Springer
Robustness and correctness are essential criteria for SAT and QBF solvers. We develop automated testing and debugging techniques designed and optimized for SAT and QBF solver devel...