Abstract
In two previous papers we have investigates the problem of computing the least common subsumer (lcs) and the most specific concept (msc) for the description logic \(\mathcal{EL}\) in the presence of terminological cycles that are interpreted with descriptive semantics, which is the usual first-order semantics for description logics. In this setting, neither the lcs nor the msc needs to exist. We were able to characterize the cases in which the lcs/msc exists, but it was not clear whether this characterization yields decidability of the existence problem.
In the present paper, we develop a common graph-theoretic generalization of these characterizations, and show that the resulting property is indeed decidable, thus yielding decidability of the existence of the lcs and the msc. This is achieved by expressing the property in monadic second-order logic on infinite trees. We also show that, if it exists, then the lcs/msc can be computed in polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F.: Computing the least common subsumer in the description logic EL w.r.t. terminological cycles with descriptive semantics. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS(LNAI), vol. 2746. Springer, Heidelberg (2003)
Baader, F.: The instance problem and the most specific concept in the description logic formula_image. In: Günter, A., Kruse, R., Neumann, B. (eds.) KI 2003. LNCS (LNAI), vol. 2821, pp. 64–78. Springer, Heidelberg (2003)
Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: Proc. IJCAI 2003. Morgan Kaufmann, San Francisco (2003)
Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Proc. IJCAI 2003. Morgan Kaufmann, San Francisco (2003)
Baader, F.: A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic EL. LTCS-Report 04-02, TU Dresden, Germany (2004), See http://lat.inf.tu-dresden.de/research/reports.html
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
Baader, F., Küsters, R.: Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. In: Herzog, O. (ed.) KI 1998. LNCS, vol. 1504, Springer, Heidelberg (1998)
Küsters, R.: Chapter 3. Non-standard inferences. In: Küsters, R. (ed.) Non-Standard Inferences in Description Logics. LNCS (LNAI), vol. 2100, p. 33. Springer, Heidelberg (2001)
Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. of the Amer. Mathematical Society 141 (1969)
Spackman, K.A.: Normal forms for description logic expressions of clinical concepts in SNOMED RT. J. of the American Medical Informatics Association (2001) (Symposium Supplement)
Spackman, K.A., Campbell, K.E., Cote, R.A.: SNOMED RT: A reference terminology for health care. J. of the American Medical Informatics Association (1997) (Fall Symposium Supplement)
Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B. Elsevier Science Publishers, Amsterdam (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baader, F. (2004). A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic \(\mathcal{EL}\) . In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2004. Lecture Notes in Computer Science, vol 3353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30559-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30559-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24132-4
Online ISBN: 978-3-540-30559-0
eBook Packages: Computer ScienceComputer Science (R0)