DL-lite in the light of first-order logic

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 361-366

  Artale, A ^a   Calvanese, D ^a   Kontchakov, R ^b   Zakharyaschev, M ^b  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; INFORMATION MANAGEMENT; ONTOLOGY; QUERY LANGUAGES; SEMANTIC WEB;

CONJUNCTIVE QUERIES; DATA COMPLEXITY; DATA INTEGRATION; NUMBER RESTRICTIONS;

ARTIFICIAL INTELLIGENCE;

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

References (19)

1. Abiteboul, S.; Hull, R.; and Vianu, V. 1995. Foundations of Databases. Addison Wesley Publ. Co.
2. Artale, A.; Calvanese, D.; Kontchakov, R.; Ryzhikov, V.; and Zakharyaschev, M. 2007. Complexity of reasoning in entity relationship models. In Proc. of DL 2007.
3. Baader, F.; Brandt, S.; and Lutz, C. 2005. Pushing the εℒ envelope. In Proc. of IJCAI 2005, 364-369.
4. Baader, F.; Lutz, C.; and Suntisrivaraporn, B. 2005. Is tractable reasoning in extensions of the description logic εℒ useful in practice? In Proc. of M4M 2005.
5. Bernstein, P. A.; Giunchiglia, F.; Kementsietsidis, A.; Mylopoulos, J.; Serafini, L.; and Zaihrayeu, I. 2002. Data management for peer-to-peer computing: A vision. In Proc. of WebDB 2002.
6. Borgida, A.; Brachman, R. J.; McGuinness, D. L.; and Resnick, L. A. 1989. CLASSIC: A structural data model for objects. In Proc. of ACM SIGMOD, 59-67.
7. Calvanese, D.; De Giacomo, G.; Lenzerini, M.; and Rosati, R. 2004. Logical foundations of peer-to-peer data integration. In Proc. of PODS 2004, 241-251.
8. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2005a. DL-Lite: Tractable description logics for ontologies. In Proc. of AAAI 2005, 602-607.
9. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2005b. Tailoring OWL for data intensive ontologies. In Proc. of OWLED 2005.
10. 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 2006, 260-270.
11. Donini, F. M.; Lenzerini, M.; Nardi, D.; and Schaerf, A. 1994. Deduction in concept languages: From subsumption to instance checking. J. of Log. and Comp. 4(4):423-452.
12. Franconi, E.; Kuper, G. M.; Lopatenko, A.; and Zaihrayeu, I. 2004. Queries and updates in the coDB peer to peer database system. In Proc. of VLDB 2004, 1277-1280.
13. Heflin, J., and Hendler, J. 2001. A portrait of the Semantic Web in action. IEEE Intelligent Systems 16(2):54-59.
14. Kozen, D. 2006. Theory of Computation. Springer.
15. Lenzerini, M. 2002. Data integration: A theoretical perspective. In Proc. of PODS 2002, 233-246.
16. Ortiz, M. M.; Calvanese, D.; and Eiter, T. 2006. Characterizing data complexity for conjunctive query answering in expressive description logics. In Proc. of AAAI 2006.
17. Papadimitriou, C. H. 1994. Computational Complexity. Addison Wesley Publ. Co.
18. Rautenberg, W. 2006. A Concise Introduction to Mathematical Logic. Springer.
19. Vardi, M. Y. 1982. The complexity of relational query languages. In Proc. of STOC'82, 137-146.