Prime clauses for fast enumeration of satisfying assignments to Boolean circuits

Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording propositional satisfiability solver with the ability to add blocking clauses, which prevent the solver from visiting the...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	HoonSang Jin, Somenzi, F.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Application software Arithmetic Computer science Contracts Hardware Logic circuits Logic design Performance analysis Permission
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!