Finding the Largest Datalog Fragment of Description Logic

Markus KrötzschMarkus Krötzsch, Sebastian RudolphSebastian Rudolph

Markus Krötzsch, Sebastian Rudolph
Finding the Largest Datalog Fragment of Description Logic
Technical Report 3002, Institute AIFB, KIT, November 2009

Details
Bibtex

KurzfassungAbstract
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 deﬁning 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 deﬁnition 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 deﬁnitions for other fragments of logical languages, such as the “maximal” fragment of SWRL rules that can be expressed in the DL SROIQ.
Forschungsgruppe:Research Group: Computational LogicComputational Logic, Wissensbasierte SystemeKnowledge-Based Systems

@techreport{KR2009,
  author      = {Markus Kr{\"{o}}tzsch and Sebastian Rudolph},
  title       = {Finding the Largest Datalog Fragment of Description Logic},
  number      = {3002},
  institution = {Institute {AIFB,} {KIT}},
  year        = {2009},
  month       = {November}
}