Alembic: an efficient algorithm for CNF preprocessing

Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or partial resolution may be applied. Preprocessing aims at simplifying the formula and at increasing the deductive power of th...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Han, Hyojung, Somenzi, Fabio
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Algorithms CNF Costs Data preprocessing distillation Electronic design automation and methodology Forward contracts Hardware > Hardware validation > Functional verification Logic design Logic testing Permission preprocessing SAT Symbiosis Timing Verification
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or partial resolution may be applied. Preprocessing aims at simplifying the formula and at increasing the deductive power of the solver. These two objectives are sometimes competing. We present a new algorithm that combines simplification and increase of deductive power and we show its effectiveness in speeding up SAT solvers.
ISSN:	0738-100X
DOI:	10.1145/1278480.1278628