Effective preprocessing in SAT through variable and clause elimination
Artikel i vetenskaplig tidskrift, 2005

Preprocessing SAT instances can reduce their size considerably. We combine variable elimination with subsumption and self-subsuming resolution, and show that these techniques not only shrink the formula further than previous preprocessing efforts based on variable elimination, but also decrease runtime of SAT solvers substantially for typical industrial SAT problems. We discuss critical implementation details that make the reduction procedure fast enough to be practical.

Författare

Niklas Een

Chalmers, Data- och informationsteknik

A. Biere

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 3569 61-75

Ämneskategorier

Datavetenskap (datalogi)