2019/05/22 by Loris Bozzato, Thomas Eiter, Bozzato, Loris +3 · 1 citation
Computer Science · #Artificial Intelligence (cs.AI) #F.4.1 #FOS: Computer and information sciences #I.2.4 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Semantic Web and Ontologies #cs.AI #cs.LO
paper · pdf · doi:10.48550/arxiv.1905.09221
Part of this work will appear as a paper in Proceedings of 32nd International Workshop on Description Logics (DL2019)
arxiv created 2019/05/22 · openalex publication_date 2019/05/22 · arxiv updated 2019/05/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Representation of defeasible information is of interest in description logics, as it is related to the need of accommodating exceptional instances in knowledge bases. In this direction, in our previous works we presented a datalog translation for reasoning on (contextualized) OWL RL knowledge bases with a notion of justified exceptions on defeasible axioms. While it covers a relevant fragment of OWL, the resulting reasoning process needs a complex encoding in order to capture reasoning on negative information. In this paper, we consider the case of knowledge bases in DL-Lite\cal R, i.e. the language underlying OWL QL. We provide a definition for DL-Lite\cal R knowledge bases with defeasible axioms and study their properties. The limited form of DL-Lite\cal R axioms allows us to formulate a simpler encoding into datalog (under answer set semantics) with direct rules for reasoning on negative information. The resulting materialization method gives rise to a complete reasoning procedure for instance checking in DL-Lite\cal R with defeasible axioms.