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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information processing letters Ročník 74; číslo 3; s. 157 - 162
Hlavní autori: Kavvadias, Dimitris J., Sideri, Martha, Stavropoulos, Elias C.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 31.05.2000
Elsevier Sequoia S.A
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia: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