2007 · 22 citations · 11 references
ComputingComputer ScienceAlgorithmsTheory Of ComputationAlgorithmic ComplexityComplexity TheoryComputational ComplexityDescriptive ComplexitySpace ComplexityStructural ComplexityComplexityExponential Time ComplexityLogarithmic Space ComplexityStructural Properties Of Complexity Classes
In recent years, lightweight description logics (DLs) have experienced increased in-terest because they admit highly efcient reasoning on large-scale ontologies. Most prominently, this is witnessed by the ongoing research on the DL-Lite and EL families of DLs, but see also [11, 14] for other examples. The main application of EL and its
11
Franz Baader, Sebastian Brandt, Carsten Lutz · 2005 · 869 citations · Full text
DL-Lite: tractable description logics for ontologies
Diego Calvanese, Giuseppe De Giacomo, Domenico Lemho et al. · National Conference on Artificial Intelligence · 2005 · 347 citations
Data complexity of query answering in description logics
Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo et al. · Artificial Intelligence · 2012 · 203 citations