Can you tell the difference between DL-Lite ontologies?

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2008, Pages 285-295

  Kontchakov, Roman ^a   Wolter, Frank ^b   Zakharyaschev, Michael ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; KNOWLEDGE REPRESENTATION;

CONTEXT ONTOLOGY; FORMAL FRAMEWORK; META-PROPERTIES; ONTOLOGY DEVELOPMENT; QBF SOLVERS; REASONING TASKS; SATISFIABILITY; UNIFORM INTERPOLATIONS;

ONTOLOGY;

EID: 84860544288     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Acciarri, A.; Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; Palmieri, M.; and Rosati, R. 2005. QuOnto: Querying ontologies. In Proc. of AAAI, 1670-1671.
2. Antoniou, G., and Kehagias, A. 2000. A note on the refinement of ontologies. Int. J. of Intelligent Systems 15:623- 632.
3. Areces, C., and ten Cate, B. 2006. Hybrid logics. In Blackburn, P.; van Benthem, J.; and Wolter, F., eds., Handbook of Modal Logic. Elsevier.
4. Artale, A.; Calvanese, D.; Kontchakov, R.; and Zakharyaschev, M. 2007. DL-Lite in the light of first-order logic. In Proc. of AAAI, 361-366.
5. Benedetti, M. 2005. sKizzo: A suite to evaluate and certify QBFs. In Nieuwenhuis, R., ed., Proc. of CADE-20, 369- 376.
6. Borgida, A.; Brachman, R.; McGuinness, D.; and Resnick, L. A. 1989. Classic: A structural data model for objects. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 58-67.
7. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2005. DL-Lite: Tractable description logics for ontologies. In Proc. of AAAI, 602-607.
8. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2006. Data complexity of query answering in description logics. In Proc. of KR, 260-270.
9. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; Poggi, A.; and Rosati, R. 2007. Mastro-I: Efficient integration of relational data through DL ontologies. In DL, 1670-1671.
10. Chang, C., and Keisler, H. 1990. Model Theory. Elsevier.
11. Diaconescu, R.; Goguen, J.; and Stefaneas, P. 1993. Logical support for modularisation. In Huet, G., and Plotkin, G., eds., Logical Environments, 83-130. Cambridge University Press, New York.
12. Ghilardi, S.; Lutz, C.; and Wolter, F. 2006. Did I damage my ontology? A case for conservative extensions in description logic. In Proc. of KR, 187-197.
13. Grau, B. C.; Horrocks, I.; Kazakov, Y.; and Sattler, U. 2007a. Just the right amount: Extracting modules from ontologies. In Proc. of WWW, 717-726.
14. Grau, B. C.; Horrocks, I.; Kazakov, Y.; and Sattler, U. 2007b. A logical framework for modularity of ontologies. In Proc. of IJCAI, 298-303.
15. Konev, B.; Lutz, C.; Walther, D.; and Wolter, F. 2007. Formal properties of modularisation. In H. Stuckenschmidt and S. Spaccapietra, eds., Ontology Modularization, Springer,.
16. Lang, J.; Liberatore, P.; and Marquis, P. 2003. Propositional independence: formula-variable independence and forgetting. JAIR, 18:391-443.
17. Lin, F., and Reiter, R. 1994. Forget it! In Proceedings of AAAI Fall Symposium on Relevance, 154-159.
18. Lutz, C., and Wolter, F. 2007. Conservative extensions in the lightweight description logic EL. In Proc. of CADE, 84-99.
19. Lutz, C.; Walther, D.; and Wolter, F. 2007. Conservative extensions in expressive description logics. In Proc. of IJCAI, 453-458.
20. Noy, N., and Musen, M. 2002. PromptDiff: a fixed-point algorithm for comparing ontology versions. In Proc. of AAAI, 744-750.
21. Pitts, A. 1992. On an interpretation of second-order quantification in first-order intuitionistic propositional logic. J. of Symbolic Logic, 57:33-52.
22. Samulowitz, H., and Bacchus, F. 2006. Binary clause reasoning in QBF. In Proc. of SAT, volume 4121 of LNCS, 353-367.
23. Schlobach, S., and Cornet, R. 2003. Non-standard reasoning services for debugging of description logic terminologies. In Proc. of IJCAI, 355-362.
24. Visser, A. 1996. Uniform interpolation and layered bisimulation. In Gödel'96 (Brno, 1996), volume 6 of Lecture Notes in Logic. Springer, 139-164.
25. Wang, Z.; Wang, K.; Topor, R.; Pan, J. 2008. Forgetting Concepts in DL-Lite. In Proc. of ESWC, 245-257.
26. Zhang, L., and Malik, S. 2002a. Conflict driven learning in a quantified Boolean satisfiability solver. In Proc. of ICCAD, 442-449.
27. Zhang, L., and Malik, S. 2002b. Towards a symmetric treatment of satisfaction and conflicts in quantified Boolean formula evaluation. In Proc. of CP, volume 2470 of LNCS, 200-215.