01498nas a2200205 4500008004100000245008100041210006900122300000900191520087500200653001401075653002901089653003001118653002301148100001201171700001501183700001701198700002001215700001701235856004001252 2010 eng d00aComputational Complexity and Anytime Algorithm for Inconsistency Measurement0 aComputational Complexity and Anytime Algorithm for Inconsistency a3-213 aMeasuring 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. 10aalgorithm10acomputational complexity10ainconsistency measurement10amulti-valued logic1 aMa, Yue1 aQi, Guilin1 aXiao, Guohui1 aHitzler, Pascal1 aLin, Zuoquan uhttp://knoesis.wright.edu/node/161801252nas a2200145 4500008004100000245006500041210006200106520081700168100001200985700001500997700001701012700001701029700002001046856004001066 2009 eng d00aAn Anytime Algorithm for Computing Inconsistency Measurement0 aAnytime Algorithm for Computing Inconsistency Measurement3 aMeasuring 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.1 aMa, Yue1 aQi, Guilin1 aXiao, Guohui1 aLin, Zuoquan1 aHitzler, Pascal uhttp://knoesis.wright.edu/node/124601297nas a2200133 4500008004100000245007700041210006900118260006200187520082500249100001201074700001701086700002001103856004001123 2008 eng d00aParaconsistent Reasoning for Expressive and Tractable Description Logics0 aParaconsistent Reasoning for Expressive and Tractable Descriptio b21st International Workshop on Description Logics, DL20083 aFour-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases, mainly ALC. This approach has a distinct advantage that it can be implemented by invoking classical reasoners to keep the same complexity as classical semantics. In this paper, we further study how to extend the four-valued semantics to more expressive description logics, such as SHIQ, and to more tractable description logics including EL++, DL-Lite, and Horn-DLs. The most effort we spend defining the four-valued semantics of expressive four-valued description logics is on keeping the reduction from four-valued semantics to classical semantics as in the case of ALC; While for tractable description logics, we mainly focus on how to maintain their tractability when adopting four-valued semantics.1 aMa, Yue1 aLin, Zuoquan1 aHitzler, Pascal uhttp://knoesis.wright.edu/node/184901109nas a2200157 4500008004100000245008500041210006900126260002100195300001100216520062000227100001200847700001500859700001700874700002000891856004000911 2007 eng d00aAn Algorithm for Computing Inconsistency Measurement by Paraconsistent Semantics0 aAlgorithm for Computing Inconsistency Measurement by Paraconsist aHammamet,Tunisia a91-1023 aMeasuring inconsistency in knowledge bases has been recognized as an important problem in many research areas. Most of approaches proposed for measuring inconsistency are based on paraconsistent semantics. However, very few of them provide an algorithm for implementation. In this paper, we first give a four-valued semantics for first-order logic and then propose an approach for measuring the degree of inconsistency based on this four-valued semantics. After that, we propose an algorithm to compute the inconsistency degree by introducing a new semantics for first order logic, which is called S[n]-4 semantics.1 aMa, Yue1 aQi, Guilin1 aLin, Zuoquan1 aHitzler, Pascal uhttp://knoesis.wright.edu/node/121500381nas a2200121 4500008004100000245005300041210005300094260002300147100001200170700001700182700002000199856004000219 2007 eng d00aAlgorithms for Paraconsistent Reasoning with OWL0 aAlgorithms for Paraconsistent Reasoning with OWL aInnsbruck, Austria1 aMa, Yue1 aLin, Zuoquan1 aHitzler, Pascal uhttp://knoesis.wright.edu/node/122100844nas a2200145 4500008004100000245008500041210006900126260002200195520037700217100001200594700001500606700001700621700002000638856004000658 2007 eng d00aMeasuring Inconsistency for Description Logics Based on Paraconsistent Semantics0 aMeasuring Inconsistency for Description Logics Based on Paracons aHammamet, Tunisia3 aIn this paper, we present an approach for measuring inconsistency in a knowledge base.We first define the degree of inconsistency using a four-valued semantics for the description logic ALC. Then an ordering over knowledge bases is given by considering their inconsistency degrees. Our measure of inconsistency can provide important information for inconsistency handling.1 aMa, Yue1 aQi, Guilin1 aLin, Zuoquan1 aHitzler, Pascal uhttp://knoesis.wright.edu/node/121600890nas a2200145 4500008004100000245008500041210006900126260006800195520037700263100001200640700001500652700002000667700001700687856004000704 2007 eng d00aMeasuring Inconsistency for Description Logics Based on Paraconsistent Semantics0 aMeasuring Inconsistency for Description Logics Based on Paracons bthe 2007 International Workshop on Description Logics (DL-2007)3 aIn this paper, we present an approach for measuring inconsistency in a knowledge base.We first define the degree of inconsistency using a four-valued semantics for the description logic ALC. Then an ordering over knowledge bases is given by considering their inconsistency degrees. Our measure of inconsistency can provide important information for inconsistency handling.1 aMa, Yue1 aQi, Guilin1 aHitzler, Pascal1 aLin, Zuoquan uhttp://knoesis.wright.edu/node/183500941nas a2200133 4500008004100000245006500041210006400106260006800170520048000238100001200718700001700730700002000747856004000767 2007 eng d00aParaconsistent Resolution for Four-valued Description Logics0 aParaconsistent Resolution for Fourvalued Description Logics bthe 2007 International Workshop on Description Logics (DL-2007)3 aIn this paper, we propose an approach to translating any *ALC* ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve this in two steps: First we give a simple way to make any *ALC* based ontology 4-valued satisfiable, and then we study a sound and complete paraconsistent ordered-resolution decision procedure for our 4-valued *ALC*. Our approach can be viewed as a paraconsistent version of KAON2 algorithm.1 aMa, Yue1 aLin, Zuoquan1 aHitzler, Pascal uhttp://knoesis.wright.edu/node/1837