Skip to main content
SpringerLink
Log in

Rewriting Queries with Negated Atoms

  • Conference paper
  • First Online:
Rules and Reasoning (RuleML+RR 2017)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10364))

Included in the following conference series:

Abstract

Query rewriting is a popular approach for ontology based data access and in general for first order rewritable knowledge bases. The algorithms defined in the field are based on conjunctive queries with no use of negation over the atoms that are part of them. Also, the constraints present in the knowledge base are ignored in the process of rewriting a query and they are only used to check the consistency of the data. In this paper, we study the problem of answering queries that allow negated atoms. Our approach uses a rewriting algorithm as a black box and the constraints in the system to find a set of conjunctive queries without negated atoms that is equivalent to the original query containing negated atoms. A system (Completo) was implemented with the proposed method and compared to another system (Rebsir) that is able to rewrite negated concepts. In the experimental evaluation Completo performed better than Rebsir for most of the datasets in the benchmark and it portrayed a more scalable performance i.e. describing a faster relative performance with respect to Rebsir’s performance with the increase of the size of assertions in the dataset.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Notes

  1. 1.

    http://image.ntua.gr/~gardero/completo-rr2017/Appendixes.pdf.

  2. 2.

    http://image.ntua.gr/~gardero/completo-rr2017/Appendixes.pdf.

  3. 3.

    http://image.ntua.gr/~gardero/completo-rr2017/Appendixes.pdf.

  4. 4.

    http://web.informatik.uni-mannheim.de/DBpediaAsTables/.

References

  1. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, New York (2003)

    MATH  Google Scholar 

  2. Baget, J.-F., Leclère, M., Mugnier, M.-L., Rocher, S., Sipieter, C.: Graal: a toolkit for query answering with existential rules. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 328–344. Springer, Cham (2015). doi:10.1007/978-3-319-21542-6_21

    Chapter  Google Scholar 

  3. Baget, J.F., Leclère, M., Mugnier, M.L., Salvat, E.: DL-SR: a lite DL with expressive rules: preliminary results. In: Baader, F., Lutz, C., Motik, B. (eds.) Description Logics, vol. 353. CEUR Workshop Proceedings (2008). CEUR-WS.org

  4. Baget, J.F., Leclere, M., Mugnier, M.L., Salvat, E.: On rules with existential variables: walking the decidability line. Artif. Intell. 175(9), 1620–1654 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bárány, V., Cate, B.T., Otto, M.: Queries with guarded negation (full version). CoRR, abs/1203.0077 (2012)

    Google Scholar 

  6. Bizer, C., Lehmann, J., Kobilarov, G., Auer, S., Becker, C., Cyganiak, R., Hellmann, S.: Dbpedia - a crystallization point for the web of data. Web Semant. 7(3), 154–165 (2009)

    Article  Google Scholar 

  7. Calvanese, D., Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: the DL-Lite family. J. Autom. Reason. 39(3), 385–429 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Du, J., Pan, J.Z.: Rewriting-based instance retrieval for negated concepts in description logic ontologies. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 339–355. Springer, Cham (2015). doi:10.1007/978-3-319-25007-6_20

    Chapter  Google Scholar 

  9. Gottlob, G., Orsi, G., Pieris, A.: Query rewriting and optimization for ontological databases. ACM Trans. Database Syst. 39(3), 25:1–25:46 (2014)

    Article  MathSciNet  Google Scholar 

  10. Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for OWL knowledge base systems. Web Semant. 3(2–3), 158–182 (2005)

    Article  Google Scholar 

  11. Gutiérrez-Basulto, V., Ibañez-García, Y., Kontchakov, R., Kostylev, E.V.: Conjunctive queries with negation over DL-Lite: a closer look. In: Faber, W., Lembo, D. (eds.) RR 2013. LNCS, vol. 7994, pp. 109–122. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39666-3_9

    Chapter  Google Scholar 

  12. König, M., Leclère, M., Mugnier, M.-L., Thomazo, M.: Sound, complete and minimal ucq-rewriting for existential rules. Semant. Web 6(5), 451–475 (2015)

    Article  Google Scholar 

  13. Trivela, D., Stoilos, G., Chortaras, A., Stamou, G.: Optimising resolution-based rewriting algorithms for owl ontologies. Web Semant. Sci. Serv. Agents World Wide Web 33, 30–49 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Technical University of Athens (NTUA), Zografou, Greece

    Enrique Matos Alfonso & Giorgos Stamou

Authors
  1. Enrique Matos Alfonso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giorgos Stamou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giorgos Stamou .

Editor information

Editors and Affiliations

  1. University of L’Aquila, L’Aquila, Italy

    Stefania Costantini

  2. Free University of Bozen-Bolzano, Bolzano, Italy

    Enrico Franconi

  3. Dalhousie University, Halifax, Nova Scotia, Canada

    William Van Woensel

  4. Birkbeck, University of London, London, United Kingdom

    Roman Kontchakov

  5. Imperial College London, London, United Kingdom

    Fariba Sadri

  6. SINTEF/University of Oslo, Oslo, Norway

    Dumitru Roman

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Alfonso, E.M., Stamou, G. (2017). Rewriting Queries with Negated Atoms. In: Costantini, S., Franconi, E., Van Woensel, W., Kontchakov, R., Sadri, F., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2017. Lecture Notes in Computer Science(), vol 10364. Springer, Cham. https://doi.org/10.1007/978-3-319-61252-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61252-2_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61251-5

  • Online ISBN: 978-3-319-61252-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation