Skip to main content
SpringerLink
Log in

Tractable Reasoning in Description Logics with Functionality Constraints

  • Chapter
Book cover In Search of Elegance in the Theory and Practice of Computation

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8000))

  • 1217 Accesses

Abstract

Ontological query answering amounts to returning the answers to a query, that are logically entailed by the union of a set of membership assertions and an ontology, where the latter is a set of logical assertions. Ontological query answering has applications, for instance, in the Semantic Web and in semantic data integration. We propose as ontology language a new description logic, called DLR±, allowing for roles of arbitrary arity and role inclusion assertions with permutation, as well as functionality assertions, which generalizes the most widely-adopted tractable ontology languages. The interaction between functionality assertions and other constructs in ontology languages has been shown to lead easily to intractability and even undecidability. The absence of such interaction is characterized by separability, a semantic property which has been studied in different contexts. With the aim of finding expressive ontology languages that are also tractable, we give a precise characterization of separable DLR± ontologies by providing a syntactic condition that is necessary and sufficient for separability. We also present an exhaustive complexity analysis of reasoning, here intended as conjunctive query answering and satisfiability checking, under separable DLR± ontologies.

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 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

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-Wesley (1995)

    MATH  Google Scholar 

  2. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. 36, 1–69 (2009)

    MathSciNet  MATH  Google Scholar 

  3. Calì, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog+/-: A family of logical knowledge representation and query languages for new applications. In: Proc. of LICS, pp. 228–242 (2010)

    Google Scholar 

  4. Calì, A., Gottlob, G., Pieris, A.: Ontological query answering under expressive entity-relationship schemata. Inf. Syst. 37(4), 320–335 (2012)

    Article  Google Scholar 

  5. Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of PODS, pp. 260–271 (2003)

    Google Scholar 

  6. Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: Proc. of IJCAI, pp. 16–21 (2003)

    Google Scholar 

  7. Calì, A., Martinenghi, D.: Querying incomplete data over extended ER schemata. TPLP 10(3), 291–329 (2010)

    MATH  Google Scholar 

  8. 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. Autom. Reasoning 39(3), 385–429 (2007)

    Article  MATH  Google Scholar 

  9. Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of PODS, pp. 149–158 (1998)

    Google Scholar 

  10. Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Artif. Intell. 195, 335–360 (2013)

    Article  MATH  Google Scholar 

  11. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. of STOCS, pp. 77–90 (1977)

    Google Scholar 

  12. Chen, P.P.: The Entity-Relationship model: Towards a unified view of data. ACM TODS 1(1), 124–131 (1976)

    Google Scholar 

  13. Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic SHIQ. In: Proc. of IJCAI, pp. 399–404 (2007)

    Google Scholar 

  14. Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1), 167–189 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kozen, D.: Lower bounds for natural proof systems. In: Proc. of FOCS, pp. 254–266 (1977)

    Google Scholar 

  16. Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. of PODS, pp. 233–246 (2002)

    Google Scholar 

  17. Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455–469 (1979)

    Article  Google Scholar 

  18. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)

    Google Scholar 

  19. Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semantics 10, 133–173 (2008)

    Google Scholar 

  20. Vardi, M.Y.: The complexity of relational query languages. In: Proc. of STOC, pp. 137–146 (1982)

    Google Scholar 

  21. Vardi, M.Y.: On the complexity of bounded-variable queries. In: Proc. of PODS, pp. 266–276 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Inf. Syst., Birkbeck, University of London, UK

    Andrea Calì

  2. Department of Computer Science, University of Oxford, UK

    Georg Gottlob & Andreas Pieris

  3. Oxford-Man Institute of Quantitative Finance, University of Oxford, UK

    Andrea Calì & Georg Gottlob

Authors
  1. Andrea Calì
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Gottlob
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas Pieris
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Science, University of Pennsylvania, 3330 Walnut St., 19104, Philadelphia, PA, USA

    Val Tannen

  2. School of Computing, National University of Singapore, 13 Computing Drive, 117417, Singapore, Singapore

    Limsoon Wong

  3. School of Informatics, The University of Edinburgh, 10 Crichton Street, EH8 9AB, Edinburgh, UK

    Leonid Libkin , Wenfei Fan  & Michael Fourman ,  & 

  4. Department of Computer Science, University of California, 1156 High Street, 95064, Santa Cruz, CA, USA

    Wang-Chiew Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Calì, A., Gottlob, G., Pieris, A. (2013). Tractable Reasoning in Description Logics with Functionality Constraints. In: Tannen, V., Wong, L., Libkin, L., Fan, W., Tan, WC., Fourman, M. (eds) In Search of Elegance in the Theory and Practice of Computation. Lecture Notes in Computer Science, vol 8000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41660-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41660-6_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41659-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation