Expressive Description Logics 185
no longer tractability of reasoning, but rather decidability. Such logics, called here
expressive description logics
, have the following characteristics:
(i) The language used for building concepts and roles comprises all classical con-
cept forming constructs, plus several role forming constructs such as inverse
roles, and reflexive-transitive closure.
(ii) No restriction is posed on the axioms in the TBox.
The goal of this chapter is to provide an overview on the results and techniques
for reasoning in expressive description logics. The chapter is organized as follows.
In Section 5.2, we outline the correspondence between expressive description logics
and Propositional Dynamic Logics, which has given the basic tools to study reason-
ing in expressive description logics. In Section 5.3, we exploit automata-theoretic
techniques developed for variants of Propositional Dynamic Logics to address rea-
soning in expressive description logics with functionality restrictions on roles. In
Section 5.4 we illustrate the basic technique of reification
for reasoning with expres-
sive variants of number restrictions. In Section 5.5, we show how to reason with
knowledge bases composed of a TBox and an ABox, and discuss extensions to deal
with
names (one-of construct). In Section 5.6, we introduce description logics with
explicit fixpoint constructs, that are used to express in a natural way inductively
and coinductively defined concepts. In Section 5.7, we study description logics that
include relations of arbitrary arity, which overcome the limitations of traditional
description logics of modeling only binary links between objects. This extension
is particularly relevant for the application of description logics to databases. In
Section 5.8, the problem of finite model reasoning in description logics is addressed.
Indeed, for expressive description logics, reasoning w.r.t. finite models differs from
reasoning w.r.t. unrestricted models, and requires specific methods. Finally, in Sec-
tion 5.9, we discuss several extensions to description logics that lead in general to
undecidability of the basic reasoning tasks. This shows that the expressive descrip-
tion logics considered in this chapter are close to the boundary to undecidability,
and are carefully designed in order to retain decidability.
5.2 Correspondence between Description Logics and Propositional
Dynamic Logics
In this section, we focus on expressive description logics that, besides the standard
ALC constructs, include regular expression over roles and possibly inverse roles
[
Baader, 1991; Schild, 1991
]
. It turns out that such description logics correspond
directly to Propositional Dynamic Logics, which are modal logics used to express
properties of programs. We first introduce syntax and semantics of the description
评论0