Reasoning with minimal models: efficient algorithms and applications
From MaRDI portal
Publication:1127346
DOI10.1016/S0004-3702(97)00060-XzbMath0903.68178MaRDI QIDQ1127346
Rachel Ben-Eliyahu-Zohary, Luigi Palopoli
Publication date: 13 August 1998
Published in: Artificial Intelligence (Search for Journal in Brave)
minimal models; linear time algorithms; disjunctive logic programs; stable model semantics; disjunctive databases; disjunctive default logic
Related Items
Enhancing disjunctive logic programming systems by SAT checkers, Reasoning under minimal upper bounds in propositional logic, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, Complexity results for answer set programming with bounded predicate arities and implications, An incremental algorithm for generating all minimal models, On the complexity of identifying head-elementary-set-free programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diagnosing multiple faults
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Characterizing diagnoses and systems
- The complexity of model checking for circumscriptive formulae
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Programming with non-determinism in deductive databases
- On computing minimal models
- Propositional semantics for disjunctive logic programs
- Default reasoning using classical logic
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Negation and minimality in disjunctive databases
- Some computational aspects of circumscription
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- A Probabilistic Causal Model for Diagnostic Problem Solving Part I: Integrating Symbolic Causal Inference with Numeric Probabilistic Inference
- Unification as a complexity measure for logic programming
- On the impact of stratification on the complexity of nonmonotonic reasoning
- Mixed integer programming methods for computing nonmonotonic deductive databases
- The complexity of satisfiability problems
- Depth-First Search and Linear Graph Algorithms
