On computing minimal models
From MaRDI portal
Publication:1380414
DOI10.1007/BF02136172zbMath0891.68109MaRDI QIDQ1380414
Rachel Ben-Eliyahu, Rina Dechter
Publication date: 4 March 1998
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Related Items (12)
Generating all maximal models of a Boolean expression ⋮ SAT-Based Horn Least Upper Bounds ⋮ Propositional SAT Solving ⋮ Reasoning with minimal models: efficient algorithms and applications ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ Beyond NP: Quantifying over Answer Sets ⋮ An incremental algorithm for generating all minimal models ⋮ On the tractability of minimal model computation for some CNF theories ⋮ All-Termination(T) ⋮ MCS Extraction with Sublinear Oracle Queries ⋮ Semantical and computational aspects of Horn approximations ⋮ Graph-based construction of minimal models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Near-Horn prolog and beyond
- Diagnosing multiple faults
- A theory of diagnosis from first principles
- Network-based heuristics for constraint-satisfaction problems
- Polynomially solvable satisfiability problems
- Tree clustering for constraint networks
- Circumscription - a form of non-monotonic reasoning
- Characterizing diagnoses and systems
- A hierarchy of tractable satisfiability problems
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- A sufficient condition for backtrack-bounded search
- Unification as a complexity measure for logic programming
- On the Complexity of Timetable and Multicommodity Flow Problems
This page was built for publication: On computing minimal models
