On deductive bases for paraconsistent answer set semantics

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 e...

Full description

Saved in:
Bibliographic Details
Published in:Journal of applied non-classical logics 2013-06, Vol.23 (1-2), p.131-146
Main Authors: Mayatskiy, N.V., Odintsov, S.P.
Format: Article
Language:English
Subjects:
answer set
Computer science
deductive base
lattice of logics
Logic programming
Nelson logic
paraconsistency
Semantics
strong negation
twist-structures
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1166-3081
1958-5780
DOI:10.1080/11663081.2013.798971