<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Verification and Modularization of the DOLCE Upper Ontology</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Carmen</forename><surname>Chui</surname></persName>
							<email>cchui@mie.utoronto.ca.</email>
							<affiliation key="aff0">
								<orgName type="department">Department of Mechanical and Industrial Engineering</orgName>
								<orgName type="institution">University of Toronto</orgName>
								<address>
									<postCode>M5S 3G8</postCode>
									<region>Ontario</region>
									<country key="CA">Canada</country>
								</address>
							</affiliation>
							<affiliation key="aff0">
								<orgName type="department">Department of Mechanical and Industrial Engineering</orgName>
								<orgName type="institution">University of Toronto</orgName>
								<address>
									<postCode>M5S 3G8</postCode>
									<region>Ontario</region>
									<country key="CA">Canada</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Michael</forename><forename type="middle">Gr</forename><surname>Üninger</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Department of Mechanical and Industrial Engineering</orgName>
								<orgName type="institution">University of Toronto</orgName>
								<address>
									<postCode>M5S 3G8</postCode>
									<region>Ontario</region>
									<country key="CA">Canada</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Verification and Modularization of the DOLCE Upper Ontology</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">FEBC6FEF575365C84558E27D0A582033</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-25T08:37+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>upper ontologies</term>
					<term>ontology verification</term>
					<term>modularization</term>
					<term>DOLCE</term>
					<term>COLORE</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>This paper outlines the reductive modularization and verification of the Descriptive Ontology for Linguistic and Cognitive Engineering (DOLCE). The ontology makes distinctions between enduring and perduring entities which is reflected in the resulting reductive modules, in contrast to previous work done to generate a consistency proof for DOLCE. We present our approach to verify DOLCE with mathematical theories in the Common Logic Ontology Repository (COL-ORE), and describe how the ontological commitments made by the authors of DOLCE have affected the resulting verification and reductive modularization.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Foundational ontologies, also called upper ontologies, characterize the semantics of general concepts that underlay every knowledge representation enterprise. Since foundational ontologies are expected to be broadly reused, verifying that they do not have unintended models and that they are not missing any intended models are of paramount interest for the knowledge representation community.</p><p>The Descriptive Ontology for Linguistic and Cognitive Engineering (DOLCE) <ref type="foot" target="#foot_0">2</ref> is an upper ontology of particulars that captures ontological categories found in natural language and human common sense <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b2">3]</ref>. DOLCE is widely used by a diverse array of domain ontologies, ranging from event recognition to geographical information systems <ref type="bibr" target="#b5">[6]</ref>, through specialization of its backbone taxonomy.</p><p>Previous work in <ref type="bibr" target="#b7">[8]</ref> has demonstrated the consistency of DOLCE. In this paper, we give an overview of the verification of DOLCE, which in turn allows us to provide a characterization of the models of DOLCE up to isomorphism <ref type="foot" target="#foot_1">3</ref> . Ontology verification is the process by which a theory is checked to rule out its unintended models, and characterize any intended ones which might be missing. In this paper, we apply the definition of ontology verification based on representation theorems that was introduced in <ref type="bibr" target="#b3">[4]</ref>, which applies to the verification of ontologies axiomatized in first-order logic. It is particularly important to understand the models of upper ontologies such as DOLCE. First, it allows us to formally specify the relationships to other upper ontologies, and determine the similarities and differences among them. Second, a characterization of the models of DOLCE enables us to make its ontological commitments explicit. Ontology designers that create new domain-specific ontologies by extension of DOLCE can then be aware of the intended semantics of the concepts that they are using.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Ontology Verification</head><p>Verification is concerned with the relationship between the intended models of an ontology and the models of the axiomatization of the ontology. In particular, we want to characterize the models of an ontology up to isomorphism and determine whether or not these models are equivalent to the intended models of the ontology. This relationship between the intended models and the models of the axiomatization plays a key role in the application of ontologies in areas such as semantic integration and decision support.</p><p>Unfortunately, it can be quite difficult to characterize the models of an ontology up to isomorphism. Ideally, since the classes of structures that are isomorphic to an ontology's models often have their own axiomatizations, we should be able to reuse the characterizations of these other structures. We therefore specify mappings between the ontology being verified and some existing ontology whose models have already been characterized up to isomorphism.</p><p>Definition 1 Let T 0 be a theory with signature Σ(T 0 ) and let T 1 be a theory with signature Σ(T 1 ) such that Σ(T 0 ) ∩ Σ(T 1 ) = / 0. Translation definitions for T 0 into T 1 are conservative definitions in Σ(T 0 ) ∪ Σ(T 1 ) of the form</p><formula xml:id="formula_0">∀x p i (x) ≡ Φ(x)</formula><p>where p i (x) is a relation symbol in Σ(T 0 ) and Φ(x) is a formula in Σ(T 1 ).</p><p>The key to this endeavour is the notion of logical synonymy: Definition 2 Two theories T 1 and T 2 are synonymous iff there exist two sets of translation definitions ∆ and Π, respectively from T 1 to T 2 and from T 2 to T 1 , such that T 1 ∪ Π is logically equivalent to T 2 ∪ ∆.</p><p>By the results in <ref type="bibr" target="#b9">[10]</ref>, there is a bijection on the sets of models for synonymous theories. We can therefore characterize the models of the ontology being verified by demonstrating that the ontology is synonymous with a logical theory whose models we understand.</p><p>Synonymy is a relationship between two ontologies; we can generalize this to a relationship among arbitrary finite sets of ontologies: Definition 3 (Adapted from <ref type="bibr" target="#b4">[5]</ref>) A theory T is reducible to a set of theories T 1 , ..., T n iff 1. T faithfully interprets each theory T i , and 2. T 1 ∪ ... ∪ T n is synonymous with T .</p><p>The models of the reducible theory T can be constructed by amalgamating the models of the theories T 1 , ..., T n . We can thus provide a characterization of Mod(T ) up to isomorphism from the characterization of Mod(T i ) for each theory T i in the reduction.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Axiomatization of DOLCE</head><p>The axioms of DOLCE are divided into a set of subtheories as shown in Figure <ref type="figure" target="#fig_0">1</ref>. At the very bottom of the diagram is the DOLCE taxonomy subtheory, T dolce taxonomy , which consists of the categorization of the constructs found in DOLCE. The DOLCE Mereology and Time Mereology subtheories, T dolce mereology and T dolce time mereology , import the axioms of T dolce taxonomy , as denoted by the solid arrows in the figure <ref type="figure">.</ref> As well, T dolce mereology imports T dolce time mereology . We then see that the DOLCE Present subtheory, T dolce present , imports all of the axioms in T dolce time mereology , so T dolce taxonomy is included as well. Likewise, the DOLCE Dependence, Participation, and Temporary Parthood subtheories (denoted by T dolce dependence , T dolce participation , and T dolce temporary parthood , respectively) import T dolce present and all of the axioms contained therein. Finally, the DOLCE Constitution subtheory, T dolce constitution , imports all of the axioms in T dolce temporary parthood . Notice that there are four primary subtheories in DOLCE that are maximal with respect to importation, and which together constitute the entire set of axioms for DOLCE:</p><formula xml:id="formula_1">Definition 4</formula><p>T dolce = T dolce constitution ∪ T dolce participation ∪ T dolce dependence ∪ T dolce mereology</p><p>The verification of T dolce mereology is a straightforward generalization of traditional mereology ontologies, and we will not cover it in this paper. To verify the remaining three pri-mary DOLCE subtheories, we map them with existing mathematical ontologies found in the Common Logic Ontology Repository (COLORE) <ref type="foot" target="#foot_2">4</ref> . Figure <ref type="figure" target="#fig_1">2</ref> illustrates the mappings between the DOLCE theories and COLORE theories. In the next section we will explore how this leads to the verification of T dolce .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Verification of DOLCE Subtheories</head><p>In this section, we give an overview of the verification of T dolce . We open with an informal summary of the relevant mathematical ontologies that are required, and then consider the reductions of the subtheories of T dolce , namely, T dolce constitution , T dolce participation , and T dolce dependence .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Mathematical Ontologies used in the Reduction of DOLCE</head><p>A number of novel classes of mathematical structures have been axiomatized in order to adequately represent the models of DOLCE. Limited space does not allow us to provide all of the formal definitions for classes of mathematical structures; however, we can give a brief overview of the structures and their relationships to each other.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.1.">Usage of Bipartite and Tripartite Incidence Structures</head><p>In our partial modularization of DOLCE, we utilized bipartite incidence structures found in mathematical theories of COLORE. Bipartite incidence structures are a generalization of two-dimensional plane geometries -there are two disjoint sets of points and lines, and the incidence relation in(x, y) specifies the set of points that are incident with a line. Tripartite incidence structures are a generalization of three-dimensional space geometries -in addition to points and lines, there exists another set of elements known as planes. The incidence relation applies over the sets of points and lines that are incident with a plane.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.2.">Mereological Geometries, Bundles &amp; Foliations</head><p>In our reduction of T dolce constitution , we utilized structures<ref type="foot" target="#foot_3">5</ref> that arise from different ways of amalgamating mereologies and incidence structures.</p><p>A mereological geometry is the amalgamation of a bipartite incidence structure and a mereology that is specified on sets of collinear points (points that are all incident with the same line). Sets of collinear points need to satisfy axioms for a given mereology, and there may be a global mereology on a set of all points, regardless of collinearity. Mereological geometries are axiomatized by theories in the H mereological geometry Hierarchy 6 .</p><p>• ideal: collinear points form an ideal in the global classical extensional mereology (cem) mereology • cem: 'cem' refers to cem mereology, which is the global mereology on all points in this structure • wmg: collinear points form a weak mereology, wmg, which is a partial ordering In a mereological bundle, we find a generalization of the part(x, y) relation from mereology by introducing a ternary relation t part(x, y,t) that specifies a relativized parthood relation on sets of lines that are coincident with the same point. In mereological bundles, a quasiorder is specified on the set of lines that are incident with a point; a mereology is not specified on sets of intersecting lines due to the notion of temporary parthood. In the philosophical literature, the relation for temporary parthood is not considered to be antisymmetric, in contrast to the parthood relation in a mereology. Due to this, mereological bundles contain quasiorderings on sets of intersecting lines. Mereological bundles are axiomatized by theories in the H mereological bundle Hierarchy <ref type="foot" target="#foot_5">7</ref>Mereological foliations are simply an amalgamation of mereological geometries and mereological bundles. A mereology is specified on each set of collinear points and mereological bundle is specified on each set of intersecting lines. Mereological foliations are axiomatized by theories in the H mereological f oliation Hierarchy<ref type="foot" target="#foot_6">8</ref> </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.3.">Incidence Bundles &amp; Foliations</head><p>The above classes of mathematical structures are amalgamations of incidence structures with mereologies. For the verification of T dolce participation , we generalized these ideas to the notions of incidence bundles and incidence foliations.</p><p>Incidence bundles extend tripartite incidence structures with an additional ternary relation that represents a triple of mutually incident points, lines, and planes. The name of this class of structures owes its origin to the similarity with the notion of fibre bundles from differential topology <ref type="bibr" target="#b6">[7]</ref>. Incidence bundles are axiomatized by theories in the H incidence bundle Hierarchy <ref type="foot" target="#foot_7">9</ref> .</p><p>An incidence foliation is an amalgamation of a mereological geometry and an incidence bundle: a mereology is specified on each set of collinear points and an incidence bundle is specified on each set of coincident lines and planes. Incidence foliations are axiomatized by theories in the H incidence f oliation Hierarchy<ref type="foot" target="#foot_8">10</ref> .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.4.">Subposet Bundles &amp; Foliations</head><p>In addition to the mereological and incidence structures outlined above, we also utilize structures found in the subposet hierarchy<ref type="foot" target="#foot_9">11</ref> , H subposet , in COLORE. Each ontology in this hierarchy is an extension of an ontology from the Mereology Hierarchy, H mereology , and an ontology from the Ordering Hierarchy, H ordering . The ontologies in this hierarchy form the basis for H subposet . The root ontology T subposet root is the union of T m mereology and T partial ordering , and is a conservative extension of each of these ontologies. Thus, each model of T subposet root (and hence each model of any ontology in the hierarchy) is the amalgamation of a mereology substructure and a partial ordering substructure.</p><p>The ontologies in H subposet contain additional axioms that constrain how the mereology is related to the partial ordering. In models of T subposet , the mereology is a subordering of the partial ordering. T ideal strengthens this condition by requiring that the mereology is a subordering of the partial ordering which forms an ideal. In models of T chain antichain , elements that are ordered by the mereology are not comparable in the partial ordering.</p><p>All ontologies within H subposet combine one of the ontologies in the subposet hierarchy together with one of the ontologies in the mereology hierarchy and one of the ontologies in ordering hierarchy. We utilized the subposet bundle and subposet foliation structures constructed from models of theories H subposet in our reduction of DOLCE.</p><p>A subposet bundle is analogous to a mereological bundle: we find a generalization of the part(x, y) relation from mereology by introducing a ternary relation t part(x, y, z) that specifies a relativized parthood relation on sets of lines that are coincident with the same point. We also find a generalization of the leq(x, y) relation from the ordering theories introducing a ternary relation tleq(x, y, z) that specifies a relativized ordering relation on sets of lines that are coincident with the same point. Subposet bundles are axiomatized by theories in the H subposet bundle Hierarchy<ref type="foot" target="#foot_10">12</ref> .</p><p>Subposet foliations are an amalgamation of mereological geometries and subposet bundles; they are axiomatized by theories in the H subposet f oliation Hierarchy<ref type="foot" target="#foot_11">13</ref> .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Verification of T dolce constitution</head><p>T dolce constitution has three main subtheories. In the subtheory T dolce present , we have axioms that describe the existence of an endurant ED(x), perdurant PD(x), or a quality Q(x) during a time interval T (x).</p><p>Within the Temporary Parthood theory T dolce temporary parthood in DOLCE, the tP(x, y,t) relation only holds for endurants, so the verification tasks were broken down into three parts: a task to handle physical endurants PED(x), a task to handle nonphysical endurants NPED(x), and a task to handle both perdurants PD(x) and qualities Q(x). Collectively, PED(x) and NPED(x) make up endurants ED(x), but since they are disjoint constructs we were required to create two sets of translation definitions, ∆ 1 and ∆ 2 , to handle these endurant subcategories. The translation definitions for PD(x) and Q(x) are grouped together in ∆ 3 because the tP(x, y,t) does not involve either of these constructs.</p><p>Similar to the T dolce temporary parthood axioms, the theory of constitution T dolce constitution<ref type="foot" target="#foot_12">14</ref> contains additional axioms that only apply to the physical endurants PED(x), nonphysical endurants NPED(x), and perdurants PD(x). The constitution axioms require the first two arguments to be of the same category; for example, only two non-physical endurants NPED(x) can constitute each other during a given time interval t. The remainder of the axioms show that constitution is irreflexive, transitive, enforces the existence of the two endurants or perdurants that are being constituted, constitution still holds for subintervals of a time interval, and that temporary parts of an endurant are also constituted.</p><p>The reduction of T dolce constitution uses theories about subposet foliations and mereological geometries: Theorem 1 T dolce constitution is synonymous with T ideal cem lower re f lect down f oliation ∪ T ideal cem downward m f oliation ∪T ideal cem wmg ∪ T ideal cem lower re f lect down f oliation</p><p>The theories in the reduction correspond to the subtheories of T dolce constitution that axiomatize constitution of physical endurants PED(x), non-physical endurants NPED(x), perdurants PD(x), and qualities Q(x), respectively.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3.">Verification of T dolce participation</head><p>We have seen that a fundamental ontological commitment of DOLCE is the distinction between enduring and perduring entities, where the fundamental difference between the two is related to their behaviour in time <ref type="bibr" target="#b8">[9]</ref>. Endurants are wholly present at any time: they are observed and perceived as a complete concept, regardless of a given snapshot of time. Perdurants, on the other hand, extend in time by accumulating different temporal parts, so they are only partially present at any given point in time. In T dolce participation<ref type="foot" target="#foot_13">15</ref> , endurants are involved in an occurrence, so the notion of participation is not considered parthood. Rather, participation is time-indexed in order to account for the varieties of participation in time, such as temporary participation and constant participation.</p><p>Intuitively, the mereological geometry in an incidence foliation corresponds to the subtheory of T dolce participation that axiomatizes the PRE(x,t) relation between perdurants or endurants (which are interpreted by lines) and time intervals (which are interpreted as points). This raises a challenge. On the one hand, we have the problem that in the incidence bundle, both endurants and perdurants can be interpreted by lines, yet one class must be interpreted by planes in the incidence foliation. On the other hand, there is no other distinction between these two classes. As a result, we need two separate incidence foliations for the verification.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Theorem 2 T dolce participation is synonymous with T ideal cem plane downward in f oliation ∪ T ideal cem line downward in f oliation</head><p>In T ideal cem plane downward in f oliation , we interpret endurants as planes and perdurants as lines within the incidence bundle. In the mereological geometry, there is a classical extensional mereology on the set of points, while sets of collinear points form ideals within the mereology. Full details for the verification of T dolce participation can be found in <ref type="bibr" target="#b1">[2]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.4.">Verification of T dolce dependence</head><p>Finally, DOLCE contains a rich formalization of the intuitions about ontological dependence between two entities <ref type="bibr" target="#b8">[9]</ref>, and it explicitly axiomatizes several different dependence relations. For example, an entity x is specifically dependent on another entity y iff, at any time t, the entity x cannot be present at time t unless the entity y is also present at time t. Furthermore, there are different dependence relations between entities in different classes within the DOLCE taxonomy, and this leads to seven different subtheories (see Table <ref type="table" target="#tab_0">1</ref>). The verification of these dependence theories requires tripartite incidence structures and ordered geometries:</p><p>Theorem 3 T mob apo dependence is synonymous with T plane proper dependence ∪ T ideal cem wmg . T tq pd dependence , T pq ped dependence , and T aq nped dependence are each synonymous with T plane mutual dependence ∪ T ideal cem wmg .</p><p>T f napo dependence , T sag apo dependence , and T naso sc dependence are each synonymous with T ideal cem wmg ∪ T atomic proper dependence .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Modularization of DOLCE</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.1.">Consistency of DOLCE</head><p>In <ref type="bibr" target="#b7">[8]</ref>, the authors present a novel approach at establishing the consistency of DOLCE. They proposed a methodology that utilizes the HETS 16 to develop an architectural specification for DOLCE that is used to produce relative consistency proofs based on conservativity triangles. In HETS, an architectural specification is essentially a software specification that decomposes a large theory into smaller subtasks, which includes the construction of models for these small theories, proving the conservativity of theory extensions, and determining whether the constructed theories can be amalgamated together <ref type="bibr" target="#b7">[8]</ref>. Relative consistency proofs are used by HETS to provide theory interpretations into another theory that is known or assumed to be consistent. HETS visualizes these relationships between smaller theories via development graphs by denoting the dependencies between the theories. The approach presented in <ref type="bibr" target="#b7">[8]</ref> constructed a global model for DOLCE that is built from smaller models of subtheories together with amalgamability properties between such models. The authors hand-crafted an architectural specification of DOLCE which reflects the way models of the theory can be built, and utilized HETS to automatically verify the amalgamability conditions and produce a series of relative consistency proofs.</p><p>The authors of <ref type="bibr" target="#b7">[8]</ref> note that the axioms in the dependence theory of DOLCE introduced complications in their first modularization attempt since subtle dependencies between parts of DOLCE's taxonomy were involved. Consequently, they restructured  their architectural specification for DOLCE to utilize DOLCE's temporal mereology in a bottom-up manner. The end result consisted of thirty eight units within the architectural specification and eighteen amalgamations, allowing the generation of various finite models for DOLCE <ref type="bibr" target="#b7">[8]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2.">Reductive Modularization of DOLCE</head><p>The reduction of a theory can also be used to decompose an ontology <ref type="bibr" target="#b4">[5]</ref>. If T is reducible to S 1 , ..., S n , then there exist subtheories T 1 , ..., T n such that each T i is synonymous with S i . Since T is a conservative extension of each T i , we refer to the subtheories as the reductive modules of T . We can therefore use the results from verification to modularize T dolce -each theory in the reduction (see Theorem 1) is synonymous with a reductive module of T dolce constitution .</p><p>The verification of DOLCE led to a modularization that was strikingly different from the modularization that was used in the consistency proof in <ref type="bibr" target="#b7">[8]</ref>. Rather than sets of axioms for relations such as constitution and temporary parthood, the reductive modules of DOLCE are subtheories for classes of elements -perdurants, physical endurants, nonphysical endurants, and qualities. We have already noted that a fundamental ontologi-cal commitment of DOLCE is the distinction between enduring and perduring entities, which are also referred to as continuants and occurrents, where the fundamental difference between the two is related to their behaviour in time <ref type="bibr" target="#b8">[9]</ref>. It is interesting to discover that this distinction is also reflected in the modularity of the ontology itself.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Discussion and Summary</head><p>The verification of the DOLCE subtheories is summarized in Figure <ref type="figure" target="#fig_1">2</ref>. The resulting modularization is oriented around the distinction between endurants and perdurants; rather than divide the axioms into the T dolce temporary parthood and T dolce constitution subtheories, the modules correspond to constitution and temporary parthood for different classes of endurants and perdurants in the taxonomy. Several interesting observations about the modularization can be made. On the one hand, it is easy to see that the reductive modularization is quite different from the modularization of <ref type="bibr" target="#b7">[8]</ref>. On the other hand, our modularization of DOLCE is coarser-grained than the modules presented in <ref type="bibr" target="#b7">[8]</ref>, in the sense that every (reductive) module in our modularization is a module of DOLCE, and every module in <ref type="bibr" target="#b7">[8]</ref> is a module of the (reductive) modules we have presented in this work.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 .</head><label>1</label><figDesc>Figure 1. Relationships between DOLCE modules. Solid arrows denote conservative extensions, dashed arrows denote non-conservative extensions, and dashed boxes indicate individual hierarchies.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 .</head><label>2</label><figDesc>Figure 2. DOLCE subtheories and the mathematical ontologies from COLORE that are used in the verification. Solid arrows denote conservative extensions and solid lines indicate synonymy.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 .</head><label>1</label><figDesc>Dependence subtheories in DOLCE.</figDesc><table><row><cell>Dependent Class</cell><cell>Class</cell><cell>Subtheory</cell></row><row><cell>Mental Object (MOB)</cell><cell>Agentive Physical Object (APO)</cell><cell>T mob apo dependence</cell></row><row><cell>Temporal Quality (TQ)</cell><cell>Physical Endurant (PED)</cell><cell>T tq pd dependence</cell></row><row><cell>Physical Quality</cell><cell>Physical Endurant (PED)</cell><cell>T pq ped dependence</cell></row><row><cell>Abstract Quality (AQ)</cell><cell>Non Physical Endurant (NPED)</cell><cell>T aq nped dependence</cell></row><row><cell>Feature</cell><cell>Non Agentive Physical Object (NAPO)</cell><cell>T f napo dependence</cell></row><row><cell>Social Agent (SAG)</cell><cell>Agentive Physical Object (APO)</cell><cell>T sag apo dependence</cell></row><row><cell>Non Agentive Physical Object (NAPO)</cell><cell>Society (SC)</cell><cell>T naso sc dependence</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_0">http://www.loa.istc.cnr.it/old/DOLCE.html</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_1">This paper only gives an overview of the verification of DOLCE; all of the proofs for the theorems can be found in the full papers: http://stl.mie.utoronto.ca/publications/participation.pdf and http://stl.mie.utoronto.ca/publications/dolce-verification.pdf</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_2">http://colore.oor.net/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="5" xml:id="foot_3">Due to the various combinations of incidence structures, the names of the theories in COLORE may appear confusing. Here we briefly outline the naming convention used to describe these incidence structure theories. Consider the theory T ideal cem wmg in COLORE. The name ideal cem wmg is broken down as follows:</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_4">An ideal is a set closed under the P(x, y) and sum(x, y, z) relations. For any two points, its sum is also in the set.<ref type="bibr" target="#b5">6</ref> http://colore.oor.net/mereological_geometry/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="7" xml:id="foot_5">http://colore.oor.net/mereological_bundle/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="8" xml:id="foot_6">http://colore.oor.net/mereological_foliation/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="9" xml:id="foot_7">http://colore.oor.net/incidence_bundle/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="10" xml:id="foot_8">http://colore.oor.net/incidence_foliation/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="11" xml:id="foot_9">http://colore.oor.net/subposet/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="12" xml:id="foot_10">http://colore.oor.net/subposet_bundle/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="13" xml:id="foot_11">http://colore.oor.net/subposet_foliation/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="14" xml:id="foot_12">http://colore.oor.net/dolce_constitution/dolce_constitution.clif</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="15" xml:id="foot_13">http://colore.oor.net/dolce_participation/dolce_participation.clif</note>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Foundational Choices in DOLCE</title>
		<author>
			<persName><forename type="first">Stefano</forename><surname>Borgo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Claudio</forename><surname>Masolo</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Handbook on Ontologies</title>
				<editor>
			<persName><forename type="first">Steffen</forename><surname>Staab</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Ruder</forename><surname>Studer</surname></persName>
		</editor>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
	<note>second edition</note>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Mathematical Foundations for Participation Ontologies</title>
		<author>
			<persName><forename type="first">Carmen</forename><surname>Chui</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Michael</forename><surname>Grüninger</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Formal Ontology in Information Systems -Proceedings of the Eighth International Conference, FOIS 2014</title>
				<meeting><address><addrLine>Rio de Janeiro, Brazil</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2014">September, 22-25, 2014. 2014</date>
			<biblScope unit="page" from="105" to="118" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Sweetening ontologies with DOLCE</title>
		<author>
			<persName><forename type="first">Aldo</forename><surname>Gangemi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Nicola</forename><surname>Guarino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Claudio</forename><surname>Masolo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Alessandro</forename><surname>Oltramari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Luc</forename><surname>Schneider</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Ontologies and the Semantic Web, 13th International Conference, EKAW 2002</title>
				<meeting><address><addrLine>Siguenza, Spain</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2002">October 1-4, 2002. 2002</date>
			<biblScope unit="page" from="166" to="181" />
		</imprint>
	</monogr>
	<note>Proceedings</note>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Ontology verification with repositories</title>
		<author>
			<persName><forename type="first">Michael</forename><surname>Grüninger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Torsten</forename><surname>Hahmann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Ali</forename><surname>Hashemi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Darren</forename><surname>Ong</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Sixth International Conference, FOIS 2010</title>
				<meeting>the Sixth International Conference, FOIS 2010<address><addrLine>Toronto, Canada</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2010">May 11-14, 2010. 2010</date>
			<biblScope unit="page" from="317" to="330" />
		</imprint>
	</monogr>
	<note>Formal Ontology in Information Systems</note>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Modular firstorder ontologies via repositories</title>
		<author>
			<persName><forename type="first">Michael</forename><surname>Grüninger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Torsten</forename><surname>Hahmann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Ali</forename><surname>Hashemi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Darren</forename><surname>Ong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Atalay</forename><surname>Özgövde</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Applied Ontology</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="169" to="209" />
			<date type="published" when="2012">2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">The void in hydro ontology</title>
		<author>
			<persName><forename type="first">Torsten</forename><surname>Hahmann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Boyan</forename><surname>Brodaric</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Formal Ontology in Information Systems -Proceedings of the Seventh International Conference, FOIS 2012</title>
				<meeting><address><addrLine>Gray, Austra</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2012">July 24-27, 2012. 2012</date>
			<biblScope unit="page" from="45" to="58" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Fibre Bundles</title>
		<author>
			<persName><forename type="first">Dale</forename><surname>Husemöller</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Graduate Texts in Mathematics</title>
				<meeting><address><addrLine>New York</addrLine></address></meeting>
		<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="1994">1994</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">A Modular Consistency Proof for DOLCE</title>
		<author>
			<persName><forename type="first">Oliver</forename><surname>Kutz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Till</forename><surname>Mossakowski</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011</title>
				<meeting>the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011<address><addrLine>San Francisco, California, USA</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2011">August 7-11, 2011, 2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<author>
			<persName><forename type="first">Claudio</forename><surname>Masolo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Stefano</forename><surname>Borgo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Aldo</forename><surname>Gangemi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Nicola</forename><surname>Guarino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Alessandro</forename><surname>Oltramari</surname></persName>
		</author>
		<idno>IST Project 2001-33052</idno>
		<title level="m">WonderWeb: Ontology Infrastructure for the Semantic Web</title>
				<imprint>
			<date type="published" when="2003">2003</date>
		</imprint>
	</monogr>
	<note type="report_type">Technical report</note>
	<note>Wonder-Web Deliverable D18 Ontology Library (Final)</note>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Synonymous theories and knowledge representations in answer set programming</title>
		<author>
			<persName><forename type="first">D</forename><surname>Pearce</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Valverde</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">JCSS Knowledge Representation and Reasoning</title>
				<imprint>
			<date type="published" when="2012">2012</date>
			<biblScope unit="volume">78</biblScope>
			<biblScope unit="page" from="86" to="104" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
