Abstract
As pointed out in Section 3.3, appropriate characterizations of subsumption form the basis for algorithms solving non-standard inferences. The core of every of these characterizations lies in normal forms which provide finite representations of all implications that can be drawn from concept descriptions. Such normal forms can be stated in terms of certain concept descriptions, graphs, or systems of regular languages. Subsumption can then be described using these objects by recursive algorithms, homomorphisms, or language inclusions. Which type of characterization is employed to solve a non-standard inference problem depends on the DL of choice and the inference problem itself. Not all normal forms and characterizations are equally suitable in every situation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Characterizing Subsumption. 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_4
Download citation
DOI: https://doi.org/10.1007/3-540-44613-3_4
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