Abduction in logic programming as second-order quantifier elimination

DOI10.1007/978-3-642-40885-4_8MaRDI QIDQ2849485zbMATH OpenOpenAlexFDO

Authors Christoph Wernhard

Publication date 20 September 2013

Published in Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40885-4_8

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Logic programming (68N17) Semantics in the theory of computing (68Q55) Logic in artificial intelligence (68T27)

Recommendations

• Abduction from logic programs: Semantics and complexity
• Abduction in logic programming: A new definition and an abductive procedure based on rewriting
• An abductive framework for extended logic programming
• Complexity results for abductive logic programming
• On the Relationship Between Abduction and Deduction

Cited in

(5)

• Abduction in logic programming: A new definition and an abductive procedure based on rewriting
• A superposition calculus for abductive reasoning
• Second-order quantifier elimination on relational monadic formulas -- a basic method and some less expected applications
• scientific article; zbMATH DE number 2032415 (Why is no real title available?)
• scientific article; zbMATH DE number 970711 (Why is no real title available?)

Describes a project that uses

Uses Software

• ToyElim

This page was built for publication: Abduction in logic programming as second-order quantifier elimination

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