Computing abduction by using TMS with top-down expectation

DOI10.1016/S0743-1066(99)00076-XzbMath0957.68018OpenAlexW2029064048WikidataQ128100557 ScholiaQ128100557MaRDI QIDQ4484728

Ken Satoh, Noboru Iwayama

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

logic programmingabductionbottom-up procedure

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (5)

Consistency-based and abductive diagnoses as generalised stable models ⋮ Modeling the suppression task under weak completion and well-founded semantics ⋮ Complexity results for abductive logic programming ⋮ Contributions to the stable model semantics of logic programs with negation ⋮ Unnamed Item

Uses Software

• Smodels

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