Home |  ENGLISH |  Kontakt |  Impressum |  Anmelden |  KIT


Aus Aifbportal

Wechseln zu: Navigation, Suche

Finding the Largest Datalog Fragment of Description Logic

Published: 2009 November
Nummer: 3002
Institution: Institute AIFB, KIT
BibTex-ID: KR:DLPtr09

Description Logic Programs (DLP) have been described as a description logic (DL) that is in the “expressive intersection” of DL and datalog. This is a very weak guideline for defining DLP in a way that can be claimed to be optimal or maximal in any sense. Moreover, other DL fragments such as EL and Horn-SHIQ have also been “expressed” using datalog. So is DLP just one out of many equal DLs in this “expressive intersection”? This paper attempts to clarify these issues by characterising DLP with various design principles that clearly distinguish it from other approaches. A consequent application of the introduced principles leads to the definition of a significantly larger variant of DLP which we show to be maximal in a concrete sense. While DLP is used as a concrete (and remarkably complex) example in this paper, we argue that similar approaches can be applied to find canonical definitions for other fragments of logical languages, such as the “maximal” fragment of SWRL rules that can be expressed in the DL SROIQ.

Download: Media:KR-DLPTR2009.pdf





Beschreibungslogik, Logikprogrammierung