02037nas a2200229   4500008004100000245004200041210004200083300001400125490000600139520143400145653002401579653001501603653002201618653000801640653002001648653001701668653002601685100002101711700001201732700002001744856004301764       2013                        eng d00aParaconsistent OWL and Related Logics0 aParaconsistent OWL and Related Logics  a395–4270 v43 aThe Web Ontology Language OWL is currently the most prominent formalism for representing ontologies in Semantic Web applications. OWL is based on description logics, and automated reasoners are used to infer knowledge implicitly present in OWL ontologies. However, because typical description logics obey the classical principle of explosion, reasoning over inconsistent ontologies is impossible in OWL. This is so despite the fact that inconsistencies are bound to occur in many realistic cases, e.g., when multiple ontologies are merged or when ontologies are created by machine learning or data mining tools. In this paper, we present four-valued paraconsistent description logics which can reason over inconsistencies. We focus on logics corresponding to OWL DL and its profiles. We present the logic SROIQ4, showing that it is both sound relative to classical SROIQ and that its embedding into SROIQ is consequence preserving. We also examine paraconsistent varieties of EL++, DL-Lite, and Horn-DLs. The general framework described here has the distinct advantage of allowing classical reasoners to draw sound but nontrivial conclusions from even inconsistent knowledge bases. Truth-value gaps and gluts can also be selectively eliminated from models (by inserting additional axioms into knowledge bases). If gaps but not gluts are eliminated, additional classical conclusions can be drawn without affecting paraconsistency.10aAutomated Deduction10aComplexity10aDescription Logic10aOWL10aParaconsistency10aSemantic Web10aWeb Ontology Language1 aMaier, Frederick1 aMa, Yue1 aHitzler, Pascal  uhttp://dx.doi.org/10.3233/SW-2012-0066