## On the Computational Cost of Disjunctive Logic Programming: Propositional Case (1995)

Citations: | 112 - 26 self |

### BibTeX

@MISC{Eiter95onthe,

author = {Thomas Eiter and Georg Gottlob},

title = {On the Computational Cost of Disjunctive Logic Programming: Propositional Case},

year = {1995}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper addresses complexity issues for important problems arising with disjunctive logic programming. In particular, the complexity of deciding whether a disjunctive logic program is consistent is investigated for a variety of well-known semantics, as well as the complexity of deciding whether a propositional formula is satised by all models according to a given semantics. We concentrate on nite propositional disjunctive programs with as wells as without integrity constraints, i.e., clauses with empty heads; the problems are located in appropriate slots of the polynomial hierarchy. In particular, we show that the consistency check is P 2 -complete for the disjunctive stable model semantics (in the total as well as partial version), the iterated closed world assumption, and the perfect model semantics, and we show that the inference problem for these semantics is P 2 -complete; analogous results are derived for the an