On deductive bases for paraconsistent answer set semantics
N.V. Mayatskiy, Sergei Pavlovich Odintsov · Journal of Applied Non-Classical Logics · 2013
It was proved by Odintsov and Pearce that the logic is 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 of is a deductive base for PAS.