An abductive framework for negation in disjunctive logic programming

In this paper, we study an abductive framework for disjunctive logic programming that provides a new may to understand negation in disjunctive logic programming. We show that the defined framework captures the existing minimal model semantics based on (Extended) Generalised Closed World Assumption ((E)GCWA). This relationship between abduction and minimal model reasoning provides a methodalogy to develop algorithms for minimal model reasoning. To demonstrate this, me show how a theorem prover, based on restart model elimination calculus, can be modified for abductive reasoning and thus for minimal model reasoning.