Reasoning with minimal models: efficient algorithms and applications

DOI10.1016/S0004-3702(97)00060-XMaRDI QIDQ1127346zbMATH OpenOpenAlexFDO

Authors 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

disjunctive logic programslinear time algorithmsminimal modelsstable model semanticsdisjunctive databasesdisjunctive default logic

Mathematics Subject Classification ID

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

Recommendations

• On the tractability of minimal model computation for some CNF theories
• On computing minimal models
• Logic Programming
• A tableau calculus for minimal model reasoning
• Computing minimal models, stable models and answer sets

Cites work

• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• scientific article; zbMATH DE number 140388 (Why is no real title available?)
• scientific article; zbMATH DE number 140397 (Why is no real title available?)
• scientific article; zbMATH DE number 978240 (Why is no real title available?)
• scientific article; zbMATH DE number 1114053 (Why is no real title available?)
• scientific article; zbMATH DE number 1149406 (Why is no real title available?)
• A Probabilistic Causal Model for Diagnostic Problem Solving Part I: Integrating Symbolic Causal Inference with Numeric Probabilistic Inference
• A logic for default reasoning
• Characterizing diagnoses and systems
• Circumscription - a form of non-monotonic reasoning
• Default reasoning using classical logic
• Depth-First Search and Linear Graph Algorithms
• Diagnosing multiple faults
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Mixed integer programming methods for computing nonmonotonic deductive databases
• Negation and minimality in disjunctive databases
• On computing minimal models
• On the impact of stratification on the complexity of nonmonotonic reasoning
• Programming with non-determinism in deductive databases
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Propositional semantics for disjunctive logic programs
• Some computational aspects of circumscription
• The complexity of model checking for circumscriptive formulae
• The complexity of satisfiability problems
• Unification as a complexity measure for logic programming

Cited in

(15)

• A tableau calculus for minimal model reasoning
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• An incremental algorithm for generating all minimal models
• Paracoherent answer set computation
• Reasoning under minimal upper bounds in propositional logic
• Propositional SAT solving
• Minimal sets on propositional formulae. Problems and reductions
• On the complexity of identifying head-elementary-set-free programs
• Optimizing answer set computation via heuristic-based decomposition
• On the tractability of minimal model computation for some CNF theories
• scientific article; zbMATH DE number 1614696 (Why is no real title available?)
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Enhancing disjunctive logic programming systems by SAT checkers
• Graph-based construction of minimal models
• Complexity results for answer set programming with bounded predicate arities and implications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127346)