Complexity results for abductive logic programming

DOI10.1007/3-540-59487-6_1MaRDI QIDQ5101437zbMATH OpenOpenAlexFDO

Authors Thomas Eiter, Georg Gottlob, N. Leone

Publication date 30 August 2022

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59487-6_1

Mathematics Subject Classification ID

Logic programming (68N17) Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Abduction from logic programs: Semantics and complexity
• scientific article; zbMATH DE number 512816
• The complexity of logic-based abduction
• A Complete Classification of the Complexity of Propositional Abduction
• Semantics and complexity of abduction from default theories

Cites work

• Abduction versus closure in causal theories.
• Abductive Logic Programming
• Autoepistemic logic
• Computing abduction by using TMS with top-down expectation
• General logical databases and programs: Default logic semantics and stratification
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• scientific article; zbMATH DE number 47350 (Why is no real title available?)
• scientific article; zbMATH DE number 88998 (Why is no real title available?)
• scientific article; zbMATH DE number 512816 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• Logic programming and knowledge representation
• On the Relationship Between Abduction and Deduction
• Representing Incomplete Knowledge in Abductive Logic Programming
• SLDNFA: An abductive procedure for abductive logic programs
• The well-founded semantics for general logic programs

Cited in

(20)

• Abduction from logic programs: Semantics and complexity
• Semantics and complexity of abduction from default theories
• Complexity and undecidability results for logic programming
• Scalable algorithms for abduction via enumerative syntax-guided synthesis
• Abduction in logic programming as second-order quantifier elimination
• A measure of arbitrariness in abductive explanations
• The Complexity of Abduction for Equality Constraint Languages
• The complexity of handling minimal solutions in logic-based abduction
• A fixpoint characterization of abductive logic programs
• scientific article; zbMATH DE number 4166861 (Why is no real title available?)
• On computing all abductive explanations from a propositional Horn theory
• scientific article; zbMATH DE number 2000816 (Why is no real title available?)
• Abductive logic programs with penalization: semantics, complexity and implementation
• scientific article; zbMATH DE number 1926614 (Why is no real title available?)
• scientific article; zbMATH DE number 1884352 (Why is no real title available?)
• scientific article; zbMATH DE number 1420820 (Why is no real title available?)
• Computer Science Logic
• Foundations of Information and Knowledge Systems
• Equivalence issues in abduction and induction
• On the complexity of second-best abductive explanations

This page was built for publication: Complexity results for abductive logic programming

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