A family of formal knowledge representation languages. Models concepts, roles and individuals, and their relationships. More expressive than propositional logic but has more efficient decision problems than first-order predicate logic.
Integrating Description Logics and Relational Databases(About) In this paper, we compare description logics with relational databases
with respect to their treatment of schema constraints, the languages
used to express these constraints, and the approaches to query
answering and constraint checking. Our analysis reveals a significant
overlap between the two formalisms. Inspired by the integrity constraints
of relational databases, we define a notion of integrity constraints
for description logics. We analyze different possibilities for
defining the semantics of the constraints. Finally, we present several
algorithms for checking constraint satisfaction for description logics
with varying degrees of expressivity.