Defeasible Inheritance-Based Description Logics
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.
Cite
Text
Casini and Straccia. "Defeasible Inheritance-Based Description Logics." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-142Markdown
[Casini and Straccia. "Defeasible Inheritance-Based Description Logics." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/casini2011ijcai-defeasible/) doi:10.5591/978-1-57735-516-8/IJCAI11-142BibTeX
@inproceedings{casini2011ijcai-defeasible,
title = {{Defeasible Inheritance-Based Description Logics}},
author = {Casini, Giovanni and Straccia, Umberto},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2011},
pages = {813-818},
doi = {10.5591/978-1-57735-516-8/IJCAI11-142},
url = {https://mlanthology.org/ijcai/2011/casini2011ijcai-defeasible/}
}