Search

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]

Abstract: In the first part of this paper, we motivated and defined three systems of constructive and inconsistency-tolerant description logic. The variety of arising systems is conditioned by the variety of approaches to defining modalities in the constructive setting. We also presented sound and complete tableau calculi for the logics under consideration. Whereas these calculi were not meant to give rise to tableau algorithms, in the present second part of the paper, after providing some motivation and recalling the main definitions, we adapt methods developed by R. Dyckhoff and by I. Horrocks and U. Sattler in order to define a tableau algorithm for our basic four-valued constructive description logic . Notice that among the three logics defined in the first part of the paper, is the only logic which lends itself to applications, because for the other logics it is unknown whether they are elementarily decidable. The presented algorithm for is the first example of an elementary decision procedure for a constructive description logic. [Copyright &y& Elsevier]