Computer Science – Logic in Computer Science
Scientific paper
2002-07-25
Computer Science
Logic in Computer Science
15 pages. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiha
Scientific paper
Signed 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.
Besnard Philippe
Schaub Torsten
Tompits Hans
Woltran Stefan
No associations
LandOfFree
Paraconsistent Reasoning via Quantified Boolean Formulas,I: Axiomatising Signed Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Paraconsistent Reasoning via Quantified Boolean Formulas,I: Axiomatising Signed Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Paraconsistent Reasoning via Quantified Boolean Formulas,I: Axiomatising Signed Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-226619