An Abductive Semantics for Disjunctive Logic Programs and its Proof Procedure

While it is well-known how normal logic programs may be viewed as a form of abduction and argumentation, the problem of how disjunctive programs may be used for abductive reasoning is rarely discussed. In this paper we propose an abductive semantics for disjunctive logic programs with default negation and show that Eshghi and Kowalski's abductive proof procedure for normal programs can be adopted to compute abductive solutions for disjunctive programs