On deductive bases for paraconsistent answer set semantics.

It was proved by Odintsov and Pearce that the logicis a deductive base for paraconsistent answer set semantics (PAS) of logic programs with two kinds of negation. Here we describe the lattice of logics extending, characterise these logics via classes of-models, and prove that none of the proper extensions ofis a deductive base for PAS. [ABSTRACT FROM AUTHOR]