An abductive proof procedure for conditional logic programming

DOI10.1007/3-540-61313-7_76MaRDI QIDQ4632300zbMATH OpenOpenAlexFDO

Authors Alberto Martelli, Maria Luisa Sapino, Laura Giordano

Publication date 29 April 2019

Published in Practical Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61313-7_76

zbMATH Keywords

admissible solutionintegrity constraintlogic programlogic programmingoperational semantics

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Conditional reasoning in logic programming
• Hypothetical updates, priority and inconsistency in a logic programming language
• scientific article; zbMATH DE number 928020
• Logics in Artificial Intelligence
• AI*IA 2005: Advances in Artificial Intelligence

Cites work

• Computing the acceptability semantics
• scientific article; zbMATH DE number 44621 (Why is no real title available?)
• scientific article; zbMATH DE number 928020 (Why is no real title available?)
• N-Prolog: An extension of Prolog with hypothetical implications. I.
• Ordered Logic Programming with Sets

Cited in

(10)

• On computing all abductive explanations from a propositional Horn theory
• The IFF proof procedure for abductive logic programming
• scientific article; zbMATH DE number 2019872 (Why is no real title available?)
• Conditional reasoning in logic programming
• scientific article; zbMATH DE number 928020 (Why is no real title available?)
• Hypothetical updates, priority and inconsistency in a logic programming language
• Using Abduction to Compute Efficient Proofs
• AI*IA 2005: Advances in Artificial Intelligence
• Logic Programming
• An abductive proof procedure for reasoning about actions in modal logic programming

This page was built for publication: An abductive proof procedure for conditional logic programming

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