<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Yue Ma</style></author><author><style face="normal" font="default" size="100%">Guilin Qi</style></author><author><style face="normal" font="default" size="100%">Guohui Xiao</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Zuoquan Lin</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computational Complexity and Anytime Algorithm for Inconsistency Measurement</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Software and Informatics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">algorithm</style></keyword><keyword><style  face="normal" font="default" size="100%">computational complexity</style></keyword><keyword><style  face="normal" font="default" size="100%">inconsistency measurement</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge representation</style></keyword><keyword><style  face="normal" font="default" size="100%">multi-valued logic</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.ijsi.org/ch/reader/view_abstract.aspx?file_no=i41&amp;flag=1</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">3–21</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;rtejustify&quot;&gt;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&lt;/p&gt;
</style></abstract></record></records></xml>