… Specifically, we show that a large class of extended disjunctive logic programs (EDLPs) can
be compiled in polynomial time into a propositional theory such that each model of the latter …

… extended disjunctive logic programs. Besides, we generalize previously derived complexity
results for the generalized closed world assumption and other more sophisticated variants of …

… of extended disjunctive logic programs and introduce some of the notation needed in the
following sections. An extended disjunctive logic program, edlp , is a (possibly infinite) set of …

… logic programming as a knowledge representation tool, in comparison with classical logic,
is that logic programming does … , we extend the class of general logic programs by including …

… 9 In section 6, we show how our approach can be easily generalized to the class of extended
logic programs with the so-called "classical" (or strong) negation. 9 In section 7, we discuss …

… of disjunctive program clauses as defaults we obtain two different notions of answer sets
for disjunctive logic programs (ratzonal answer sets and extended rational answer sets). Both …

… In Section 6 we extend our results to programs permitting the use of "classical" negation.
For the sake of completeness, the paper partially repeats the discussion contained in Ref. 25) …

… We extend the satisfaction relation of L Σ to logic programs in the following way. An interpretation
I satisfies a rule head H 1 | ⋯ | H k if it satisfies some H i ; I satisfies a closed instance r …

… disjunctive programs for generality, but our results are still interesting if speciahzed to normal
programs. … Finally, we will define in this paper a disjunctive extension of the well-founded se…

… Accordingly, in this paper we will suggest an extension of the abstract argumentation theory
… and disjunctive programming, the semantics suggested for disjunctive logic programs will …