WestminsterResearch will not be accepting deposits until 9th March 2015. This is to allow for a system upgrade and server migration.

Natural deduction system in paraconsistent setting: proof search for PCont

Bolotov, Alexander and Shangin, Vasilyi (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.

Official URL: http://www.informatik.uni-trier.de/~ley/db/conf/ii...


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)
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:10952
Deposited On:27 Jul 2012 12:11
Last Modified:27 Jul 2012 12:11

Repository Staff Only: item control page