On computing all abductive explanations from a propositional Horn theory

DOI10.1145/1284320.1284323zbMATH Open1312.68177OpenAlexW2085261789MaRDI QIDQ3546348FDOQ3546348

Authors Thomas Eiter, Kazuhisa Makino

Publication date 21 December 2008

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1284320.1284323

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60) Logic in artificial intelligence (68T27)

Recommendations

• Computer Science Logic
• Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis
• scientific article; zbMATH DE number 970613
• A Complete Classification of the Complexity of Propositional Abduction
• Abduction from logic programs: Semantics and complexity
• Complexity results for abductive logic programming
• Towards Abductive Reasoning in First-order Logic
• Compilability of propositional abduction
• An abductive proof procedure for conditional logic programming

Cited in

(11)

• Self-duality of bounded monotone Boolean functions and related problems
• Indefinite abductive explanations
• Computer Science Logic
• The approximation of implicates and explanations
• Consequence finding algorithms
• Merge, explain, iterate: a combination of MHS and MXP in an ABox abduction solver
• Support set selection for abductive and default reasoning
• What makes propositional abduction tractable
• Unique key Horn functions
• A calculus for generating ground explanations
• Unranking of small combinations from large sets

This page was built for publication: On computing all abductive explanations from a propositional Horn theory

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