A Logical Semantics for Description Logic Programs

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.