Article

Pushing the EL envelope

Authors:

Sebastian Brandt,

Carsten LutzAuthors Info & Claims

IJCAI'05: Proceedings of the 19th international joint conference on Artificial intelligence

Pages 364 - 369

Published: 30 July 2005 Publication History

Abstract

Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL₀, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL₀ becomes already intractable in the presence of acyclic TBoxes, it remains tractable in EL even with general concept inclusion axioms (GCIs). On the one hand, we extend the positive result for EL by identifying a set of expressive means that can be added to EL without sacrificing tractability. On the other hand, we show that basically all other additions of typical DL constructors to EL with GCIs make subsumption intractable, and in most cases even EXPTIME-complete. In addition, we show that subsumption in FL₀ with GCIs is EXPTIME-complete.

References

[1]

{Baader et al., 2005} F. Baader, S. Brandt, and C. Lutz. Pushing the EL envelope. LTCS-Report LTCS-05-01, Inst. for Theoretical Computer Science, TU Dresden, 2005. See http://lat.inf.tudresden. de/research/reports.html.

[2]

{Baader, 1996} F. Baader. Using automata theory for characterizing the semantics of terminological cycles. AMAI, 18, 1996.

[3]

{Baader, 2003a} F. Baader. Restricted role-value-maps in a description logic with existential restrictions and terminological cycles. In Proc. DL'03, http://CEUR-WS.org/Vol-81/, 2003.

[4]

{Baader, 2003b} F. Baader. Terminological cycles in a description logic with existential restrictions. In Proc. IJCAI'03, 2003.

[5]

{Brachman and Levesque, 1984} R.J. Brachman and H.J. Levesque. The tractability of subsumption in frame-based description languages. In Proc. AAAI'84, 1984.

[6]

{Brandt, 2004} S. Brandt. Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and--what else? In Proc. ECAI 2004, 2004.

[7]

{Calvanese, 1996} D. Calvanese. Reasoning with inclusion axioms in description logics: Algorithms and complexity. In Proc. ECAI'96, 1996.

[8]

{Consortium, 2000} The GO Consortium. Gene Ontology: Tool for the unification of biology. Nature Genetics, 25, 2000.

[9]

{De Giacomo and Lenzerini, 1994} G. De Giacomo and M. Lenzerini. Boosting the correspondence between description logics and propositional dynamic logics. In Proc. AAAI'94, 1994.

Digital Library

[10]

{Donini et al., 1991} F. Donini, M. Lenzerini, D. Nardi, and W. Nutt. Complexity of concept languages. In Proc. KR'91, 1991.

[11]

{Haarslev and Möller, 2001} V. Haarslev and R. Möller. RACER system description. In Proc. IJCAR 01, 2001.

Digital Library

[12]

{Hofmann, 2005} M. Hofmann. Proof-theoretic approach to description logic. In Proc. of LICS-05. 2005.

Digital Library

[13]

{Horrocks and Sattler, 2003} I. Horrocks and U. Sattler. Decidability of SHIQ with complex role inclusion axioms. In Proc. IJCAI- 03, 2003.

Digital Library

[14]

{Horrocks et al., 2000} I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for very expressive description logics. J. of the IGPL, 8, 2000.

[15]

{Horrocks et al., 2003} I. Horrocks, P.F. Patel-Schneider, and F. van Harmelen. From SHIQ and RDF to OWL: The making of a web ontology language. J. of Web Semantics, 1, 2003.

[16]

{Horrocks, 1998} I. Horrocks. Using an expressive description logic: FaCT or fiction? In Proc. KR'98, 1998.

[17]

{Kazakov and de Nivelle, 2003} Y. Kazakov and H. de Nivelle. Subsumption of concepts in FL ₀ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. In Proc. DL 03. http://CEUR-WS.org/Vol-81/, 2003.

[18]

{Lutz, 2003} C. Lutz. NExpTime-complete description logics with concrete domains. ACM Transactions on Computational Logic, 5(4):669-705, 2004.

Digital Library

[19]

{Nebel, 1988} B. Nebel. Computational complexity of terminological reasoning in BACK. Artificial Intelligence, 34, 1988.

Digital Library

[20]

{Nebel, 1990} B. Nebel. Terminological reasoning is inherently intractable. Artificial Intelligence, 43, 1990.

Digital Library

[21]

{Rector and Horrocks, 1997} A. Rector and I. Horrocks. Experience building a large, re-usable medical ontology using a description logic with transitivity and concept inclusions. In Proc. Workshop on Ontological Engineering, 1997.

[22]

{Schild, 1991} K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. IJCAI'91, 1991.

[23]

{Spackman, 2000} K.A. Spackman. Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT. J. of the American Medical Informatics Association, 2000. Fall Symposium Special Issue.

[24]

{Toman and Weddell, 2005} D. Toman and G. Weddell. On reasoning about structural equality in XML: A description logic approach. TCS, 2005. To appear.

Digital Library

Cited By

Lanzinger MNissl MSallinger EWałęga PElkind E(2023)Temporal datalog with existential quantificationProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/365(3277-3285)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/365
Mohamed RLoukil ZGargouri FBouraoui Z(2023)Revision of prioritized ontologiesApplied Intelligence10.1007/s10489-023-05074-653:24(30359-30383)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1007/s10489-023-05074-6
Liu ZLu CAlghamdi GSchmidt RZhao YDemartini GZuccon GCulpepper JHuang ZTong H(2021)Tracking Semantic Evolutionary Changes in Large-Scale Ontological Knowledge BasesProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482307(1130-1139)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3459637.3482307
Show More Cited By

Index Terms

Pushing the EL envelope
1. Theory of computation
  1. Logic

Index terms have been assigned to the content through auto-classification.

Recommendations

Pushing the envelope: challenges in a frame-based representation of human anatomy

One of the main threads in the history of knowledge-representation formalisms is the trade-off between the expressiveness of first-order logic on the one hand and the tractability and ease-of-use of frame-based systems on the other hand. Frame-based ...
Pushing the Boundaries of Tractable Ontology Reasoning
The Semantic Web – ISWC 2014
Abstract
We identify a class of Horn ontologies for which standard reasoning tasks such as instance checking and classification are tractable. The class is general enough to include the OWL 2 EL, QL, and RL profiles. Verifying whether a Horn ontology ...
Pushing Doors for Modeling Contexts with OWL DL a Case Study
PERCOMW '06: Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops

In this paper we present an integrated view for modeling and reasoning for context applications using OWL DL. In our case study, we describe a task driven approach to model typical situations as context concepts in an OWL DL ontology. At run-time OWL ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

IJCAI'05: Proceedings of the 19th international joint conference on Artificial intelligence

July 2005

1775 pages

Sponsors

The International Joint Conferences on Artificial Intelligence, Inc.

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 30 July 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

222
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lanzinger MNissl MSallinger EWałęga PElkind E(2023)Temporal datalog with existential quantificationProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/365(3277-3285)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/365
Mohamed RLoukil ZGargouri FBouraoui Z(2023)Revision of prioritized ontologiesApplied Intelligence10.1007/s10489-023-05074-653:24(30359-30383)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1007/s10489-023-05074-6
Liu ZLu CAlghamdi GSchmidt RZhao YDemartini GZuccon GCulpepper JHuang ZTong H(2021)Tracking Semantic Evolutionary Changes in Large-Scale Ontological Knowledge BasesProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482307(1130-1139)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3459637.3482307
Eberhart AShimizu CChowdhury SSarker MHitzler P(2021)Expressibility of OWL Axioms with PatternsThe Semantic Web10.1007/978-3-030-77385-4_14(230-245)Online publication date: 6-Jun-2021
https://dl.acm.org/doi/10.1007/978-3-030-77385-4_14
Jung JPapacchini FWolter FZakharyaschev MBouyer P(2019)Model comparison games for horn description logicsProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3470152.3470156(1-14)Online publication date: 24-Jun-2019
https://dl.acm.org/doi/10.5555/3470152.3470156
Lembo DRosati RSavo D(2019)Revisiting controlled query evaluation in description logicsProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367243.3367286(1786-1792)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367243.3367286
Lécué FChen JPan JChen H(2019)Augmenting transfer learning with semantic reasoningProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367243.3367285(1779-1785)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367243.3367285
Bötcher ALutz CWolter F(2019)Ontology approximation in horn description logicsProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367243.3367257(1574-1580)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367243.3367257
Bienvenu MBourhis P(2019)Mixed-world reasoning with existential rules under active-domain semanticsProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367243.3367255(1558-1565)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367243.3367255
Bate AMotik BGrau BCucala DSimančík FHorrocks I(2019)Consequence-based reasoning for description logics with disjunctions and number restrictionsJournal of Artificial Intelligence Research10.1613/jair.1.1125763:1(625-690)Online publication date: 17-Apr-2019
https://dl.acm.org/doi/10.1613/jair.1.11257
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents