A Logical Semantics for Description Logic Programs

  • Michael Fink
  • David Pearce
Conference paper

DOI: 10.1007/978-3-642-15675-5_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6341)
Cite this paper as:
Fink M., Pearce D. (2010) A Logical Semantics for Description Logic Programs. In: Janhunen T., Niemelä I. (eds) Logics in Artificial Intelligence. JELIA 2010. Lecture Notes in Computer Science, vol 6341. Springer, Berlin, Heidelberg


We present a new semantics for Description Logic programs [1] (dl-programs) that combine reasoning about ontologies in description logics with non-monotonic rules interpreted under answer set semantics. Our semantics is equivalent to that of [1], but is more logical in style, being based on the logic QHT of quantified here-and-there that provides a foundation for ordinary logic programs under answer set semantics and removes the need for program reducts. Here we extend the concept of QHT-model to encompass dl-programs. As an application we characterise some logical relations between dl-programs, by mating the idea of QHT-equivalence with the concept of query inseparability taken from description logics.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Michael Fink
    • 1
  • David Pearce
    • 2
  1. 1.Vienna University of TechnologyAustria
  2. 2.Universidad Politcnica de MadridSpain

Personalised recommendations