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.
We acknowledge support by OSEO, agence nationale de valorisation de la recherche in the Quaero project.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hunter, A.: How to act on inconsistent news: Ignore, resolve, or reject. Data Knowl. Eng. 57, 221–239 (2006)
Hunter, A.: Measuring inconsistency in knowledge via quasi-classical models. In: Proc. of AAAI 2002, pp. 68–73. AAAI Press, Menlo Park (2002)
Hunter, A., Konieczny, S.: Approaches to measuring inconsistent information. In: Bertossi, L., Hunter, A., Schaub, T. (eds.) Inconsistency Tolerance. LNCS, vol. 3300, pp. 191–236. Springer, Heidelberg (2005)
Hunter, A., Konieczny, S.: Shapley inconsistency values. In: Proc. of KR 2006, pp. 249–259. AAAI Press, Menlo Park (2006)
Mu, K., Jin, Z., Lu, R., Liu, W.: Measuring inconsistency in requirements specifications. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 440–451. Springer, Heidelberg (2005)
Knight, K.: Measuring inconsistency. Journal of Philosophical Logic 31(1), 77–98 (2002)
Hunter, A., Konieczny, S.: Measuring inconsistency through minimal inconsistent sets. In: Proc. of KR 2008, pp. 358–366 (2008)
Grant, J.: Classifications for inconsistent theories. Notre Dame J. of Formal Logic 19, 435–444 (1978)
Grant, J., Hunter, A.: Measuring inconsistency in knowledgebases. Journal of Intelligent Information Systems 27, 159–184 (2006)
Grant, J., Hunter, A.: Analysing inconsistent first-order knowledge bases. Artif. Intell. 172, 1064–1093 (2008)
Coste-Marquis, S., Marquis, P.: A unit resolution-based approach to tractable and paraconsistent reasoning. In: Proc. of ECAI, pp. 803–807 (2004)
Ma, Y., Qi, G., Hitzler, P., Lin, Z.: An algorithm for computing inconsistency measurement by paraconsistent semantics. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 91–102. Springer, Heidelberg (2007)
Belnap, N.D.: A useful four-valued logic. In: Modern uses of multiple-valued logics, pp. 7–73. Reidel Publishing Company, Boston (1977)
Arieli, O., Avron, A.: The value of the four values. Artif. Intell. 102, 97–141 (1998)
Papadimitriou, C.H. (ed.): Computational Complexity. Addison Wesley, Reading (1994)
Schaerf, M., Cadoli, M.: Tractable reasoning via approximation. Artificial Intelligence 74, 249–310 (1995)
Cadoli, M., Schaerf, M.: On the complexity of entailment in propositional multivalued logics. Ann. Math. Artif. Intell. 18, 29–50 (1996)
Malouf, R.: Maximal consistent subsets. Computational Linguistics 33, 153–160 (2007)
Mu, K., Jin, Z., Liu, W., Zowghi, D.: An approach to measuring the significance of inconsistency in viewpoints framework. Technical report, Peking University (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, Y., Qi, G., Xiao, G., Hitzler, P., Lin, Z. (2009). An Anytime Algorithm for Computing Inconsistency Measurement. In: Karagiannis, D., Jin, Z. (eds) Knowledge Science, Engineering and Management. KSEM 2009. Lecture Notes in Computer Science(), vol 5914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10488-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-10488-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10487-9
Online ISBN: 978-3-642-10488-6
eBook Packages: Computer ScienceComputer Science (R0)