Pages that link to "Item:Q294760"
From MaRDI portal
The following pages link to Generating all maximal models of a Boolean expression (Q294760):
Displayed 15 items.
- Fast, flexible MUS enumeration (Q272009) (← links)
- Dualization in lattices given by ordered sets of irreducibles (Q507520) (← links)
- Algorithms for \(k\)-meet-semidistributive lattices (Q507534) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- A compact representation for minimizers of \(k\)-submodular functions (Q1631630) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← links)
- Translating between the representations of a ranked convex geometry (Q2032718) (← links)
- Enumerating maximal consistent closed sets in closure systems (Q2117117) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) (Q2835693) (← links)
- Dualization in lattices given by implicational bases (Q5919405) (← links)
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)