Identity Resolution in Ontology Based Data Access to Structured Data Sources | SpringerLink
Skip to main content

Identity Resolution in Ontology Based Data Access to Structured Data Sources

  • Conference paper
  • First Online:
PRICAI 2019: Trends in Artificial Intelligence (PRICAI 2019)

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

Included in the following conference series:

  • 2283 Accesses

Abstract

Earlier work has proposed a notion of referring expressions and types in first order knowledge bases as a way of more effectively answering conjunctive queries in ontology based data access (OBDA). We consider how PTIME description logics can be combined with referring expressions to provide a more effective virtual front-end to nested relational data sources via OBDA. In particular, we consider replacing the standard notion of an assertion box, or ABox, with a more general notion of a concept box, or CBox, and show how this can serve as a front-end to such data sources.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /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
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

Notes

  1. 1.

    This constitutes a minimal condition for capturing when one violates an inclusion dependency of the form \({``\,}C_1 \sqsubseteq C_2:\mathop {\mathsf {Pf}}\nolimits _1,\ldots ,\mathop {\mathsf {Pf}}\nolimits _k\rightarrow \mathop {\mathsf {Pf}}\nolimits _0{''\,}.\)

  2. 2.

    https://www.mongodb.com/.

  3. 3.

    https://www.json.org/.

  4. 4.

    Here, we translate “phone” fields of documents as roles that are reified, in the sense outline above, in order to enable different people to share phones.

References

  1. Borgida, A., Toman, D., Weddell, G.: On referring expressions in query answering over first order knowledge bases. In: Proceedings of KR 2016, pp. 319–328 (2016)

    Google Scholar 

  2. Calvanese, D., Giese, M., Hovland, D., Rezk, M.: Ontology-based integration of cross-linked datasets. In: Arenas, M., et al. (eds.) ISWC 2015, Part I. LNCS, vol. 9366, pp. 199–216. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25007-6_12

    Chapter  Google Scholar 

  3. Jacques, J.S., Toman, D., Weddell, G.E.: Object-relational queries over \({\cal{CFDI}_{nc}}\) knowledge bases: OBDA for the SQL-Literate. In: Proceedings of International Joint Conference on Artificial Intelligence, IJCAI, pp. 1258–1264 (2016)

    Google Scholar 

  4. McIntyre, S., Borgida, A., Toman, D., Weddell, G.: On limited conjunctions and partial features in parameter-tractable feature logics. In: Proceedings of AAAI Conference on Artificial Intelligence 2019, Honolulu, HI, USA (2019, in press)

    Google Scholar 

  5. Toman, D., Weddell, G.: On keys and functional dependencies as first-class citizens in description logics. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 647–661. Springer, Heidelberg (2006). https://doi.org/10.1007/11814771_52

    Chapter  Google Scholar 

  6. Toman, D., Weddell, G.E.: On the interaction between inverse features and path-functional dependencies in description logics. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 603–608 (2005)

    Google Scholar 

  7. Toman, D., Weddell, G.E.: On keys and functional dependencies as first-class citizens in description logics. J. Autom. Reason. 40(2–3), 117–132 (2008)

    Article  MathSciNet  Google Scholar 

  8. Toman, D., Weddell, G.: On adding inverse features to the description logic \(\cal{CFD}^{\forall }_{nc}\). In: Pham, D.-N., Park, S.-B. (eds.) PRICAI 2014. LNCS (LNAI), vol. 8862, pp. 587–599. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13560-1_47

    Chapter  Google Scholar 

  9. Toman, D., Weddell, G.: On partial features in the \(\cal{DLF}\) family of description logics. In: Booth, R., Zhang, M.-L. (eds.) PRICAI 2016. LNCS (LNAI), vol. 9810, pp. 529–542. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42911-3_44

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Toman .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Toman, D., Weddell, G. (2019). Identity Resolution in Ontology Based Data Access to Structured Data Sources. In: Nayak, A., Sharma, A. (eds) PRICAI 2019: Trends in Artificial Intelligence. PRICAI 2019. Lecture Notes in Computer Science(), vol 11670. Springer, Cham. https://doi.org/10.1007/978-3-030-29908-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-29908-8_38

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-29907-1

  • Online ISBN: 978-3-030-29908-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics