Abstract
In the area of Description Logic (DL) based knowledge representation, two desirable features of DL systems have as yet been incompatible: firstly, the support of general TBoxes containing general concept inclusion (GCI) axioms, and secondly, non-standard inference services facilitating knowledge engineering tasks, such as build-up and maintenance of terminologies (TBoxes).
In order to make non-standard inferences available without sacrificing the convenience of GCIs, the present paper proposes hybrid TBoxes consisting of a pair of a general TBox \(\mathcal{F}\) interpreted by descriptive semantics, and a (possibly) cyclic TBox \(\mathcal{T}\) interpreted by fixpoint semantics. \(\mathcal{F}\) serves as a foundation of \(\mathcal{T}\) in the sense that the GCIs in \(\mathcal{F}\) define relationships between concepts used as atomic concept names in the definitions in \(\mathcal{T}\). Our main technical result is a polynomial time subsumption algorithm for hybrid \(\mathcal{EL}\)-TBoxes based on a polynomial reduction to subsumption w.r.t. cyclic \(\mathcal{EL}\)-TBoxes with fixpoint semantics. By virtue of this reduction, all non-standard inferences already available for cyclic \(\mathcal{EL}\)-TBoxes become available for hybrid ones.
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
Nardi, D., Brachmann, R.: An introduction to description logics. In: The Description Logic Handbook: Theory, Implementation, and Applications, pp. 1–40. Cambridge University Press, Cambridge (2003)
Rector, A., Nowlan, W., Glowinski, A.: Goals for concept representation in the galen project. In: Proc. of SCAMC, Washington, pp. 414–418 (1993)
Rector, A.: Medical informatics. In: The Description Logic Handbook: Theory, Implementation, and Applications, pp. 406–426. Cambridge University Press, Cambridge (2003)
Horrocks, I., Rector, A.L., Goble, C.A.: A description logic based schema for the classification of medical data. In: Proc. of KRDB 1996, CEUR-WS (1996)
Horrocks, I.R.: Using an expressive description logic: FaCT or fiction? In: Proc. of KR 1998, pp. 636–645. Morgan Kaufmann Publishers, San Francisco (1998)
Haarslev, V., Möller, R.: RACER system description. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 701–712. Springer, Heidelberg (2001)
Nebel, B.: Terminological cycles: Semantics and computational properties. In: Principles of Semantic Networks: Explorations in the Representation of Knowledge, pp. 331–361. Morgan Kaufmann Publishers, San Mateo (1991)
Cohen, W.W., Hirsh, H.: Learning the classic description logic: Theoretical and experimental results. In: Proc. of KR 1994, pp. 121–133. Morgan Kaufmann Publishers, San Francisco (1994)
Frazier, M., Pitt, L.: CLASSIC learning. Machine Learning 25, 151–193 (1996)
Baader, F., Küsters, R.: Computing the least common subsumer and the most specific concept in the presence of cyclic \(\mathcal{ALN}\)-concept descriptions. In: Herzog, O. (ed.) KI 1998. LNCS, vol. 1504, pp. 129–140. Springer, Heidelberg (1998)
McGuinness, D.: Explaining Reasoning in Description Logics. Ph.D. dissertation, Department of Computer Science, Rutgers University, New Brunswick, New Jersey (1996)
Borgida, A., McGuinness, D.L.: Asking queries about frames. In: Proc. of KR 1996, pp. 340–349. Morgan Kaufmann Publishers, San Francisco (1996)
Baader, F., Küsters, R., Borgida, A., McGuinness, D.: Matching in description logics. Journal of Logic and Computation 9, 411–447 (1999)
Baader, F., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Proc. of IJCAI 1999, pp. 96–101. Morgan Kaufmann Publishers, San Francisco (1999)
Brandt, S., Turhan, A.-Y.: Using non-standard inferences in description logics—what does it buy me? In: Proc. of KI-2001 Workshop on Applications of Description Logics (KIDLWS 2001), Number 44 in CEUR-WS (2001)
Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: Proc. of IJCAI 2003, pp. 319–324. Morgan Kaufmann, San Francisco (2003)
Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Proc. of IJCAI 2003, pp. 325–330. Morgan Kaufmann, San Francisco (2003)
Tarski, A.: A lattice-theoretic fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)
Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and—what else? In: Proc. of ECAI-2004, pp. 298–302. IOS Press, Amsterdam (2004)
Cote, R., Rothwell, D., Palotay, J., Beckett, R., Brochu, L.: The systematized nomenclature of human and veterinary medicine. Technical report, Snomed International, Northfield, IL (1993)
Spackman, K.: Normal forms for description logic expressions of clinical concepts in snomed rt. Journal of the American Medical Informatics Association (2001)
Consortium, T.G.O.: Gene Ontology: Tool for the unification of biology. Nature Genetics 25, 25–29 (2000)
Rector, A., Bechhofer, S., Goble, C.A., Horrocks, I., Nowlan, W.A., Solomon, W.D.: The grail concept modelling language for medical terminology. Artificial Intelligence in Medicine 9, 139–171 (1997)
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope. In: Proc. of IJCAI-2005, Edinburgh, UK. Morgan Kaufmann Publishers, San Francisco (2005) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandt, S., Model, J. (2005). Subsumption in \(\mathcal{EL}\) w.r.t. Hybrid TBoxes. In: Furbach, U. (eds) KI 2005: Advances in Artificial Intelligence. KI 2005. Lecture Notes in Computer Science(), vol 3698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11551263_5
Download citation
DOI: https://doi.org/10.1007/11551263_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28761-2
Online ISBN: 978-3-540-31818-7
eBook Packages: Computer ScienceComputer Science (R0)