We extend the description logic SHOQ(D) with a preference order on the axioms. With this strict partial order certain axioms can be overruled, if defeated with more preferred ones. Furthermore, we impose a preferred model semantics, thus effectively introducing nonmonotonicity into SHOQ(D). Since a description logic can be viewed as an ontology language, or a proper translation of one, we obtain a defeasible ontology language. Finally, we argue that such a defeasible language may be usefully applied for learning and integrating ontologies. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Heymans, S., & Vermeir, D. (2002). A defeasible ontology language. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2519 LNCS, pp. 1033–1046). Springer Verlag. https://doi.org/10.1007/3-540-36124-3_66
Mendeley helps you to discover research relevant for your work.