Natural deduction system in paraconsistent setting: proof search for PCont

Bolotov, A. and Shangin, V. (2011) Natural deduction system in paraconsistent setting: proof search for PCont. In: In the Proceedings of the 5th Indian International Conference on Artificial Intelligence (IICAI-2011), 14th - 16th December 2011, Tumkur, Karnataka State, India.

Full text not available from this repository.

Abstract

This paper continues a systematic approach to build natural deduction calculi and corresponding proof procedures for non-classical logics. Our attention is now paid to the framework of paraconsistent logics. These logics are used, in particular, for reasoning about systems where paradoxes do not lead to the `deductive explosion', i.e., where formulae of the type `A follows from false', for any A, are not valid. We formulate the natural deduction system for the logic PCont, explain its main concepts, define a proof searching technique and illustrate it by examples. The presentation is accompanied by demonstrating the correctness of these developments.

Item Type: Conference or Workshop Item (Paper)
Subjects: University of Westminster > Science and Technology
SWORD Depositor: repository@westminster.ac.uk
Depositing User: repository@westminster.ac.uk
Date Deposited: 27 Jul 2012 11:11
Last Modified: 30 Jun 2016 14:08
URI: http://westminsterresearch.wmin.ac.uk/id/eprint/10952

Actions (login required)

Edit Item (Repository staff only) Edit Item (Repository staff only)