New expressive languages for ontological query answering

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1541-1546

  Calì, Andrea ^b,c   Gottlob, Georg ^a,b   Pieris, Andreas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY RESULTS; CONJUNCTIVE QUERIES; DATABASE CONSTRAINTS; DATABASE TECHNOLOGY; DATALOG; DESCRIPTION LOGIC; FIRST-ORDER; FUNCTIONAL DEPENDENCY; NEGATIVE CONSTRAINTS; ONTOLOGICAL QUERY; ONTOLOGY LANGUAGE; ONTOLOGY-BASED DATA ACCESS; QUERY ANSWERING; SQL QUERY;

ARTIFICIAL INTELLIGENCE; DATA DESCRIPTION; INNOVATION; ONTOLOGY; QUERY LANGUAGES;

QUERY PROCESSING;

EID: 80055061282     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.
2. Beeri, C., and Vardi, M. Y. 1981. The implication problem for data dependencies. In Proc. of ICALP, 73-85.
3. Cabibbo, L. 1998. The expressive power of stratified logic programs with value invention. Inf. Comput. 147(1):22-56. (Pubitemid 128453326)
4. Calì, A.; Gottlob, G.; and Kifer, M. 2008. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. of KR, 70-80.
5. Calì, A.; Gottlob, G.; and Lukasiewicz, T. 2009. A general datalog-based framework for tractable query answering over ontologies. In Proc. of PODS, 77-86.
6. Calì, A.; Gottlob, G.; and Pieris, A. 2010a. Advanced processing for ontological queries. Proc. of VLDB 3(1):554-565.
7. Calì, A.; Gottlob, G.; and Pieris, A. 2010b. Query answering under non-guarded rules in Datalog+/-. In Proc. of RR, 1-17.
8. Calvanese, D.; Giacomo, G. D.; 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.; and Rosati, R. 2007. Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Autom. Reasoning 39(3):385-429. (Pubitemid 47340922)
10. Chandra, A. K., and Merlin, P. M. 1977. Optimal implementation of conjunctive queries in relational data bases. In Proc. of STOCS, 77-90.
11. Deutsch, A.; Nash, A.; and Remmel, J. B. 2008. The chase revisisted. In Proc. of PODS, 149-158.
12. Fagin, R.; Kolaitis, P. G.; Miller, R. J.; and Popa, L. 2005. Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1):89-124. (Pubitemid 40612385)
13. Johnson, D. S., and Klug, A. C. 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1):167-189. (Pubitemid 14569352)
14. Maier, D.; Mendelzon, A. O.; and Sagiv, Y. 1979. Testing implications of data dependencies. ACM Trans. Database Syst. 4(4):455-469.
15. Mailharrow, D. 1998. A classification and constraint-based framework for configuration. Artif. Intell. for Eng. Design, Anal. and Manuf. 12(4):383-397.
16. Patel-Schneider, P.F., and Horrocks, I. 2007. A comparison of two modelling paradigms in the semantic web. J. Web Semantics 5(4):240-250. (Pubitemid 350186144)
17. Poggi, A.; Lembo, D.; Calvanese, D.; De Giacomo, G.; Lenzerini, M.; and Rosati, R. 2008. Linking data to ontologies. J. Data Semantics 10:133-173.
18. Rudolph, S.; Krötzsch, M.; and Hitzler, P. 2008. All elephants are bigger than all mice. In Proc. of DL.
19. Vardi, M. Y. 1995. On the complexity of bounded-variable queries. In Proc. of PODS, 266-276.