Pushing the EL envelope

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 364-369

  Baader, Franz ^a   Brandt, Sebastian ^a   Lutz, Carsten ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC PROPERTIES; DESCRIPTION LOGIC;

ARTIFICIAL INTELLIGENCE;

DATA DESCRIPTION;

EID: 77957599502     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. 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. F. Baader. Using automata theory for characterizing the semantics of terminological cycles. AMAI, 18, 1996.
3. 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. F. Baader. Terminological cycles in a description logic with existential restrictions. In Proc. IJCAI'03, 2003.
5. R.J. Brachman and H.J. Levesque. The tractability of subsumption in frame-based description languages. In Proc. AAAI'84, 1984.
6. S. Brandt. Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In Proc. ECAI 2004, 2004.
7. D. Calvanese. Reasoning with inclusion axioms in description logics: Algorithms and complexity. In Proc. ECAI'96, 1996.
8. The GO Consortium. Gene Ontology: Tool for the unification of biology. Nature Genetics, 25, 2000.
9. G. De Giacomo and M. Lenzerini. Boosting the correspondence between description logics and propositional dynamic logics. In Proc. AAAI'94, 1994.
10. F. Donini, M. Lenzerini, D. Nardi, and W. Nutt. Complexity of concept languages. In Proc. KR'91, 1991.
11. V. Haarslev and R. Möller. RACER system description. In Proc. IJCAR 01, 2001.
12. M. Hofmann. Proof-theoretic approach to description logic. In Proc. of LICS-05. 2005
13. I. Horrocks and U. Sattler. Decidability of SHIQ with complex role inclusion axioms. In Proc. IJCAI-03, 2003.
14. I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for very expressive description logics. J. of the IGPL, 8, 2000.
15. 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. I. Horrocks. Using an expressive description logic: FaCT or fiction? In Proc. KR'98, 1998.
17. 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. In Proc. DL 03. http://CEUR-WS.org/Vol-81/, 2003.
18. C. Lutz. NExpTime-complete description logics with concrete domains. ACM Transactions on Computational Logic, 5(4):669-705, 2004.
19. B. Nebel. Computational complexity of terminological reasoning in BACK. Artificial Intelligence, 34, 1988.
20. B. Nebel. Terminological reasoning is inherently intractable. Artificial Intelligence, 43, 1990.
21. 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. K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. IJCAI'91, 1991.
23. 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. D. Toman and G. Weddell. On reasoning about structural equality in XML: A description logic approach. TCS, 2005. To appear.