Defeasible Inheritance-Based Description Logics
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 813-817.
Abstract
Defeasible inheritance networks are a non-monotonic framework that deals with hierarchical knowledge. On the other hand, rational closure is acknowledged as a landmark of the preferential approach. We will combine these two approaches and define a new non-monotonic closure operation for propositional knowledge bases that combines the advantages of both. Then we redefine such a procedure for Description Logics, a family of logics well-suited to model structured information. In both cases we will provide a simple reasoning method that is build on top of the classical entailment relation.
@inproceedings{ijcai2011p142,
title = {Defeasible Inheritance-Based Description Logics},
author = {Casini, Giovanni and Straccia, Umberto},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {813--817},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-142},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-142},
}
TY - CPAPER TI - Defeasible Inheritance-Based Description Logics AU - Casini, Giovanni AU - Straccia, Umberto T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 813 EP - 817 DO - 10.5591/978-1-57735-516-8/IJCAI11-142 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-142 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: