Abstract
Description Logics (DLs) denote a family of knowledge representation formalisms that allow to represent the terminological knowledge of an application domain in a structured and well-defined way. On the one hand, the name Description Logics emphasizes that the basic elements of these logics are concept descriptions, i.e., expressions that are built from concept names (unary predicates) and role names (binary predicates) using the concept constructors provided by the DL. On the other hand, unlike some of their predecessor formalisms, DLs are equipped with a formal logic-based semantics, which is usually defined in a model-theoretic way; for some DLs it can also be declared by translating concept descriptions into first-order formulae.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2001). Introduction. In: Küsters, R. (eds) Non-Standard Inferences in Description Logics. Lecture Notes in Computer Science(), vol 2100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44613-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-44613-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42397-3
Online ISBN: 978-3-540-44613-2
eBook Packages: Springer Book Archive