Effective query rewriting with ontologies over DBoxes

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 923-929

  Seylan, Inanç ^a   Franconi, Enrico ^a   De Bruijn, Jos ^a  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA DESCRIPTION; INTERPOLATION; ONTOLOGY;

ATOMIC-CONCEPTS; DATABASE TECHNOLOGY; DEFINABILITY; DESCRIPTION LOGIC; INTERPOLANTS; OPTIMISATIONS; QUERY ANSWERING; QUERY REWRITINGS;

QUERY PROCESSING;

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

References (20)

1. S. Abiteboul and O. M. Duschka. Complexity of answering queries using materialized views. In Proc. PODS, pages 254-263, 1998.
2. F. Baader, D. Calvanese, D. L. McGuinness, D Nardi, and P. F. Patel-Schneider, editors. Description Logic Handbook, 2nd edition. Cambridge Univ. Press, 2007.
3. E. W. Beth. On Padoa's methods in the theory of definitions. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, 56:330-339, 1953.
4. D. Calvanese, G. De Giacomo, and M. Lenzerini. Conjunctive query containment and answering under description logic constraints. ACM Transactions on Computational Logic, 9(3), 2008.
5. S. Colucci, T. Di Noia, E. Di Sciascio, F. M. Donini, and M. Mongiello. A uniform tableauxbased approach to concept abduction and contraction in ALN. In Proc. of DL'04, page 104, 2004.
6. William Craig. Three uses of the herbrandgentzen theorem in relating model theory and proof theory. The Journal of Symbolic Logic, 22(3):269-285, 1957.
7. C. Elsenbroich, O. Kutz, and U. Sattler. A case for abductive reasoning over ontologies. In OWL: Experiences and Directions, pages 10-11, 2006.
8. O. Etzioni, K. Golden, and D. S. Weld. Sound and efficient closed-world reasoning for planning. Artificial Intelligence, 89(1-2):113-148, 1997.
9. M. Fitting. Proof Methods for Modal and Intuitionistic Logics, vol. 169 of Synthese Library. 1983.
10. R. Goré and L. A. Nguyen. Exptime tableaux with global caching for description logics with transitive roles, inverse roles and role hierarchies. In TABLEAUX '07, pages 133-148, 2007.
11. V. Haarslev, M. Timmann, and R. Möller. Combining tableaux and algebraic methods for reasoning with qualified number restrictions. In Proc. of DL'01. 2001.
12. I. Horrocks. Implementation and optimization techniques. In Baader et al. [2007], pages 306-346.
13. S. Klarman. Abox abduction in description logic. Master's thesis, Universiteit van Amsterdam, 2008.
14. M. Marx. Queries determined by views: pack your views. In Proc. PODS, pages 23-30, 2007.
15. A. Nash, L. Segoufin, and V. Vianu. Determinacy and rewriting of conjunctive queries using views: A progress report. In Proc. ICDT, pages 59-73, 2007.
16. W. Rautenberg. Modal tableau calculi and interpolation. Journal of Philosophical Logic, 12(4):403-423, 1983.
17. Stefan Schlobach. Explaining subsumption by optimal interpolation. In Proc. JELIA'04, pages 413-425. 2004.
18. Luc Segoufin and Victor Vianu. Views and queries: determinacy and rewriting. In Proc. PODS, pages 49-60, 2005.
19. A. Tarski. Some methodological investigations on the definability of concepts. In Logic, Semantics and Metamathematics, pages 296-319. Clarendon, 1956.
20. B. ten Cate, W. Conradie, M. Marx, and Y. Venema. Definitorially complete description logics. In Proc. of KR'06, pages 79-89. 2006.