TY - JOUR
T1 - Computational Complexity and Anytime Algorithm for Inconsistency Measurement
JF - International Journal of Software and Informatics
Y1 - 2010
A1 - Yue Ma
A1 - Guilin Qi
A1 - Guohui Xiao
A1 - Pascal Hitzler
A1 - Zuoquan Lin
KW - algorithm
KW - computational complexity
KW - inconsistency measurement
KW - multi-valued logic
AB - 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 give a complete analysis of the computational complexity of computing inconsistency degrees. As it turns out that computing the exact inconsistency degree is intractable, we then propose an anytime algorithm that provides tractable approximations 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.
ER -