Skip to main content
SpringerLink
Log in
Book cover

International Joint Conference on Knowledge Discovery, Knowledge Engineering, and Knowledge Management

IC3K 2014: Knowledge Discovery, Knowledge Engineering and Knowledge Management pp 273–292Cite as

Techniques for Merging Upper Ontologies

  • Conference paper
  • First Online:

  • 724 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 553))

Abstract

In this paper, we examine techniques used to merge the upper ontologies of the Process Specification Language (PSL) and the Descriptive Ontology for Linguistic and Cognitive Engineering (DOLCE) ontologies. In particular, we focus on the parts of these two ontologies relevant to the commonsense notion of participation as a relation between objects, activities, and time. We discuss the obstacles faced to formalize the relationships between these ontologies and provide an overview of the methodology undertaken to bridge the ontologies together. New ontologies are introduced to bring the PSL and DOLCE ontologies together to allow us to specify the mappings between them. We illustrate how ontology verification is used to show faithful interpretations between the two upper ontologies. We also explore applications of ontology transfer between a mathematical ontology and an upper ontology as an additional means of specifying bridges between ontologies.

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

Learn about institutional subscriptions

Notes

  1. 1.

    The results in this paper are an updated and revised version of the material found in [3], which was presented at the \(6^{th}\) International Conference on Knowledge Engineering and Ontology Development (KEOD).

  2. 2.

    A first-order ontology is a set of first-order sentences (axioms) that characterize a first-order theory, which is the closure of the ontology’s axioms under logical entailment. In the rest of the paper we will simply drop the term first-order and assume ontologies and theories to be first-order.

  3. 3.

    http://colore.oor.net/psl_core/psl_core.clif.

  4. 4.

    http://colore.oor.net/dolce_participation/dolce_participation.clif.

  5. 5.

    http://colore.oor.net/dolce/.

  6. 6.

    The new ontologies can be found at http://colore.oor.net/psl_participates/.

  7. 7.

    http://colore.oor.net/timepoints/linear_point.clif.

  8. 8.

    http://colore.oor.net/timepoints/lp_infinite_end.clif.

  9. 9.

    Additional information about the various relations found in convex and non-convex intervals can be found in [14].

  10. 10.

    http://colore.oor.net/combined_time/.

  11. 11.

    http://colore.oor.net/combined_time/endpoints.clif.

  12. 12.

    http://colore.oor.net/combined_time/vector_continuum.clif.

  13. 13.

    http://colore.oor.net/combined_time/interval_with_endpoints.clif.

  14. 14.

    We could not modify the axioms found in \(T_{psl\_core}\) since the axioms are standardized in ISO 18629-11:2005.

  15. 15.

    http://colore.oor.net/psl_core/mandatory.clif.

  16. 16.

    http://colore.oor.net/interval_psl/.

  17. 17.

    The terms overlap and intersect were not used to describe this relation since they are used in mereology ontologies. To be consistent with PSL, we decided to use the term overlay to describe the relationship where time intervals may overlay one another.

  18. 18.

    http://colore.oor.net/interval_psl/interval_mandatory.clif.

  19. 19.

    Recall that we did not commit to a particular temporal construct in \(T_{mandatory}\).

  20. 20.

    http://colore.oor.net/dolce_present/dolce_present_star.clif.

  21. 21.

    http://colore.oor.net/interval_psl/mappings/interval_psl_core2dolce_present.clif.

  22. 22.

    Proofs can be found at http://colore.oor.net/dolce_present/interprets/output/.

  23. 23.

    http://colore.oor.net/interval_psl/mappings/interval_mandatory2dolce_participation.clif.

  24. 24.

    Proofs can be found at http://colore.oor.net/dolce_participation/interprets/output/.

References

  1. Choi, N., Song, I.-Y., Han, H.: A survey on ontology mapping. SIGMOD Rec. 35(3), 34–41 (2006)

    Article  Google Scholar 

  2. Chui, C.: Axiomatized relationships between ontologies. Master’s thesis, University of Toronto (2013)

    Google Scholar 

  3. Chui, C., Grüninger, M.: Mathematical foundations for participation ontologies. In: Formal Ontology in Information Systems - Proceedings of the Eighth International Conference, FOIS 2014, 22–25 September, Rio de Janeiro, Brazil, pp. 105–118 (2014)

    Google Scholar 

  4. Chui, C., Grüninger, M.: Merging the DOLCE and PSL upper ontologies. In: Filipe, J., Dietz, J.L.G., Aveiro, D. (eds.) KEOD 2014 - Proceedings of the International Conference on Knowledge Engineering and Ontology Development, Rome, Italy, 21–24 October, pp. 16–26. SciTePress (2014)

    Google Scholar 

  5. de Bruijn, J., Ehrig, M., Feier, C., Martín-Recuerda, F., Scharffe, F., Weiten, M.: Ontology Mediation, Merging, and Aligning, pp. 95–113. Wiley (2006)

    Google Scholar 

  6. Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, New York (1972)

    MATH  Google Scholar 

  7. Euzenat, J., Shvaiko, P.: Ontology Matching. Springer-Verlag New York Inc., Secaucus (2007)

    MATH  Google Scholar 

  8. Grüninger, M.: Using the PSL ontology. In: Staab, S., Studer, R. (eds.) Handbook on Ontologies. International Handbooks on Information Systems, pp. 423–443. Springer, Heidelberg (2009)

    Google Scholar 

  9. Grüninger, M., Hahmann, T., Hashemi, A., Ong, D., Özgövde, A.: Modular first-order ontologies via repositories. Appl. Ontol. 7(2), 169–209 (2012)

    Google Scholar 

  10. Gruninger, M., Ong, D.: Verification of time ontologies with points and intervals. In: 2011 Eighteenth International Symposium on Temporal Representation and Reasoning (TIME), pp. 31–38 (2011)

    Google Scholar 

  11. Hayes, P.: A catalog of temporal theories. Technical report UIUC-BI-AI-96-01, Beckman Institute and Departments of Philosophy and Computer Science, University of Illinois (1996)

    Google Scholar 

  12. Kalfoglou, Y., Schorlemmer, M.: Ontology mapping: the state of the art. In: Kalfoglou, Y., Schorlemmer, M., Sheth, A., Staab, S., Uschold, M. (eds.) Semantic Interoperability and Integration, number 04391 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, February 2005. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany (2005)

    Google Scholar 

  13. Kutz, O., Mossakowski, T.: A modular consistency proof for DOLCE. In: Burgard, W., Roth, D. (eds.) Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011), 7–11 August, pp. 227–234. AAAI Press, San Francisco (2011)

    Google Scholar 

  14. Ladkin, P.B.: Time representation: a taxonomy of internal relations. In: Proceedings of the 5th National Conference on Artificial Intelligence, Philadelphia, PA, vol. 1, pp. 360–366 (1986)

    Google Scholar 

  15. Masolo, C., Borgo, S., Gangemi, A., Guarino, N., Oltramari, A.: WonderWeb Deliverable D18 Ontology Library (Final). Technical report, IST Project 2001–33052 WonderWeb: Ontology Infrastructure for the Semantic Web (2003)

    Google Scholar 

  16. Pearce, D., Valverde, A.: Synonymous theories and knowledge representations in answer set programming. J. Comput. Syst. Sci. 78(1), 86–104 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. Stuckenschmidt, H., Serafini, L., Wache, H.: Reasoning about Ontology Mappings. Technical report, ITC-IRST, Trento (2005)

    Google Scholar 

  18. van Benthem, J.: The Logic of Time: A Model-Theoretic Investigation into the Varieties of Temporal Ontology and Temporal Discourse. Synthese Library. Springer, New York (1991)

    Book  MATH  Google Scholar 

  19. Zimmermann, A., Krötzsch, M., Euzenat, J., Hitzler, P.: Formalizing ontology alignment and its operations with category theory. In: Proceedings of the Fourth International Conference on Formal Ontology in Information Systems (FOIS 2006), pp. 277–288. IOS Press, Amsterdam (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, ON, M5S 3G8, Canada

    Carmen Chui & Michael Grüninger

Authors
  1. Carmen Chui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Grüninger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carmen Chui .

Editor information

Editors and Affiliations

  1. Instituto de Telecomunicações, Lisboa, Portugal

    Ana Fred

  2. Delft University of Technology, Delft, Zuid-Holland, The Netherlands

    Jan L. G. Dietz

  3. University of Madeira, Funchal, Portugal

    David Aveiro

  4. Henley Business School, University of Reading, Reading, United Kingdom

    Kecheng Liu

  5. INSTICC, Setubal, Portugal

    Joaquim Filipe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Chui, C., Grüninger, M. (2015). Techniques for Merging Upper Ontologies. In: Fred, A., Dietz, J., Aveiro, D., Liu, K., Filipe, J. (eds) Knowledge Discovery, Knowledge Engineering and Knowledge Management. IC3K 2014. Communications in Computer and Information Science, vol 553. Springer, Cham. https://doi.org/10.1007/978-3-319-25840-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25840-9_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25839-3

  • Online ISBN: 978-3-319-25840-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation