Deciding inseparability and conservative extensions in the description logic E L

Journal of Symbolic Computation

Volumn 45, Issue 2, 2010, Pages 194-228

  Lutz, Carsten ^a   Wolter, Frank ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Conservative extension; Description logic; Modularity; Ontologies

Indexed keywords

EID: 70350708070     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2008.10.007     Document Type: Article

References (25)

1. Antoniou G., and Kehagias K. A note on the refinement of ontologies. International Journal of Intelligent Systems 15 (2000) 623-632
2. Baader F., Calvanese D., McGuinness D.L., Nardi D., and Patel-Schneider P. The Description Logic Handbook (2007), Cambridge
3. Baader, F., Brandt, S., Lutz, C., 2005a. Pushing the E L envelope. LTCS-Report LTCS-05-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html
4. Baader F., Brandt S., and Lutz C. Pushing the E L envelope. Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI'05) (2005), Professional Book Center 364-369
5. Baader F., Küsters R., and Molitor R. Computing least common subsumers in description logics with existential restrictions. Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI'99) (1999), Morgan Kaufmann 96-101
6. Brandt S. Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and-what else?. Proc. of the 16th European Conf. on Artificial Intelligence (ECAI-2004) (2004), IOS Press 298-302
7. Byers P., and Pitt D. Conservative extensions: A cautionary note. EATCS-Bulletin (1997) 196-201
8. Clarke E., and Schlingloff H. Model checking. Handbook of Automated Reasoning vol. II (2001), Elsevier Science 1635-1790 (Chapter 24)
9. Cuenca Grau B., Horrocks I., Kazakov Y., and Sattler U. Modular reuse of ontologies: Theory and practice. Journal of Artificial Intelligence Research 31 (2008) 273-318
10. Cuenca Grau B., Horrocks I., Kazakov Y., and Sattler U. A logical framework for modularity of ontologies. Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (IJCAI'07) (2007), AAAI Press
11. Cuenca Grau B., Parsia B., Sirin E., and Kalyanpur A. Modularity and web ontologies. Proc. of the 10th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR'06) (2006), AAAI Press 198-209
12. Diaconescu R., Goguen J., and Stefaneas P. Logical support for modularisation. Papers presented at the Second Annual Workshop on Logical Environments (1993), Cambridge University Press 83-130
13. Ghilardi S., Lutz C., and Wolter F. Did I damage my ontology? A case for conservative extensions in description logics. Proc. of the 10th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR'06) (2006), AAAI Press 187-197
14. Konev B., Walther D., and Wolter F. The logical difference problem for description logic terminologies. Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR'08). Springer Lecture Notes (2008)
15. Konev B., Lutz C., Walther D., and Wolter F. Semantic modularity and module extraction in description logic. Proceedings of 18th European Conference on Artificial Intelligence (ECAI'08) (2008), IOS Press
16. Kontchakov R., Wolter F., and Zakharyaschev M. Can you tell the difference between DL-Lite ontologies. Proceedings of the 11th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'08) (2008), AAAI Press
17. Lutz C., Walther D., and Wolter F. Conservative extensions in expressive description logics. Proc. of the 20th Int. Joint Conf. on Artificial Intelligence IJCAI-07 (2007), AAAI Press
18. Maibaum T. Conservative extensions, interpretations between theories and all that!. Proceedings of 7th CAAP/FASE Conference on Theory and Practice of Software Development (1997) 40-66
19. Sioutos N., deCoronado S., Haber M., Hartel F., Shaiu W., and Wright L. NCI thesaurus: A semantic model integrating cancer-related clinical and molecular information. Journal of Biomedical Informatics 40 1 (2006) 30-43
20. Sofronie-Stokkermans V. Interpolation in local theory extensions. Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06). Springer Lecture Notes vol. 4130 (2006), Springer 235-250
21. Spackman, K., Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT. 2000. Fall Symposium Special Issue.
22. Stockmeyer L.J., and Chandra A.K. Provably difficult combinatorial games. SIAM Journal on Computing 8 2 (1979) 151-174
23. Turski W.M., and Maibaum T. The Specification of Computer Programs (1987), Addison Wesley
24. Veloso P.A.S. Yet another cautionary note on conservative extensions: A simple case with a computing flavour. EATCS-Bulletin (1992) 188-193
25. Veloso P.A.S., and Veloso S.R.M. Some remarks on conservative extensions. A socratic dialog. EATCS-Bulletin (1991) 189-198