Skip to main content

The Mereologies of Upper Ontologies

  • Conference paper
  • First Online:
  • 698 Accesses

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

Abstract

Mereology, the formal theory of parts and wholes, has a played a prominent role within applied ontology. As a fundamental set of concepts for commonsense reasoning, it also appears in a number of upper level ontologies. Furthermore, such upper-level ontologies provide an account of the most basic, domain-independent, existing entities, such as time, space, objects, and processes. In this paper, we verify the core characterization of mereologies of the Suggested Upper Merged Ontology (SUMO), and the mereology of the Descriptive Ontology for Linguistic and Cognitive Engineering (DOLCE), while relating their axiomatizations via ontology mapping. We show that the existing axiomatization of SUMO omits some of the intended models of classical mereology, and we propose the correction and addition of axioms to address this issue. In addition, we show the formal relationship between the axiomatization of mereology in both upper-level ontologies.

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

Buying options

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

Change history

  • 05 February 2019

    In a previous version of this publication, the affiliation of the second editor was incomplete. This has now been corrected.

Notes

  1. 1.

    https://www.w3.org/2001/sw/wiki/OWL.

  2. 2.

    The expressive power of first-order logic makes its use necessary for the representation of mappings that characterize features that are not representable in lightweight languages, such as Description Logics. In addition, checking the correctness of those mappings results facilitated by the fact that first-order theorem proving in standard first-order logic is a mature field, and, although semi-decidable, first-order reasoning on small modules results in an acceptable trade-off among expressivity and efficiency.

  3. 3.

    This paper is an extended and expanded version of the paper “Verifying and Mapping the Mereotopology of Upper-Level Ontologies” that originally appeared in the Proceedings of Knowledge Engineering and Ontology Design (KEOD) 2016 [16].

  4. 4.

    We assume that an ontology is a set of sentences called axioms closed under logical entailment that state the properties that characterize the behaviour of a set of symbols representing constants, relations and functions, called the signature of the ontology.

  5. 5.

    A representation theorem is a theorem that formally classifies a given class of structures as equivalent to another class of structures whose properties are better understood. The stated equivalence makes possible the extrapolation of those properties to the classified structures, facilitating their understanding.

  6. 6.

    http://suo.ieee.org/SUO/KIF/suo-kif.html.

  7. 7.

    http://logic.stanford.edu/kif/kif.html.

  8. 8.

    A theory \({T'}\) is a conservative extension of a theory T if every theorem of T is a theorem of \({T'}\), and every theorem of \({T'}\) in the signature of T is also a theorem of T.

  9. 9.

    The proofs for all Propositions have been found using the Prover9 automated theorem prover, and models were constructed using Mace4. Results are available at: colore.oor.net/ontologies/sumo/mereotopology/proofs.

  10. 10.

    colore.oor.net/ontologies/lattices/join_semilattice.clif.

  11. 11.

    colore.oor.net/ontologies/mereology/strong_lub_mereology.clif.

  12. 12.

    colore.oor.net/ontologies/mereology/prod_mereology.clif.

  13. 13.

    colore.oor.net/ontologies/mereology/comp_mereology.clif.

  14. 14.

    http://wonderweb.semanticweb.org.

  15. 15.

    Axioms (48), (49), (53), and (54) are the instantiation of DOLCE higher-order axiom schemas for the subcategories of main categories Q and R which are relevant for our work. A complete version of DOLCE-CORE mereology represented in first-order logic is available at colore.oor.net/ontologies/dolce-core/mereology.in.

  16. 16.

    It can be proved that in an extensional mereology non-atomic entities whose proper parts are the same, are identical, i.e., every entity is exhaustively defined by its parts.

  17. 17.

    Available at colore.oor.net/ontologies/sumo/modules.

  18. 18.

    A n-ary function f from \(A^n\) to B is representable by a relation \(\varrho \) with arity (n+1), called the graph of f, such that:

    (a) Every tuple of \(\varrho \) is a tuple \(\langle \bar{x}, f(\bar{x})\rangle \) with \(\bar{x}\in A^n\) and \(f(\bar{x}) \in range(f)\).

    (b) If \(f(\bar{x})=b\) and \(f(\bar{z})=c\), then \(b=c\).

References

  1. Benzmüller, C., Pease, A.: Higher-order aspects and context in SUMO. J. Web Sem. 12, 104–117 (2012)

    Article  Google Scholar 

  2. Borgo, S., Masolo, C.: Foundational choices in DOLCE. In: Staab, S., Studer, R. (eds.) Handbook on Ontologies. IHIS, pp. 361–381. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-92673-3_16

    Chapter  Google Scholar 

  3. Casati, R., Varzi, A.C.: Parts and Places: The Structures of Spatial Representation. A Bradford Book. MIT Press, Cambridge (1999)

    Google Scholar 

  4. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002). Cambridge mathematical text books

    Book  Google Scholar 

  5. Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, Cambridge (1972)

    MATH  Google Scholar 

  6. Euzenat, J., Shvaiko, P.: Ontology Matching, 2nd edn. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38721-0

    Book  MATH  Google Scholar 

  7. Gangemi, A., Guarino, N., Masolo, C., Oltramari, A.: Sweetening WORDNET with DOLCE. AI Mag. 24(3), 13–24 (2003)

    MATH  Google Scholar 

  8. Gangemi, A., Guarino, N., Masolo, C., Oltramari, A., Schneider, L.: Sweetening ontologies with DOLCE. In: Gómez-Pérez, A., Benjamins, V.R. (eds.) EKAW 2002. LNCS (LNAI), vol. 2473, pp. 166–181. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45810-7_18

    Chapter  MATH  Google Scholar 

  9. Grenon, P., Smith, B.: SNAP and SPAN: towards dynamic spatial ontology. Spat. Cogn. Comput. 4(1), 69–103 (2004)

    Article  Google Scholar 

  10. Grüninger, M., Hahmann, T., Hashemi, A., Ong, D.: Ontology verification with repositories. In: Proceedings of the Sixth International Conference Formal Ontology in Information Systems, FOIS 2010, Toronto, Canada, 11–14 May 2010, pp. 317–330 (2010)

    Google Scholar 

  11. Guarino, N.: Formal ontology and information systems. In: Formal Ontology in Information Systems - Proceedings of FOIS 1998, Trento, Italy, 6–8 June 1998, pp. 3–15. IOS Press, Amsterdam, pp. 3–15 (1998)

    Google Scholar 

  12. Guarino, N., Welty, C.: Evaluating ontological decisions with ontoclean. Commun. ACM 45(2), 61–65 (2002)

    Article  Google Scholar 

  13. Hayes, P.: Catalog of temporal theories. Technical report UIUC-BI-AI-96-01. University of Illinois Urbana-Champagne (1996)

    Google Scholar 

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

  15. McCune. W.: Prover9 and Mace4 (2005–2010). http://www.cs.unm.edu/mccune/prover9/

  16. Silva Muñoz, L., Grüninger, M.: Verifying and mapping the mereotopology of upper-level ontologies. In: Knowledge Engineering and Ontology Design, KEOD 2016, Porto, Portugal, 9–11 November 2016, pp. 31–42 (2016)

    Google Scholar 

  17. Niles, I., Pease, A.: Linking lexicons and ontologies: mapping WordNet to the suggested upper merged ontology. In: Proceedings of the 2003 International Conference on Information and Knowledge Engineering (IKE 2003), Las Vegas, Nevada (2003)

    Google Scholar 

  18. Niles, I., Pease, A.: Towards a standard upper ontology. In FOIS 2001: Proceedings of the international conference on Formal Ontology in Information Systems, pp. 2–9. ACM, New York (2001)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  20. Silva Muñoz, L., Grüninger, M.: Mapping and verification of the time ontology in SUMO. In: Formal Ontology in Information Systems - Proceedings of the 9th International Conference, FOIS, 6–9 July 2016, Annecy, France (2016)

    Google Scholar 

  21. Varzi, A.C.: Spatial reasoning and ontology: parts, wholes, and locations. In: Aiello, M., Pratt-Hartmann, I., Van Benthem, J. (eds.) Handbook of Spatial Logicspages, pp. 945–1038. Springer, Dordrecht (2007). https://doi.org/10.1007/978-1-4020-5587-4_15

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael Grüninger .

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

Silva Muñoz, L., Grüninger, M. (2019). The Mereologies of Upper Ontologies. In: Fred, A., Dietz, J., Aveiro, D., Liu, K., Bernardino, J., Filipe, J. (eds) Knowledge Discovery, Knowledge Engineering and Knowledge Management. IC3K 2016. Communications in Computer and Information Science, vol 914. Springer, Cham. https://doi.org/10.1007/978-3-319-99701-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99701-8_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99700-1

  • Online ISBN: 978-3-319-99701-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics