The Largest DLP Possible
Abstract. 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 ﬁnd canonical definitions for other fragments of logical languages, such as the “maximal” fragment of SWRL rules that can be expressed in the DL SROIQ.
Published at Universität Karlsruhe (TH) (Technical report)
Download PDF (last update: Sep 11 2009)
The results from this work have been published in the paper On the Semantic Relationship between Datalog and Description Logics in 2010. A short version of this paper has been published as a preliminary report at DL Workshop 2009.
Another reference that includes the unabridged account of these results in their latest version is my dissertation.