Skip to main content
SpringerLink
Log in
Book cover

International Conference on Flexible Query Answering Systems

FQAS 2009: Flexible Query Answering Systems pp 394–405Cite as

Controlled Aggregate Tree Shaped Questions over Ontologies

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5822))

Abstract

Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query languages and the intuitive appeal of natural language. They compositionally map (modulo a compositional translation τ(·)) into (or express) formal query languages and ontology languages. Modulo compositionality, they inherit the computational properties of such ontology/query languages. In the setting of OBDAS, we are interested in capturing query answering and measuring computational complexity w.r.t. the data queried (a.k.a. data complexity). In this paper we focus in defining a CL capable of expressing a subset SQL aggregate queries, and study its data complexity w.r.t. several ontology languages and extensions of the query language.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Welsey, London (1995)

    MATH  Google Scholar 

  2. Androutsopoulos, I., Ritchie, G.D., Thanisch, P.: Natural language interfaces to databases - an introduction. Journal of Natural Language Engineering 1(1), 29–81 (1995)

    Article  Google Scholar 

  3. Baader, F., Calvanese, D., Nardi, D., Patel-Schneider, P., McGuinness, D.: The Description Logic Handbook. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  4. Bernardi, R., Calvanese, D., Thorne, C.: Lite natural language. In: IWCS 2007. Proceedings of the 7th International Workshop on Computational Semantics (2007)

    Google Scholar 

  5. Bernstein, A., Kaufmann, E., Göhring, A., Kiefer, C.: Querying ontologies: A controlled english interface for end-users. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 112–126. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Calvanese, D., de Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: KR 2006. Proceedings of the 10th International Conference on the Principles of Knowledge Representation and Reasoning (2006)

    Google Scholar 

  7. Calvanese, D., Nutt, W., Kharlamov, E., Thorne, C.: Aggregate queries over ontologies. In: ONISW 2008. Proceedings 2nd International Workshop on Ontologies and Information Systems for the Semantic Web (2008)

    Google Scholar 

  8. Clifford, J.: Natural language querying of historical databases. Computational Linguistics 14(4), 10–35 (1988)

    Google Scholar 

  9. Fuchs, N.E., Kaljurand, K.: Mapping Attempto Controlled English to OWL DL. In: ESWC 2006. Demos and Posters of the 3rd European Semantic Web Conference (2006)

    Google Scholar 

  10. Jurafsky, D., Martin, J.: Speech and Language Processing. Prentice Hall, Englewood Cliffs (2000)

    Google Scholar 

  11. Mador-Haim, S., Winter, Y., Braun, A.: Controlled language for geographical information system queries. In: ICos5. Proceedings of the 5th International Workshop on Inference in Computational Semantics (2006)

    Google Scholar 

  12. Montague, R.: Universal grammar. Theoria 36(3), 373–398 (1970)

    Article  MathSciNet  Google Scholar 

  13. Pratt, I.: Data complexity of the two-variable fragment with counting quantifiers. Information and Computation 207(8), 867–888 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  14. Pratt, I., Third, A.: More fragments of language. Notre Dame Journal of Formal Logic 47(2), 151–177 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  15. Schaerf, A.: On the complexity of the instance checking problem in concept languages with existential quantification. Journal of Intelligent Information Systems 2(3), 265–278 (1993)

    Article  MathSciNet  Google Scholar 

  16. Staab, S., Studer, R. (eds.): Handbook on Ontologies. International Handbooks on Information Systems. Springer, Heidelberg (2004)

    Google Scholar 

  17. Thorne, C., Calvanese, D.: Exploring ontology-based data access. In: CNL 2009. Proceedings of the Workshop on Controlled Natural Language (2009)

    Google Scholar 

  18. Vardi, M.: The complexity of relational query languages. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KRDB Centre, Free University of Bozen-Bolzano, 4, Via della Mostra, 39100, Italy

    Camilo Thorne & Diego Calvanese

Authors
  1. Camilo Thorne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Diego Calvanese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Roskilde University, Universitetsvej 1, 4000, Roskilde, Denmark

    Troels Andreasen  & Henrik Bulskov  & 

  2. Iona College, Machine Intelligence Institute, 10801, New Rochelle, NY, USA

    Ronald R. Yager

  3. Computer Science Dept., Research group PLIS: Programming, Roskilde University, Universitetsvej 1, 4000, Roskilde, Denmark

    Henning Christiansen

  4. Department of Computer Science and Engineering, Aalborg University Esbjerg, Niels Bohrs Vej 8, 6700, Esbjerg, Denmark

    Henrik Legind Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thorne, C., Calvanese, D. (2009). Controlled Aggregate Tree Shaped Questions over Ontologies. In: Andreasen, T., Yager, R.R., Bulskov, H., Christiansen, H., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 2009. Lecture Notes in Computer Science(), vol 5822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04957-6_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04957-6_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04956-9

  • Online ISBN: 978-3-642-04957-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation