@conference {407,
	title = {Distance-based Measures of Inconsistency and Incoherency for Description Logics},
	booktitle = {Proceedings of the 23rd International Workshop on Description Logics (DL2010)},
	volume = {573},
	year = {2010},
	pages = {475-485},
	publisher = {CEUR-WS.org},
	organization = {CEUR-WS.org},
	address = {Waterloo, Canada},
	abstract = {<p>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.</p>
},
	author = {Yue Ma and Pascal Hitzler},
	editor = {Volker Haarslev and David Toman and Grant Weddell}
}
@conference {161,
	title = {A MapReduce Algorithm for EL+},
	booktitle = {Proceedings of the 23rd International Workshop on Description Logics (DL 2010)},
	volume = {573},
	year = {2010},
	pages = {464-474},
	publisher = {CEUR-WS.org},
	organization = {CEUR-WS.org},
	address = {Waterloo, Ontario, Canada},
	abstract = {<p>Recently, 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.</p>
},
	url = {http://ceur-ws.org/Vol-573/paper_35.pdf},
	author = {Raghava Mutharaju and Frederick Maier and Pascal Hitzler},
	editor = {Volker Haarslev and David Toman and Grant E. Weddell}
}
