Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
Jürgen Dix, Georg Gottlob, Wiktor Marek · Fundamenta Informaticae · 1996
It is wellknown that Minker's semantics GCWA for positive disjunctive programs P, i.e. to decide if a literal is true in all minimal models of P is ΠP2 -complete. This is in contrast to the same entailment problem for semantics of non-disjunctive pro