A Defeasible Ontology Language [chapter]

S. Heymans, D. Vermeir
2002 Lecture Notes in Computer Science  
We extend the description logic ¢ ¤ £ ¦ ¥ ¦ § © 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 ¢ £ ¦ ¥ § . 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
more » ... sefully applied for learning and integrating ontologies.
doi:10.1007/3-540-36124-3_66 fatcat:f5mgy2546vbt3c4pjwr7wbk7wi