Generating all maximal models of a Boolean expression
Authors:
- Dimitris J. KavvadiasDKDimitris J. Kavvadias
- Martha SideriMSMartha Sideri
- Elias C. StavropoulosESElias C. Stavropoulos
- 1 May 2000
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 74 (3-4) , 157-162
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- The Inverse Satisfiability ProblemSIAM Journal on Computing, 1998
- Horn functions and submodular boolean functionsTheoretical Computer Science, 1997
- On the Complexity of Dualization of Monotone Disjunctive Normal FormsJournal of Algorithms, 1996
- On computing minimal modelsAnnals of Mathematics and Artificial Intelligence, 1996
- Identifying the Minimal Transversals of a Hypergraph and Related ProblemsSIAM Journal on Computing, 1995
- The Complexity of Selecting Maximal SolutionsInformation and Computation, 1995
- The complexity of model checking for circumscriptive formulaeInformation Processing Letters, 1992
- Characterizing diagnoses and systemsArtificial Intelligence, 1992
- On generating all maximal independent setsInformation Processing Letters, 1988
- How to assign votes in a distributed systemJournal of the ACM, 1985