Transforming abductive logic programs to disjunctive programs
Katsumi Inoue, Chiaki Sakama · 1993
A new fixpoint semantics for abductive logic programs is provided, in which the generalized stable models of an abductive program are characterized as the fixpoint of a disjunctive program obtained by a suitable program transformation. In the transformation, both negative hypotheses through negation as failure and positive hypotheses from the abducibles are dealt with uniformly. This characterization allows us to have a parallel bottomup model generation procedure for computing abductive explanations from arbitrary (range-restricted and function-free) general, extended, and disjunctive programs with integrity constraints. 1 Introduction Abduction, an inference to explanation, has recently been recognized as a very important form of reasoning for logic programming as well as various AI problems. In [EK89, KM90, Gel90, Ino91], abduction is expressed as an extension of logic programming. Eshghi and Kowalski [EK89] give an abductive interpretation of negation as failure [Cla78] in the cl...