01613nas a2200181 4500008004100000245008400041210006900125260003400194300001200228490000800240520097700248100001201225700002001237700002101257700001701278700001901295856011701314 2010 eng d00aDistance-based Measures of Inconsistency and Incoherency for Description Logics0 aDistancebased Measures of Inconsistency and Incoherency for Desc aWaterloo, CanadabCEUR-WS.org a475-4850 v5733 a
Inconsistency and incoherency are two sorts of erroneous information in a DL ontology which have been widely discussed in ontology-based applications. For example, they have been used to detect modeling errors during ontology construction. To provide more informative metrics which can tell the differences between inconsistent ontologies and between incoherent terminologies, there has been some work on measuring inconsistency of an ontology and on measuring incoherency of a terminology. However, most of them merely focus either on measuring inconsistency or on measuring incoherency and no clear ideas of how to extend them to allow for the other. In this paper, we propose a novel approach to measure DL ontologies, named distance-based measures. It has the merits that both inconsistency and incoherency can be measured in a unified framework. Moreover, only classical DL interpretations are used such that there is no restriction on the DL languages used.
1 aMa, Yue1 aHitzler, Pascal1 aHaarslev, Volker1 aToman, David1 aWeddell, Grant uhttps://daselab.cs.ksu.edu/publications/distance-based-measures-inconsistency-and-incoherency-description-logics01195nas a2200193 4500008004100000245003400041210003100075260004300106300001200149490000800161520066300169100002300832700002100855700002000876700002100896700001700917700002300934856004400957 2010 eng d00aA MapReduce Algorithm for EL+0 aMapReduce Algorithm for EL aWaterloo, Ontario, CanadabCEUR-WS.org a464-4740 v5733 aRecently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion RDF triples within a reasonable time span [22], and that it is also possible to carry the approach over to OWL Horst [21]. Following this lead, in this paper we provide a MapReduce algorithm for the description logic EL+, more precisely for the classification of EL+ ontologies. To do this, we first modify the algorithm usually used for EL+ classification. The modified algorithm can then be converted into a MapReduce algorithm along the same key ideas as used for RDF schema.
1 aMutharaju, Raghava1 aMaier, Frederick1 aHitzler, Pascal1 aHaarslev, Volker1 aToman, David1 aWeddell, Grant, E. uhttp://ceur-ws.org/Vol-573/paper_35.pdf00598nas a2200205 4500008004100000245004600041210004400087260002500131490000800156100002100164700001800185700002100203700002100224700002100245700002000266700001700286700002400303700002100327856004400348 2007 eng d00aData Complexity in the {EL} family of DLs0 aData Complexity in the EL family of DLs bCEUR-WS.orgc06/20070 v2501 aKrisnadhi, Adila1 aLutz, Carsten1 aCalvanese, Diego1 aFranconi, Enrico1 aHaarslev, Volker1 aLembo, Domenico1 aMotik, Boris1 aTurhan, Anni-Yasmin1 aTessaris, Sergio uhttp://ceur-ws.org/Vol-250/paper_15.pdf