Representing Incomplete Knowledge in Abductive Logic Programming

DOI10.1093/logcom/5.5.553zbMath0832.68023OpenAlexW2041428960MaRDI QIDQ4849644

Danny De Schreye, Marc Denecker

Publication date: 20 February 1996

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c34d0a1c30a169ba16a6abf20bc751149ed2801c

zbMATH Keywords

situation calculusabductive logic programming

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items

Reasoning about interaction protocols for customizing web service selection and composition ⋮ A Measure of Arbitrariness in Abductive Explanations ⋮ Abduction from logic programs: Semantics and complexity ⋮ A unifying view for logic programming with non-monotonic reasoning ⋮ Complexity results for abductive logic programming ⋮ A terminological interpretation of (abductive) logic programming ⋮ Situation calculus specifications for event calculus logic programs ⋮ An abductive framework for extended logic programming ⋮ Three-valued completion for abductive logic programs ⋮ Indefinite abductive explanations ⋮ Abductive reasoning through filtering

This page was built for publication: Representing Incomplete Knowledge in Abductive Logic Programming