## SLDNFA: an abductive procedure for abductive logic programs (1997)

Citations: | 55 - 13 self |

### BibTeX

@MISC{Denecker97sldnfa:an,

author = {Marc Denecker and Danny De Schreye},

title = {SLDNFA: an abductive procedure for abductive logic programs},

year = {1997}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present SLDNFA, an extension of SLDNF-resolution for abductive reasoning on abductive logic programs. SLDNFA solves the floundering abduction problem: non-ground abductive atoms can be selected. SLDNFA provides also 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 which satisfy stronger completeness results. The soundness of SLDNFA and its extensions is proven. Their completeness for minimal solutions with respect to implication, cardinality and set inclusion is investigated. The formalisation of SLDNFA presented here is an update of an older version presented in [13] and does not rely on skolemisation of abductive atoms. 1