Computing abduction by using TMS with top-down expectation

DOI10.1016/S0743-1066(99)00076-XMaRDI QIDQ4484728zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

abductionlogic programmingbottom-up procedure

Mathematics Subject Classification ID

Logic programming (68N17)

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

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

Describes a project that uses

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)