Output details

Natural deduction system in paraconsistent setting: proof search for PCont

<12> Originality: Many modern computer applications such as distributed networked systems, are deployed in heterogeneous environments. Hence, their underlying knowledge or data base may contain internal conflicts. To overcome potential “deductive explosion” here paraconsistent logics were developed but they lacked efficient deduction. The paper bridges this gap introducing a proof search technique for paraconsistent natural deduction.

Significance: The presented technique has an important methodological power allowing us to localise contradictions and deal with them in a safe fashion amenable for an efficient implementation.

Rigour: Mathematical proofs of the soundness, completeness and termination of the proposed method are given.