Computing abduction by using TMS with top-down expectation

DOI10.1016/S0743-1066(99)00076-XzbMATH Open0957.68018OpenAlexW2029064048WikidataQ128100557 ScholiaQ128100557MaRDI QIDQ4484728FDOQ4484728

Authors: Noboru Iwayama, Ken Satoh 

Publication date: 25 May 2000

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-1066(99)00076-x

Recommendations

• Abduction from logic programs: Semantics and complexity
• Abduction in logic programming: A new definition and an abductive procedure based on rewriting
• A fixpoint characterization of abductive logic programs
• Abduction in well-founded semantics and generalized stable models via tabled dual programs
• Computing extended abduction through transaction programs

zbMATH Keywords

abductionlogic programmingbottom-up procedure

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (5)

• Consistency-based and abductive diagnoses as generalised stable models
• Translating multi-agent autoepistemic logic into logic program
• Complexity results for abductive logic programming
• Modeling the suppression task under weak completion and well-founded semantics
• Contributions to the stable model semantics of logic programs with negation

Uses Software

• Smodels

This page was built for publication: Computing abduction by using TMS with top-down expectation

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