Generating all maximal models of a Boolean expression

We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an expression while preserving its set of maximal models. We present an output-polynomial algorithm for the 2CNF case and we...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters Jg. 74; H. 3; S. 157 - 162
Hauptverfasser: Kavvadias, Dimitris J., Sideri, Martha, Stavropoulos, Elias C.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 31.05.2000
Elsevier Sequoia S.A
Schlagworte:
Algorithms
Boolean
Computational complexity
Computer programming
Graphs
Maximal model generation
Output-polynomial
Studies
Transversal hypergraph
Output-polynomial
Transversal hypergraph
Algorithms
Computational complexity
Maximal model generation
ISSN:0020-0190, 1872-6119
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an expression while preserving its set of maximal models. We present an output-polynomial algorithm for the 2CNF case and we show that the problem cannot be solved in output-polynomial time in the case of Horn expressions, unless P= NP , despite an affinity of this case to the recently subexponentially solved transversal hypergraph problem. The problem is of course trivial for 1-valid and anti-Horn expressions, and open for exclusive-ors; it is NP-hard in all other cases.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(00)00023-5