Document Type
Conference Proceeding
Publication Date
11-1-2009
Abstract
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods have been proposed to solve this problem and a main class of them is based on some kind of paraconsistent semantics. In this paper, we consider the computational aspects of inconsistency degrees of propositional knowledge bases under 4-valued semantics. We first analyze its computational complexity. As it turns out that computing the exact inconsistency degree is intractable, we then propose an anytime algorithm that provides tractable approximation of the inconsistency degree from above and below. We show that our algorithm satisfies some desirable properties and give experimental results of our implementation of the algorithm.
Repository Citation
Ma, Y.,
Qi, G.,
Xiao, G.,
Hitzler, P.,
& Lin, Z.
(2009). An Anytime Algorithm for Computing Inconsistency Measurement. Lecture Notes in Computer Science, 5914, 29-40.
https://corescholar.libraries.wright.edu/cse/152
DOI
10.1007/978-3-642-10488-6_7
Included in
Bioinformatics Commons, Communication Technology and New Media Commons, Databases and Information Systems Commons, OS and Networks Commons, Science and Technology Studies Commons
Comments
Presented at the Third International Conference on Knowledge Science, Engineering, and Management, Vienna, Austria, November 25-27, 2009.
Attached is the unpublished, authors' version of this proceeding. The final, publisher's version can be found at http://dx.doi.org/10.1007/978-3-642-10488-6_7.