A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Defeasible Ontology Language
[chapter]
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
doi:10.1007/3-540-36124-3_66
fatcat:f5mgy2546vbt3c4pjwr7wbk7wi