Conservative extensions in the lightweight description logic ε£

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4603 LNAI, Issue , 2007, Pages 84-99

  Lutz, Carsten ^a   Wolter, Frank ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; MATHEMATICAL MODELS; ONTOLOGY; PROBLEM SOLVING;

AUTOMATED REASONING PROBLEM; CONSERVATIVE EXTENSIONS; LIGHTWEIGHT DESCRIPTION LOGIC;

FORMAL LOGIC;

EID: 35148898808     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73595-3_7     Document Type: Conference Paper

References (17)

1. Antoniou, G., Kehagias, K.: A note on the refinement of ontologies. Int. J. of Intelligent Systems 15, 623-632 (2000)
2. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI'05), pp. 364-369. Professional Book Center (2005)
3. Baader, F., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI'99), pp. 96-101. Morgan Kaufmann, San Francisco (1999)
4. Bloom, B., Paige, R.: Transformational design and implementation of a new efficient solution to the ready simulation problem. Sci. Comput. Program. 24(3), 189-220 (1995)
5. Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In: Proc. of the 16th European Conf. on Artificial Intelligence (ECAI-2004), pp. 298-302. IOS Press, Amsterdam (2004)
6. Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of the 17th Symposium on Principles of Database Systems (PODS'98), pp. 149-158 (1998)
7. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In: Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI 2005), pp. 602-607 (2005)
8. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of the 10th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 260-270 (2006)
9. Clarke, E., Schlingloff, H.: Model checking. In: Handbook of Automated Reasoning (chapter 24), vol. II, pp. 1635-1790. Elsevier, Amsterdam (2001)
10. Ghilardi, S., Lutz, C., Wolter, F.: Did I damage my ontology? A case for conservative extensions in description logics. In: Proc. of the 10th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR'06), pp. 187-197. AAAI Press, Stanford (2006)
11. Grau, B.C., Horrocks, I., Kazakov, Y., Sattler, U.: A logical framework for modularity of ontologies. In: Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (IJCAI'07), AAAI Press, Stanford (2007)
12. Grau, B.C., Parsia, B., Sirin, E., Kalyanpur, A.: Modularity and web ontologies. In: Proc. of the 10th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR'06), pp. 198-209. AAAI Press, Stanford (2006)
13. Lutz, C., Walther, D., Wolter, F.: Conservative extensions in expressive description logics. In: Proc. of the 20th Int. Joint Conf. on Artificial Intelligence IJCAI-07, AAAI Press, Stanford (2007)
14. Lutz, C., Wolter, F.: Conservative extensions in the lightweight description logic EL (2007) http://www.liv.csc.ac.uk/~frank
15. Sioutos, N., de Coronado, S., Haber, M., Hartel, F., Shaiu, W., Wright, L.: NCI thesaurus: a semantic model integrating cancer-related clinical and molecular information. Journal of Biomedical Informatics 40(1), 30-43 (2006)
16. Spackman, K.: Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT, Fall Symposium Special Issue (2000)
17. Stockmeyer, L.J., Chandra, A.K.: Provably difficult combinatorial games. SIAM Journal on Computing 8(2), 151-174 (1979)