An Anytime Algorithm for Computing Inconsistency Measurement

Yue Ma (1) , Guilin Qi (2) , Guohui Xiao (3) , Pascal Hitzler (4) , Zuoquan Lin (3)

1 LIPN - Laboratoire d'Informatique de Paris-Nord
2 AIFB - Institut für Angewandte Informatik und Formale Beschreibungsverfahren [Karlsruhe]
3 School of Mathematical Sciences, Peking University
4 Kno.e.sis Center, Wright State University, Dayton, OH,USA

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.

Domaines: Intelligence artificielle [cs.AI]

Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zuoquan Lin. An Anytime Algorithm for Computing Inconsistency Measurement. 3rd International Conference on Knowledge Science, Engineering and management, Nov 2009, Austria. pp.29-40. ⟨hal-00422891⟩