Description logic Created 2026-10-31 Updated 2026-11-05
A description logic describes classes of individuals, called concepts, and binary relationships, called roles. Its constructors are restricted so that logical reasoning tasks can be studied precisely. A TBox specifies general concept constraints, while an ABox records assertions about particular individuals.
For example, describes people related by to some person. A reasoning task may ask whether a concept can be nonempty or whether one concept is included in another. Different choices of constructors change expressiveness and computational complexity theory. These logics provide a mathematical basis for ontology languages and knowledge representation.
The standard semantics of ALC and EL do not impose the unique name assumption. Therefore the two individual names may denote the same element. A minimum-size model of either normalized TBox from part (d), together with the ABox, isThe self-loop supplies the ABox fact and makes both and true at . The self-loop supplies exactly the existential restriction defining . Disjointness holds because is empty. Hence every normalized general concept inclusion is satisfied. A domain must be nonempty, so is minimal.
If a separate unique name assumption were imposed, the minimum would instead be two. One can take , , , , and . There is then no -edge ending at an element, so the normalized requirements involving hold vacuously. That additional convention is not part of standard description logic semantics.