Exact Query Reformulation with First-Order Ontologies and Databases

  • Enrico Franconi
  • Volha Kerhet
  • Nhung Ngo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7519)


We study a general framework for query rewriting in the presence of an arbitrary first-order logic ontology over a database signature. The framework supports deciding the existence of a safe-range first-order equivalent reformulation of a query in terms of the database signature, and if so, it provides an effective approach to construct the reformulation based on interpolation using standard theorem proving techniques (e.g., tableau). Since the reformulation is a safe-range formula, it is effectively executable as an SQL query. At the end, we present an application of the framework with \(\mathcal{SHOQ}\) ontologies.


Description Logic Relational Algebra Original Query Database Signature Atomic Concept 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Etzioni, O., Golden, K., Weld, D.S.: Sound and efficient closed-world reasoning for planning. Artif. Intell. 89, 113–148 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Marx, M.: Queries determined by views: pack your views. In: Proceedings of the 26th ACM Symposium on Principles of Database Systems, PODS 2007, pp. 23–30 (2007)Google Scholar
  3. 3.
    Nash, A., Segoufin, L., Vianu, V.: Views and queries: Determinacy and rewriting. ACM Trans. Database Syst. 35, 21:1–21:41 (2010)CrossRefGoogle Scholar
  4. 4.
    Fan, W., Geerts, F., Zheng, L.: View determinacy for preserving selected information in data transformations. Inf. Syst. 37, 1–12 (2012)CrossRefGoogle Scholar
  5. 5.
    Seylan, İ., Franconi, E., de Bruijn, J.: Effective query rewriting with ontologies over DBoxes. In: Proc. of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 923–925 (2009)Google Scholar
  6. 6.
    Franconi, E., Ibanez-Garcia, Y.A., Seylan, İ.: Query answering with DBoxes is hard. Electronic Notes in Theoretical Computer Science 278, 71–84 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)Google Scholar
  8. 8.
    Halevy, A.Y.: Answering queries using views: A survey. The VLDB Journal 10, 270–294 (2001)CrossRefzbMATHGoogle Scholar
  9. 9.
    Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res (JAIR) 36, 1–69 (2009)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Franconi, E., Kerhet, V., Ngo, N.: Exact query reformulation over SHOQ DBoxes. In: Proc. of the 2012 International Workshop on Description Logics, DL 2012 (2012)Google Scholar
  11. 11.
    Avron, A.: Constructibility and decidability versus domain independence and absoluteness. Theor. Comput. Sci. 394, 144–158 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Beth, E.: On Padoa’s method in the theory of definition. Indagationes Mathematicae 15, 330–339 (1953)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Gurevich, Y.: Toward logic tailored for computational complexity. In: Computation and Proof Theory, vol. 1104, pp. 175–216. Springer (1984)Google Scholar
  14. 14.
    Fitting, M.: First-order logic and automated theorem proving, 2nd edn. Springer (1996)Google Scholar
  15. 15.
    Borgida, A., de Bruijn, J., Franconi, E., Seylan, İ., Straccia, U., Toman, D., Weddell, G.E.: On finding query rewritings under expressive constraints. In: Proc. of the 18th Italian Symposium on Advanced Database Systems (SEBD 2010), pp. 426–437 (2010)Google Scholar
  16. 16.
    Horrocks, I., Sattler, U.: Ontology reasoning in the SHOQ(D) description logic. In: Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001), pp. 199–204 (2001)Google Scholar
  17. 17.
    Lutz, C., Areces, C., Horrocks, I., Sattler, U.: Keys, nominals, and concrete domains. J. Artif. Int. Res. 23, 667–726 (2005)MathSciNetzbMATHGoogle Scholar
  18. 18.
    McCune, W.: Prover9 and Mace4 (2005-2011),

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Enrico Franconi
    • 1
  • Volha Kerhet
    • 1
  • Nhung Ngo
    • 1
  1. 1.Free University of Bozen-BolzanoItaly

Personalised recommendations