SLDNFA: An abductive procedure for abductive logic programs

44Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

We present SLDNFA, an extension of SLDNF resolution for abductive reasoning on abductive logic programs. SLDNFA solves the floundering abduction problem: nonground abductive atoms can be selected. SLDNFA also provides a partial solution for the floundering negation problem. Different abductive answers can be derived from an SLDNFA refutation; these answers provide different compromises between generality and comprehensibility. Two extensions of SLDNFA are proposed that satisfy stronger completeness results. The soundness of SLDNFA and its extensions is proved. Their completeness for minimal solutions with respect to implication, cardinality, and set inclusion is investigated. The formalization of SLDNFA presented here is an update of an older version and does not rely on skolemization of abductive atoms. © Elsevier Science Inc., 1998.

Cite

CITATION STYLE

APA

Denecker, M., & De Schreye, D. (1998). SLDNFA: An abductive procedure for abductive logic programs. Journal of Logic Programming, 34(2), 111–167. https://doi.org/10.1016/S0743-1066(97)00074-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free