Generating all maximal models of a Boolean expression
From MaRDI portal
Publication:294760
DOI10.1016/S0020-0190(00)00023-5zbMATH Open1339.03015MaRDI QIDQ294760FDOQ294760
Martha Sideri, Elias C. Stavropoulos, Dimitris J. Kavvadias
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35)
Cites Work
- The complexity of selecting maximal solutions
- The complexity of satisfiability problems
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- How to assign votes in a distributed system
- On generating all maximal independent sets
- An algorithm to compute circumscription
- Characterizing diagnoses and systems
- The complexity of model checking for circumscriptive formulae
- On computing minimal models
- Horn functions and submodular Boolean functions
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- Model-preference default theories
- The Inverse Satisfiability Problem
- NP-completeness: A retrospective
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Dualization in lattices given by implicational bases
- Fast, flexible MUS enumeration
- A compact representation for minimizers of \(k\)-submodular functions
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Minimal sets on propositional formulae. Problems and reductions
- On the counting complexity of propositional circumscription
- Translating between the representations of a ranked convex geometry
- Enumerating maximal consistent closed sets in closure systems
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)
- Resolution based algorithms for the transversal hypergraph generation problem
- Algorithms for \(k\)-meet-semidistributive lattices
- Dualization in lattices given by ordered sets of irreducibles
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- MCS Extraction with Sublinear Oracle Queries
- Redundancy in logic. II: 2CNF and Horn propositional formulae
This page was built for publication: Generating all maximal models of a Boolean expression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294760)
