A Rational Entailment for Expressive Description Logics via Description Logic Programs
Lehmann and Magidor's rational closure is acknowledged as a landmark in the field of non-monotonic logics and it has also been re-formulated in the context of Description Logics (DLs). We show here how to model a rational form of entailment for expressive DLs, such as SROIQ, providing a novel reasoning procedure that compiles a non-monotone DL knowledge base into a description logic program (dl-program).
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Evonne: Interactive Proof Visualization for Description Logics (System Description) -- Extended Version
Explanations for description logic (DL) entailments provide important support for the maintenance of large ontologies. The "justifications" usually employed for this purpose in ontology editors pinpoint the parts of the …
Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend!
Description Logics are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries, the standard query language in databases, have recently gained…
Data Complexity in Expressive Description Logics With Path Expressions
We investigate the data complexity of the satisfiability problem for the very expressive description logic ZOIQ (a.k.a. ALCHb Self reg OIQ) over quasi-forests and establish its NP-completeness. This completes the data co…
On Finite Entailment of Non-Local Queries in Description Logics
We study the problem of finite entailment of ontology-mediated queries. Going beyond local queries, we allow transitive closure over roles. We focus on ontologies formulated in the description logics ALCOI and ALCOQ, ext…
Theoretical Foundations of Defeasible Description Logics
We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in …