pushing the el envelope（推动el信封）.pdfVIP

Pushing the Envelope Franz Baader and Sebastian Brandt and Carsten Lutz Intitute for Theoretical Computer Science TU Dresden, Germany lastname@tcs.inf.tu-dresden.de Abstract For these reasons, and also because of the need for expres- sive DLs supporting GCIs in applications, from the mid 1990s Recently, it has been shown that the small descrip- on the DL community has mainly given up on the quest of tion logic (DL) , which allows for conjunction finding tractable DLs. Instead, it investigated more and more and existential restrictions, has better algorithmic expressive DLs, for which reasoning is worst-case intractable. properties than its counterpart , which allows The goal was then to find practical subsumption algorithms, for conjunction and value restrictions. Whereas the i.e., algorithms that are easy to implement and optimize, subsumption problem in becomes already in- and which—though worst-case exponential or even worse— tractable in the presence of acyclic TBoxes, it re- [ ] behave well in practice (see, e.g., Horrocks et al., 2000 ). mains tractable in even with general concept This line of research has resulted in the availability of highly inclusion