Inconsistency and preservation

Authors:
Paul Wong
Affiliations:
Computer Science Laboratory, Research School of Information Sciences and Engineering, Australian National University
Venue:
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Year:
2000

Citing 7
Cited 0

Paraconsistent logic programming

Theoretical Computer Science
A logic for reasoning with inconsistency

Journal of Automated Reasoning
A nonstandard approach to the logical omniscience problem

Artificial Intelligence
Inconsistency management and prioritized syntax-based entailment

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Circumscribing inconsistency

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Generalised inference and inferential modelling

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
How to infer from inconsistent beliefs without revising

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the main goals of paraconsistent logics is to develop a theory of reasoning that can tolerate inconsistencies. In this paper we present a novel way to analyze and compare several paraconsistent reasoning mechanisms in terms of their preservational properties. The main idea is that although an inconsistent set of data cannot all be true, such a set may nevertheless carry useful properties that are worthy of preservation. One of these properties provides a theoretically interesting way to meaisure the relative incoherence of a data set; another one provides a way to measure the quantity of empirical information in an inconsistent set.