Reasoning with minimal models: efficient algorithms and applications

DOI10.1016/S0004-3702(97)00060-XzbMath0903.68178OpenAlexW2103797177MaRDI QIDQ1127346

Rachel Ben-Eliyahu-Zohary, Luigi Palopoli

Publication date: 13 August 1998

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(97)00060-x

zbMATH Keywords

minimal modelslinear time algorithmsdisjunctive logic programsstable model semanticsdisjunctive databasesdisjunctive default logic

Mathematics Subject Classification ID

Knowledge representation (68T30) Parallel algorithms in computer science (68W10)

Related Items (13)

Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies ⋮ Propositional SAT Solving ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Reasoning under minimal upper bounds in propositional logic ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ An incremental algorithm for generating all minimal models ⋮ On the tractability of minimal model computation for some CNF theories ⋮ Paracoherent answer set computation ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ On the complexity of identifying head-elementary-set-free programs ⋮ Graph-based construction of minimal models ⋮ Enhancing disjunctive logic programming systems by SAT checkers

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

This page was built for publication: Reasoning with minimal models: efficient algorithms and applications