ScholarLens Back to search
2005•Qucosa (Saxon State and University Library Dresden)Open access

Pushing the EL envelope

Franz Baader, Sebastian Brandt, Carsten Lutz

Open full text 864 citations

Abstract

Recently, it has been shown that the small 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 aclyc TBoxes, it remains tractable in EL even w.r.t. general concept inclusion axioms (GCIs). On the one hand, we will 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 will 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 will show that subsumption in FL₀ with GCIs is EXPTIME-complete.

About this research paper

What this paper is about

Recently, it has been shown that the small 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 aclyc TBoxes, it remains tractable in EL even w.r.t. general concept inclusion axioms (GCIs). On the one hand, we will 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 will 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 will show that subsumption in FL₀ with GCIs is EXPTIME-complete.

Why it matters

OpenAlex reports 864 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Recently, it has been shown that the small 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 aclyc TBoxes, it remains tractable in EL even w.r.t. general concept inclusion axioms (GCIs). On the one hand, we will 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 will 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 will show that subsumption in FL₀ with GCIs is EXPTIME-complete.

Key concepts: EXPTIME, Axiom, Computer science, Set (abstract data type), Description logic, Conjunction (astronomy), Logical consequence, Theoretical computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Pushing the EL envelope — Research Paper | ScholarLens