Paraconsistent Reasoning via Quantified Boolean Formulas,I: Axiomatising Signed Systems

Simple item page
dc.creatorBesnard, Philippe
dc.creatorSchaub, Torsten
dc.creatorTompits, Hans
dc.creatorWoltran, Stefan
dc.date2002-07-25
dc.date.accessioned2026-07-07T03:18:44Z
dc.date.available2026-07-07T03:18:44Z
dc.descriptionSigned systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent consequence relations can be axiomatised by means of quantified Boolean formulas. This approach has several benefits. First, it furnishes an axiomatic specification of paraconsistent reasoning within the framework of signed systems. Second, this axiomatisation allows us to identify upper bounds for the complexity of the different signed consequence relations. We strengthen these upper bounds by providing strict complexity results for the considered reasoning tasks. Finally, we obtain an implementation of different forms of paraconsistent reasoning by appeal to the existing system QUIP.
dc.description15 pages. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/)
dc.identifierhttps://arxiv.org/abs/cs/0207084
dc.identifierhttp://arxiv.org/abs/cs/0207084
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31233
dc.subjectLogic in Computer Science
dc.subjectComputational Complexity
dc.subjectF.4.1; F.1.3; I.2.3; I.2.4
dc.titleParaconsistent Reasoning via Quantified Boolean Formulas,I: Axiomatising Signed Systems
dc.typetext

Files

Collections

arXiv