Towards 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 conjecture to be maximal in a concrete sense. A preliminary report on the proof of this maximality is provided. 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 DL 2009 (Workshop paper)
Download PDF (last update: Jun 23 2009)
- Markus Krötzsch, Sebastian Rudolph. A Matter of Principles: Towards the Largest DLP Possible. In Proceedings of the 22nd International Workshop on Description Logics (DL2009). CEUR Workshop ProceedingsProperty "Publisher" has a restricted application area and cannot be used as annotation property by a user. 2009.
This work is a preliminary report on the work discussed in the technical report The Largest DLP Possible.