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

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!