[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Making Metaquerying Practical for Hi(DL − Lite R ) Knowledge Bases

  • Conference paper
On the Move to Meaningful Internet Systems: OTM 2014 Conferences (OTM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8841))

Abstract

Hi(DL − Lite R ) is a higher-order Description Logic obtained from DL − Lite R by adding metamodeling features, and is equipped with a query language that is able to express higher-order queries. We investigate the problem of answering a particular class of such queries, called instance higher-order queries, posed over Hi(DL − Lite R ) knowledge bases (KBs). The only existing algorithm for this problem is based on the idea of reducing the evaluation of a higher-order query q over a Hi(DL − Lite R ) KB to the evaluation of a union of first-order queries over a DL − Lite R KB, built from q by instantiating its metavariables in all possible ways. Although of polynomial time complexity with respect to the size of the KB, this algorithm turns out to be inefficient in practice. In this paper we present a new algorithm, called Smart Binding Planner (SBP), that compiles Q into a program, that issues a sequence of first-order conjunctive queries, where each query has the goal of providing the bindings for metavariables of the next ones, and the last one completes the process by computing the answers to Q. We also illustrate some experiments showing that, in practice, SBP is significantly more efficient than the previous approach.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Antonioli, N., Castanò, F., Civili, C., Coletta, S., Grossi, S., Lembo, D., Lenzerini, M., Poggi, A., Savo, D.F., Virardi, E.: Ontology-based data access: the experience at the Italian Department of Treasury. In: Proc. of the Industrial Track of CAiSE 2013. CEUR, vol. 1017, pp. 9–16 (2013), ceur-ws.org

  2. Attardi, G., Simi, M.: Consistency and completeness of omega, a logic for knowledge representation. In: Proc. of IJCAI 1981, pp. 504–510 (1981)

    Google Scholar 

  3. Badea, L.: Reifying concepts in description logics. In: Proc.of IJCAI 1997, pp. 142–147 (1997)

    Google Scholar 

  4. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Poggi, A., Rodriguez-Muro, M., Rosati, R., Ruzzi, M., Savo, D.F.: The Mastro system for ontology-based data access. Semantic Web J. 2(1), 43–53 (2011)

    Google Scholar 

  5. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3), 385–429 (2007)

    Article  MATH  Google Scholar 

  6. Colucci, S., Di Noia, T., Di Sciascio, E., Donini, F.M., Ragone, A.: Second-order description logics: Semantics, motivation, and a calculus. In: Proc. of DL 2010. CEUR, vol. 573 (2010), ceur-ws.org

  7. Console, M., Lembo, D., Santarelli, V., Savo, D.F.: Graphol: Ontology representation through diagrams (2014)

    Google Scholar 

  8. De Giacomo, G., Lenzerini, M., Rosati, R.: Higher-order description logics for domain metamodeling. In: Proc. of AAAI 2011 (2011)

    Google Scholar 

  9. Di Pinto, F., De Giacomo, G., Lenzerini, M., Rosati, R.: Ontology-based data access with dynamic TBoxes in DL-Lite. In: Proc. of AAAI 2012 (2012)

    Google Scholar 

  10. Glimm, B., Rudolph, S., Volker, J.: Integrated metamodeling and diagnosis in owl 2. In: Proc. of ISWC 2010, pp. 257–272 (2010)

    Google Scholar 

  11. Lehmann, F. (ed.): Semantic Networks in Artificial Intelligence. Pergamon Press, Oxford, United Kingdom (1992)

    Google Scholar 

  12. Motik, B.: On the properties of metamodeling in OWL. J. of Logic and Computation 17(4), 617–637 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Mylopoulos, J., Bernstein, P.A., Wong, H.K.T.: A language facility for designing database-intensive applications. ACM Trans. on Database Systems 5(2), 185–207 (1980)

    Article  Google Scholar 

  14. Pan, J.Z., Horrocks, I.: OWL FA: a metamodeling extension of OWL DL. In: Proc. of WWW 2006, pp. 1065–1066 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria Informatica, Automatica e Gestionale “Antonio Ruberti”, Sapienza Università di Roma, Via Ariosto 25, I-00183, Roma, Italy

    Maurizio Lenzerini, Lorenzo Lepore & Antonella Poggi

Authors
  1. Maurizio Lenzerini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lorenzo Lepore
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonella Poggi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. TU Graz, Rechbauerstraße 12, 8010, Graz, Austria

    Robert Meersman

  2. CRAN, Campus Sciences, University of Lorraine, BP 70239, 54506, Vandoevre-les-Nancy, France

    Hervé Panetto

  3. Computer Science and Computer Engineering, La Trobe University, 3086, Melbourne, VIC, Australia

    Tharam Dillon

  4. Laboratory for Enterprise Knowledge and Systems (LEKS), IASI - CNR, Viale Manzoni 30, 00185, Rome, Italy

    Michele Missikoff

  5. School of Software, Tsinghua University, 100084, Beijing, China

    Lin Liu

  6. PROS Research Center, Camino de Vera, Universidad Politècnica de València, 46022, Valencia, Spain

    Oscar Pastor

  7. Department of Electronics, Computer Science and Systems, Univeristy of Calabria, Via P. Bucci, 41C, 87036, Rende, Cosenza, Italy

    Alfredo Cuzzocrea

  8. School of Computer Science and Information Technology, RMIT, Australia

    Timos Sellis

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lenzerini, M., Lepore, L., Poggi, A. (2014). Making Metaquerying Practical for Hi(DL − Lite R ) Knowledge Bases. In: Meersman, R., et al. On the Move to Meaningful Internet Systems: OTM 2014 Conferences. OTM 2014. Lecture Notes in Computer Science, vol 8841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45563-0_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45563-0_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45562-3

  • Online ISBN: 978-3-662-45563-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation