Abstract
We consider extensions of the lightweight description logic (DL) \({\mathcal{EL}}\) with numerical datatypes such as naturals, integers, rationals and reals equipped with relations such as equality and inequalities. It is well-known that the main reasoning problems for such DLs are decidable in polynomial time provided that the datatypes enjoy the so-called convexity property. Unfortunately many combinations of the numerical relations violate convexity, which makes the usage of these datatypes rather limited in practice. In this paper, we make a more fine-grained complexity analysis of these DLs by considering restrictions not only on the kinds of relations that can be used in ontologies but also on their occurrences, such as allowing certain relations to appear only on the left-hand side of the axioms. To this end, we introduce a notion of safety for a numerical datatype with restrictions (NDR) which guarantees tractability, extend the \({\mathcal{EL}}\) reasoning algorithm to these cases, and provide a complete classification of safe NDRs for natural numbers, integers, rationals and reals.
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.
References
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation, and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)
Grau, B.C., Horrocks, I., Motik, B., Parsia, B., Patel-Schneider, P.F., Sattler, U.: OWL 2: The next step for OWL. J. Web Sem. 6(4), 309–322 (2008)
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) Envelope. In: IJCAI, pp. 364–369. Professional Book Center (2005)
Cote, R., Rothwell, D., Palotay, J., Beckett, R., Brochu, L.: The systematized nomenclature of human and veterinary medicine. Technical report, Northfield, IL: College of American Pathologists (1993)
The Gene Ontology Consortium: Gene Ontology: Tool for the unification of biology. Nature Genetics 25, 25–29 (2000)
Magka, D.: Consequence-Based Datatype Reasoning in \(\mathcal{EL}\): Identifying the Tractable Fragments. Master’s thesis, Oxford University Computing Laboratory (2009)
Lutz, C.: Description Logics with Concrete Domains-A Survey. In: Advances in Modal Logic, pp. 265–296. King’s College Publications (2002)
Magka, D., Kazakov, Y., Horrocks, I.: Tractable Extensions of the Description Logic \(\mathcal{EL}\) with Numerical Datatypes. Technical report, Oxford University Computing Laboratory (2010), posted on, http://web.comlab.ox.ac.uk/isg/people/despoina.magka/publications/reports/NDRTechnicalReport_OnlinePDF.pdf
Haase, C., Lutz, C.: Complexity of Subsumption in the \(\mathcal{EL}\) Family of Description Logics: Acyclic and Cyclic tboxes. In: ECAI, vol. 178, pp. 25–29. IOS Press, Amsterdam (2008)
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope further. In: Proceedings of the OWLED 2008 DC Workshop on OWL: Experiences and Directions (2008)
Kazakov, Y.: Consequence-driven Reasoning for Horn \(\mathcal{SHIQ}\) Ontologies. In: IJCAI, pp. 2040–2045 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Magka, D., Kazakov, Y., Horrocks, I. (2010). Tractable Extensions of the Description Logic \(\cal EL\) with Numerical Datatypes. In: Giesl, J., Hähnle, R. (eds) Automated Reasoning. IJCAR 2010. Lecture Notes in Computer Science(), vol 6173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14203-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-14203-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14202-4
Online ISBN: 978-3-642-14203-1
eBook Packages: Computer ScienceComputer Science (R0)