Effective Preprocessing in SAT Through Variable and Clause Elimination

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 runt...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Lecture notes in computer science 2005, Vol.3569, p.61-75
Hauptverfasser:	Eén, Niklas, Biere, Armin
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Binary Clause Candidate Clause Computer science control theory systems Exact sciences and technology Logical, boolean and switching functions Original Clause Theoretical computing Unit Clause Variable Elimination
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!