Dataset Preview
Duplicate
The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
The dataset generation failed because of a cast error
Error code:   DatasetGenerationCastError
Exception:    DatasetGenerationCastError
Message:      An error occurred while generating the dataset

All the data files must have the same columns, but at some point there are 27 new columns ({'5', '2', '0', '11', '22', '18', '19', '14', '12', '9', '21', '23', '4', '13', '26', '15', '25', '8', '16', '20', '1', '7', '6', '10', '3', '17', '24'}) and 11 missing columns ({'sub_type', 'img_path', 'text_format', 'text_level', 'image_caption', 'text', 'bbox', 'image_footnote', 'page_idx', 'list_items', 'type'}).

This happened while the json dataset builder was generating data using

hf://datasets/Chelsea707/miners/data/2023/2308_01xxx/2308.01597/02afac10-8251-4a73-aa5f-400c9e5be391_model.json (at revision 11dee795f4cf8a8b200b9ca9be95d413e6eb436c)

Please either edit the data files to have matching columns, or separate them into different configurations (see docs at https://hf.co/docs/hub/datasets-manual-configuration#multiple-configurations)
Traceback:    Traceback (most recent call last):
                File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 1831, in _prepare_split_single
                  writer.write_table(table)
                File "/usr/local/lib/python3.12/site-packages/datasets/arrow_writer.py", line 714, in write_table
                  pa_table = table_cast(pa_table, self._schema)
                             ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
                File "/usr/local/lib/python3.12/site-packages/datasets/table.py", line 2272, in table_cast
                  return cast_table_to_schema(table, schema)
                         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
                File "/usr/local/lib/python3.12/site-packages/datasets/table.py", line 2218, in cast_table_to_schema
                  raise CastError(
              datasets.table.CastError: Couldn't cast
              0: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              1: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              2: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              3: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              4: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              5: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              6: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, 
              ...
                child 0, item: double
                child 2, content: string
                child 3, type: string
              21: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              22: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              23: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              24: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              25: struct<angle: int64, bbox: list<item: double>, content: null, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: null
                child 3, type: string
              26: struct<angle: int64, bbox: list<item: double>, content: string, type: string>
                child 0, angle: int64
                child 1, bbox: list<item: double>
                    child 0, item: double
                child 2, content: string
                child 3, type: string
              -- schema metadata --
              pandas: '{"index_columns": [], "column_indexes": [], "columns": [{"name":' + 2836
              to
              {'type': Value('string'), 'text': Value('string'), 'text_level': Value('int64'), 'bbox': List(Value('int64')), 'page_idx': Value('int64'), 'img_path': Value('string'), 'image_caption': List(Value('string')), 'image_footnote': List(Value('null')), 'sub_type': Value('string'), 'list_items': List(Value('string')), 'text_format': Value('string')}
              because column names don't match
              
              During handling of the above exception, another exception occurred:
              
              Traceback (most recent call last):
                File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1334, in compute_config_parquet_and_info_response
                  parquet_operations, partial, estimated_dataset_info = stream_convert_to_parquet(
                                                                        ^^^^^^^^^^^^^^^^^^^^^^^^^^
                File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 911, in stream_convert_to_parquet
                  builder._prepare_split(
                File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 1702, in _prepare_split
                  for job_id, done, content in self._prepare_split_single(
                                               ^^^^^^^^^^^^^^^^^^^^^^^^^^^
                File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 1833, in _prepare_split_single
                  raise DatasetGenerationCastError.from_cast_error(
              datasets.exceptions.DatasetGenerationCastError: An error occurred while generating the dataset
              
              All the data files must have the same columns, but at some point there are 27 new columns ({'5', '2', '0', '11', '22', '18', '19', '14', '12', '9', '21', '23', '4', '13', '26', '15', '25', '8', '16', '20', '1', '7', '6', '10', '3', '17', '24'}) and 11 missing columns ({'sub_type', 'img_path', 'text_format', 'text_level', 'image_caption', 'text', 'bbox', 'image_footnote', 'page_idx', 'list_items', 'type'}).
              
              This happened while the json dataset builder was generating data using
              
              hf://datasets/Chelsea707/miners/data/2023/2308_01xxx/2308.01597/02afac10-8251-4a73-aa5f-400c9e5be391_model.json (at revision 11dee795f4cf8a8b200b9ca9be95d413e6eb436c)
              
              Please either edit the data files to have matching columns, or separate them into different configurations (see docs at https://hf.co/docs/hub/datasets-manual-configuration#multiple-configurations)

Need help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.

type
string
text
string
text_level
int64
bbox
list
page_idx
int64
img_path
null
image_caption
null
image_footnote
null
sub_type
null
list_items
null
text_format
null
text
DOLCE: A Descriptive Ontology for Linguistic and Cognitive Engineering<sup>1</sup>
1
[ 115, 186, 759, 255 ]
0
null
null
null
null
null
null
text
Stefano Borgo *, Roberta Ferrario, Aldo Gangemi, Nicola Guarino, Claudio Masolo, Daniele Porello, Emilio M. Sanfilippo and Laure Vieu
null
[ 115, 280, 794, 311 ]
0
null
null
null
null
null
null
text
Abstract. DOLCE, the first top-level (foundational) ontology to be axiomatized, has remained stable for twenty years and today is broadly used in a variety of domains. DOLCE is inspired by cognitive and linguistic considerations and aims to model a commonsense view of reality, like the one human beings exploit in everyday life in areas as diverse as socio-technical systems, manufacturing, financial transactions and cultural heritage. DOLCE clearly lists the ontological choices it is based upon, relies on philosophical principles, is richly formalized, and is built according to well-established ontological methodologies, e.g. OntoClean. Because of these features, it has inspired most of the existing top-level ontologies and has been used to develop or improve standards and public domain resources (e.g. CIDOC CRM, DBpedia and WordNet). Being a foundational ontology, DOLCE is not directly concerned with domain knowledge. Its purpose is to provide the general categories and relations needed to give a coherent view of reality, to integrate domain knowledge, and to mediate across domains. In these 20 years DOLCE has shown that applied ontologies can be stable and that interoperability across reference and domain ontologies is a reality. This paper briefly introduces the ontology and shows how to use it on a few modeling cases.
null
[ 115, 329, 880, 461 ]
0
null
null
null
null
null
null
text
Keywords: DOLCE, Foundational ontology, Ontological analysis, Formal ontology, Use cases
null
[ 115, 464, 685, 476 ]
0
null
null
null
null
null
null
text
Introduction
1
[ 115, 531, 216, 546 ]
0
null
null
null
null
null
null
text
As a foundational ontology, $\mathrm{DOLCE}^2$ provides general categories and relations that can be reused in different application scenarios by specializing them to the specific domains to be modeled.
null
[ 115, 561, 880, 592 ]
0
null
null
null
null
null
null
text
In order to rely on well-established modeling principles and theoretical bases, it is a common practice for the categories and relations of foundational ontologies to be philosophically grounded. This is one of the reasons why the ontological analysis preceding modeling is of paramount importance. A careful choice and characterization of categories and relations produces indeed ontologies that have higher chances of being interoperable, or at least of understanding potential obstacles to interoperability. In particular, when this strategy is applied to foundational ontologies, interoperability is possible also between the domain ontologies aligned to them.
null
[ 115, 593, 880, 700 ]
0
null
null
null
null
null
null
text
From a philosophical perspective, DOLCE adopts a descriptive (rather than referentialist) metaphysics, as its main purpose is to make explicit already existing conceptualizations through the use of categories whose structure is influenced by natural language, the makeup of human cognition, and social practices. As a consequence, such categories are mostly situated at a mesoscopic level, and may change while scientific knowledge or social consensus evolve. Also, DOLCE's domain of discourse is formed by particulars, while properties and relations are taken to be universals.
null
[ 115, 701, 880, 791 ]
0
null
null
null
null
null
null
header
Applied Ontology 0 (0) 1 IOS Press
null
[ 114, 123, 270, 146 ]
0
null
null
null
null
null
null
page_number
1
null
[ 870, 124, 878, 134 ]
0
null
null
null
null
null
null
page_footnote
This paper is a presentation of DOLCE based on (Masolo et al., 2003) and experience acquired with its application.
null
[ 132, 807, 828, 821 ]
0
null
null
null
null
null
null
page_footnote
* Corresponding author. E-mail: stefano.borgo@cnr.it.
null
[ 132, 822, 457, 834 ]
0
null
null
null
null
null
null
page_footnote
<sup>2</sup>http://www.loa.istc.cnr.it/index.php/dolce/
null
[ 132, 835, 394, 848 ]
0
null
null
null
null
null
null
footer
1570-5838/\$35.00 © 0 - IOS Press and the authors. All rights reserved
null
[ 115, 870, 547, 882 ]
0
null
null
null
null
null
null
aside_text
arXiv:2308.01597v1 [cs.AI] 3 Aug 2023
null
[ 25, 316, 60, 717 ]
0
null
null
null
null
null
null
text
Once the intended meaning of the terms denoting the relevant ontology categories has been analyzed, it should be expressed in a way that is as semantically transparent as possible. To this aim, DOLCE is equipped with a rich axiomatization in first-order modal logic. Such richness greatly enhances expressiveness but, on the other hand, it makes foundational ontologies non computable, due to the well-known trade-off between formal expressiveness and computability. For this reason, approximated and partial translations expressed in application-oriented languages are often provided, as is the case for DOLCE.<sup>3</sup>
null
[ 112, 151, 882, 244 ]
1
null
null
null
null
null
null
text
A bit of history of DOLCE
1
[ 112, 258, 309, 273 ]
1
null
null
null
null
null
null
text
The first comprehensive presentation of DOLCE appeared in the deliverables of the WonderWeb project in the early 2000s and in particular (Masolo et al., 2003). Following this work, several application-oriented, "lite" versions were later published, including DOLCE-lite, DOLCE-ultralite, and DOLCE-zero (Paulheim and Gangemi, 2015), see (Presutti and Gangemi, 2016) for a summary, and widely used (see also Sect. 4). The present article is mainly based on the work of Masolo et al. (2003) with the addition of concepts, e.g. roles, as introduced by Borgo and Masolo (2009).
null
[ 110, 288, 882, 381 ]
1
null
null
null
null
null
null
text
The analysis underlying the formalization of DOLCE leverages the techniques of ontological engineering and the study of classes' meta-properties of the OntoClean methodology, firstly developed in the early 2000s by Guarino and Welty (2002) and later revised by Guarino and Welty (2009) and Guarino (2009).
null
[ 110, 381, 882, 441 ]
1
null
null
null
null
null
null
text
A later work presented by Masolo et al. (2004) introduced social roles and concepts within DOLCE through a reification pattern, allowing in this way to introduce them as particulars into the domain of discourse.
null
[ 110, 442, 882, 487 ]
1
null
null
null
null
null
null
text
In 2009, DOLCE-CORE was introduced in Borgo and Masolo (2009). The main purpose behind this work was that of simplifying the whole system, making it more usable in applications, and at the same time acceptable under different philosophical stands. Such simplification was also intended to facilitate the task of further extending the ontology. In particular, some of the changes introduced by DOLCE-CORE are: the adoption of the notion of concept as an ontology category, a better explanation on how to distinguish and formalize properties, the formalization of the notion of resemblance to facilitate the use of qualities, and the possibility of having more quality spaces associated to the same quality. Further changes include the definition of different parthood relations depending on ontological categories, the introduction of a notion of time regularity, and a simplification concerning the most basic categories, which in DOLCE were called 'endurant' and 'perdurant' and which become 'object' and 'event' in DOLCE-CORE and can be distinguished based on whether they have space or time as main dimension, respectively.
null
[ 110, 488, 882, 673 ]
1
null
null
null
null
null
null
text
Leaving aside these theoretical studies, DOLCE has remained fixed over the years fulfilling the purpose of top-level ontologies to provide a solid and stable basis for modeling different domains, in this way ensuring interoperability of reference and domain ontologies that use DOLCE. Through the years, DOLCE has been enriched with modules to extend and specialize it. These modules facilitate the application and coherent use of the ontology. Some extensions tackle knowledge representation's specific issues, like the modeling of roles by Masolo et al. (2004), of artifacts by Vieu et al. (2008) and by Borgo et al. (2014), and of modules by Ferrario and Porello (2015). Others showed a possible integration with machine learning and in particular computer vision (Conigliaro et al., 2017). Extensions to the modeling of social
null
[ 110, 674, 882, 797 ]
1
null
null
null
null
null
null
page_number
2
null
[ 115, 124, 126, 135 ]
1
null
null
null
null
null
null
header
S. Borgo et al. / DOLCE
null
[ 421, 124, 574, 136 ]
1
null
null
null
null
null
null
page_footnote
<sup>3</sup>Given the emphasis on formal expressivity, recall that foundational ontologies are not directly used for applications; rather, they provide conceptual handles to solve cases of misunderstandings due to the limitations of expressiveness of the application languages.
null
[ 112, 810, 882, 850 ]
1
null
null
null
null
null
null
text
(Bottazzi and Ferrario, 2009; Porello et al., 2013, 2014a) and cognitive aspects (Ferrario and Oltramari, 2004; Biccheri et al., 2020) have also been proposed. Today DOLCE is becoming part of the ISO 21838 standard, under development, and is available also in CLIF, a syntax of Common Logic ISO 24707 (2018).<sup>4</sup>
null
[ 112, 151, 880, 211 ]
2
null
null
null
null
null
null
text
The remaining of the paper is organized as follows: section 1 introduces the most fundamental categories and relations of DOLCE, which are axiomatized in section 2. With the aim of enhancing understanding, section 3 shows the application of DOLCE's axioms to five modeling examples. Before looking at the structure of the ontology, we shall spend some words on its history.
null
[ 112, 219, 880, 280 ]
2
null
null
null
null
null
null
text
1. Principles and structure of DOLCE
1
[ 114, 306, 418, 321 ]
2
null
null
null
null
null
null
text
As depicted in the taxonomy in Figure 1, the basic categories of DOLCE are endurant (aka continuant), perdurant (occurrent), quality, and abstract.
null
[ 112, 332, 880, 363 ]
2
null
null
null
null
null
null
image
null
null
[ 127, 378, 868, 596 ]
2
null
null
null
null
null
null
text
I. Continuant vs. occurrent.. The distinction between endurants and perdurants is inspired by the philosophical debate about change in time. In particular, while endurants may acquire and lose properties and parts through time, perdurants are fixed in time. Their fundamental difference concerns therefore their presence in time: endurants are wholly present (i.e., with all their parts) at any time in which they are present; differently, perdurants can be partially present, so that at any time in which they unfold only a part of them is present. Examples of endurants are a table, a person, a cat, or a planet, while examples of perdurants are a tennis match, a conference talk or a manufacturing process producing a certain item.
null
[ 112, 640, 880, 747 ]
2
null
null
null
null
null
null
text
The relation connecting endurants and perdurants is called participation. An endurant can be in time by participating in a perdurant, and perdurants happen in time by having endurants as participants. For instance, a person is in time by participating to her own life, and a conference talk happens if at least one presenter (or attendant) participates to it.
null
[ 112, 749, 880, 809 ]
2
null
null
null
null
null
null
header
S. Borgo et al. / DOLCE
null
[ 421, 124, 574, 136 ]
2
null
null
null
null
null
null
page_number
3
null
[ 870, 124, 880, 135 ]
2
null
null
null
null
null
null
page_footnote
$^{4}$ DOLCE in CLIF, OWL etc. can be found at http://www.loa.istic.cnr.it/index.php/dolce/ together with additional papers and materials.
null
[ 112, 821, 880, 848 ]
2
null
null
null
null
null
null
text
II. Independent vs. dependent entity.. This distinction is found across the entire taxonomy of DOLCE. For instance, features (e.g., edges, holes, bumps, etc.) are endurants whose existence depends on some physical object (the feature bearer), while physical objects are independent entities, i.e., their existence does not require other endurants to exist. Note that if we take a notion of cross-categorical dependence, only abstract entities turn out to be independent in DOLCE. For instance, since a physical object necessarily participates in an event (namely, its life), every physical object requires the existence of at least one event (and vice versa).
null
[ 110, 151, 882, 261 ]
3
null
null
null
null
null
null
text
III. Processes vs. events.. In DOLCE processes and events are special types of perdurants. As it can be seen from Figure 1, DOLCE covers various classes of perdurant following taxonomic distinctions found in both philosophy and linguistics. In particular, a perdurant(-type) is stative or eventive according to whether it holds of the mereological sum of two of its instances, i.e. if it is cumulative or not. Common examples of stative perdurants are states; e.g., a sitting state is stative because the sum of two sittings is still a sitting. Among stative perdurants, processes are cumulative but not homeomeric, namely, they have parts of different types; e.g., there are (even very short) temporal parts of a running that are not themselves runnings. Finally, eventive occurrences (events) are not cumulative, and they are called achievements if they are atomic, otherwise they are accomplishments.[5]
null
[ 110, 267, 884, 407 ]
3
null
null
null
null
null
null
text
IV. Properties, qualities, quantities... DOLCE covers these entities through the general notion of quality.<sup>6</sup> Qualities are, roughly speaking, what can be perceived and measured; they are particulars inhering in endurants or perdurants. For example, when we talk about the red of a rose, we are talking about a particular quality (that specific red) which inheres in a particular endurant (that specific rose). See also Section 3.3.1. Qualities are therefore specific to their bearers (this is why they are called individual qualities in DOLCE), and they are present at each time in which their bearers are present. Depending on the entities in which they inhere (qualities are dependent entities indeed), DOLCE identifies qualities of different types, namely, physical, temporal or abstract qualities. Moreover, since complex qualities can have qualities themselves, DOLCE includes a notion of direct quality to distinguish qualities of endurants, perdurants and abstracts, from qualities of qualities.
null
[ 110, 412, 882, 568 ]
3
null
null
null
null
null
null
text
To compare qualities of the same kind, e.g., the color of a rose and the color of a book cover, the category of quale is introduced. A quale is the position occupied by an individual quality within a quality space.<sup>7</sup> In our example, if the rose and the book cover exhibit the same shade of red, their individual colors occupy the same position (quale) in the color space. Hence, the two qualities are distinct but they have the same quale (within the same color space).
null
[ 110, 568, 882, 644 ]
3
null
null
null
null
null
null
text
V. Function and Role.. DOLCE does not formalize functions and roles, although these have been widely investigated and represented in DOLCE-driven approaches (Borgo et al., 2010; Masolo et al., 2004). Roles are represented as (social) concepts, which are connected to other entities (like endurants, perdurants, and abstracts) by the relation of classification. In particular, roles are concepts that are anti-rigid and founded, meaning that (i) they have dynamic properties<sup>8</sup> and (ii) they have a relational nature, i.e. they depend on other roles and on contexts.
null
[ 110, 651, 882, 744 ]
3
null
null
null
null
null
null
page_number
4
null
[ 115, 124, 127, 135 ]
3
null
null
null
null
null
null
header
S. Borgo et al. / DOLCE
null
[ 421, 124, 574, 136 ]
3
null
null
null
null
null
null
page_footnote
<sup>5</sup>As said in the Introduction, endurants are called 'objects', and perdurants 'events' in DOLCE-CORE. This terminological difference is due to changes in the formalization of the ontology even though the two systems largely overlap.
null
[ 112, 758, 882, 783 ]
3
null
null
null
null
null
null
page_footnote
Recall that 'property' is generally used in analytic metaphysics as something which can be instantiated. We treat property here in a more restricted sense; informally, as synonym of 'characteristic' or 'attribute'.
null
[ 112, 784, 880, 808 ]
3
null
null
null
null
null
null
page_footnote
7Quality spaces in DOLCE are based on Gärdenfors' conceptual spaces (Gärdenfors, 2000).
null
[ 129, 809, 682, 822 ]
3
null
null
null
null
null
null
page_footnote
For instance, each role can be played by different entities at the same or at different times, the same entity can play a role at different times or discontinuously, or it can play different roles at the same or at different times.
null
[ 112, 822, 882, 848 ]
3
null
null
null
null
null
null
text
VI. Relations.. An important relation in DOLCE is parthood, which is time-indexed when connecting endurants and a-temporal when holding between perdurants or abstracts, i.e. between entities that do not change in time. Constitution is another temporalized relation in DOLCE, holding between either endurants or perdurants. It is often used to single out entities that are spatio-temporally co-located but nonetheless distinguishable for their histories, persistence conditions, or relational properties. A typical example of constitution is the relation between a statue and the amount of matter it is built with. The former started to exist at a later moment with respect to the latter; the latter can survive the destruction of the former and only for the former the existence of a sculptor is a necessary condition of existence.
null
[ 110, 151, 884, 275 ]
4
null
null
null
null
null
null
text
The last basic category of the ontology is that of abstracts. These are entities that have neither spatial nor temporal qualities and are not qualities themselves. We will not deal with them in the current paper, so it should suffice to give a few examples: quality regions (and therefore also quality spaces), sets, and facts. Also, although DOLCE has other important categories and relations, in the present paper we will focus especially on those just presented, as they will be discussed in the following in the light of their axiomatization and used for the formalization of the cases in Section 3.
null
[ 110, 281, 884, 375 ]
4
null
null
null
null
null
null
text
2. The formalization of DOLCE in First-Order Logic
1
[ 112, 401, 532, 419 ]
4
null
null
null
null
null
null
text
The formal theory of DOLCE is written in the first-order quantified modal logic QS5, including the Barcan and the converse Barcan formula, cf. (Fitting and Mendelsohn, 2012). These assumptions entail a possibilistic view of the entities: the domain of quantification contains all possible entities, regardless of their actual existence.
null
[ 110, 432, 882, 494 ]
4
null
null
null
null
null
null
text
Here we present an excerpt of the axiomatization, focusing on the axioms required for the subsequent examples, that provides a general view of the DOLCE approach. An exhaustive presentation of DOLCE was given by Masolo et al. (2003) and a proof of consistency was provided by Kutz and Mossakowski (2011). In the following paragraphs, next to each axiom and definition we report the label of that formula in the primary presentation, cf. (Masolo et al., 2003). DOLCE is here extended to include the category of Concepts (C) and Roles (RL) and the relation of classification (CF), as we shall see below; their formalization is taken from (Masolo et al., 2004).
null
[ 110, 494, 882, 602 ]
4
null
null
null
null
null
null
text
2.1. Taxonomy
1
[ 112, 615, 231, 631 ]
4
null
null
null
null
null
null
text
As said, the taxonomy of DOLCE is shown in Figure 1. We omit in the following the taxonomic axioms which can be found in (Masolo et al., 2003). With respect to the original version, we include in this paper the categories Concept and Role as specializations of Non-Agentive Social Object, and the category Artefact as specialization of Non-Agentive Physical Object. These will be used in the formalization of the examples.
null
[ 110, 645, 882, 724 ]
4
null
null
null
null
null
null
text
2.2. Mereology
1
[ 112, 736, 236, 753 ]
4
null
null
null
null
null
null
text
DOLCE assumes two primitive parthood relations: atemporal $(\mathsf{P}(x,y)$ for $x$ is part of $y$ ) and time-dependent $(\mathsf{P}(x,y,t)$ for $x$ is part of $y$ at time $t$ ) parthood. The same predicate symbol $\mathsf{P}$ is used for
null
[ 110, 766, 882, 797 ]
4
null
null
null
null
null
null
header
S. Borgo et al. / DOLCE
null
[ 421, 124, 574, 136 ]
4
null
null
null
null
null
null
page_number
5
null
[ 870, 124, 880, 135 ]
4
null
null
null
null
null
null
page_footnote
<sup>9</sup>A CLIF version of DOLCE plus the theory of concepts and roles from (Masolo et al., 2004) is formalized and proved consistent by means of Mace4. The theory the proof of consistency and further material can be downloaded at http://www.loa.istc.cnr.it/index.php/dolce/
null
[ 110, 810, 882, 850 ]
4
null
null
null
null
null
null
text
both relations. The first follows the principles of the General Extensional Mereology (GEM), whereas temporary parthood drops the antisymmetry axioms, cf. (Masolo et al., 2003, p.33).
null
[ 112, 151, 880, 181 ]
5
null
null
null
null
null
null
text
Here we give some axioms and definitions relative to temporary parthood, which we will use in Section 3.1 (in the rest of this section $\mathrm{Ddn}$ and $\mathrm{Adn}$ are the labels of definitions and axioms, respectively, used in (Masolo et al., 2003)). In the formulas, $\mathsf{PRE}(x,t)$ reads $x$ is present at time $t$ ; $\mathsf{PP}(x,y,t)$ reads $x$ is a proper part of $y$ at $t$ ; and $\mathsf{O}(x,y,t)$ reads $x$ and $y$ overlap at time $t$ . The expression $x +_{te} y$ reads 'the temporary sum of $x$ and $y$ , and $\sigma_{te} x \phi(x)$ reads 'the temporary fusion of each $x$ that satisfies $\phi$ . After the formulas we give a description in natural language.
null
[ 112, 183, 884, 274 ]
5
null
null
null
null
null
null
list
null
null
[ 122, 282, 880, 397 ]
5
null
null
null
null
null
null
text
Axiom (a1) states that temporary parthood holds only between two endurants at some time, axiom (a2) states that to have a parthood relationship both the part and the whole must be present, while (d1) states that a proper part is any part which does not contain the whole itself. (d2) defines overlap as a relation that holds on a pair of entities at the time when they have a common part. Using overlap, one can define binary and unrestricted sums, see cf. (d3) and (d4). These definitions characterize new entities: the sum of two entities and the fusion (sum of possibly infinite entities) of all the entities that satisfy a given formula $\phi$ , where $\phi$ does not contain time variables. Finally, note that in DOLCE sum (fusion) is defined also on events and on abstracts, thus including the sum (fusion) of times. We do not report these latter definitions since they are standard (cf. Dd18 and Dd19). We use the same notation $(+)$ and $(\sigma)$ for sum and fusion with or without the temporal parameter depending on the entities to which it applies.
null
[ 112, 404, 884, 558 ]
5
null
null
null
null
null
null
text
2.3. Quality and quale
1
[ 112, 571, 290, 586 ]
5
null
null
null
null
null
null
text
The relation being a quality of (qt) is primitive in DOLCE. Its full characterization is in (Masolo et al., 2003, p.35). To be able to say that $x$ is a quality of $y$ of type $\phi$ we extend it relatively to a type as follows:
null
[ 112, 599, 882, 644 ]
5
null
null
null
null
null
null
text
d5 $\mathfrak{q}\mathfrak{t}(\phi ,x,y)\stackrel {def}{=}\mathfrak{q}\mathfrak{t}(x,y)\wedge \phi (x)\wedge \mathsf{SBL}_X(Q,\phi)$ (Quality of type $\phi$ ,cf.Dd29)
null
[ 122, 650, 880, 671 ]
5
null
null
null
null
null
null
text
where $\mathsf{SBL}_X(Q,\phi)$ is an abbreviation for the statement that $\phi$ is a leaf in the DOLCE hierarchy of qualities (i.e. it is a minimal category in the quality branch of Fig.1, cf. (Masolo et al., 2003, p.27)).
null
[ 112, 677, 880, 708 ]
5
null
null
null
null
null
null
text
Then, DOLCE defines the temporal quaile (relation qI), i.e., the position occupied by an individual quality within a quality space, as follows (recall that TL is the temporal location category, see Fig.1):
null
[ 112, 709, 880, 739 ]
5
null
null
null
null
null
null
list
null
null
[ 122, 747, 880, 810 ]
5
null
null
null
null
null
null
text
From (d6) the temporal quale of a perdurant is the quale associated to the time location quality (TL) of the perdurant, and from (d7) the temporal quale of an endurant is the sum of all the times during which
null
[ 112, 818, 882, 850 ]
5
null
null
null
null
null
null
page_number
6
null
[ 115, 124, 127, 135 ]
5
null
null
null
null
null
null
header
S. Borgo et al. / DOLCE
null
[ 421, 124, 574, 136 ]
5
null
null
null
null
null
null
text
the endurant participates (PC) to some perdurant. (The participation relation is formally introduced below.) The temporal quale of a quality $(\mathsf{q}|_{T,Q})$ is defined in a similar way (Masolo et al., 2003, p.28). Finally, the temporal quale of an entity is given by the collection of all the previous definitions, (d8).
null
[ 112, 151, 880, 198 ]
6
null
null
null
null
null
null
text
Qualities are classified in DOLCE as physical, temporal, and abstract qualities as stated below where the formulas add that a quality inheres in one and only one entity $(\mathfrak{qt}(x,y)$ reads $x$ is a quality of $y$
null
[ 112, 199, 880, 231 ]
6
null
null
null
null
null
null
list
null
null
[ 119, 237, 882, 291 ]
6
null
null
null
null
null
null
text
2.4. Time and existence
1
[ 114, 307, 295, 321 ]
6
null
null
null
null
null
null
text
Actual existence in DOLCE is represented by means of the being present at (PRE) relation. The assumption here is that things exist if they have a temporal quale.
null
[ 112, 340, 880, 372 ]
6
null
null
null
null
null
null
text
d9 $\mathsf{PRE}(x,t)\stackrel {\mathsf{def}}{=}\exists t^{\prime}(\mathsf{ql}_{T}(t^{\prime},x)\wedge \mathsf{P}(t,t^{\prime}))$ (Being Present at $t$ , cf. Dd40)
null
[ 119, 379, 882, 401 ]
6
null
null
null
null
null
null
text
Further properties of PRE are described in (Masolo et al., 2003), Section 4.3.8.
null
[ 129, 407, 717, 422 ]
6
null
null
null
null
null
null
text
2.5. Participation
1
[ 114, 441, 253, 455 ]
6
null
null
null
null
null
null
text
The participation (PC) relation connects endurants, perdurants, and times, i.e. endurants participate in perdurants at a certain time (a6). Here we write $\mathsf{PC}(x,y,t)$ for $x$ participates in $y$ at time $t$ . (a7) states that a perdant has at least one participant and (a8) that an endurant participates in at least one perdurant. Axiom (a9) says that for an endurant to participate in a perdurant they must be present at the same time. We also introduce the relation of constant participation $(\mathsf{PC}_{\mathbb{C}})$ , cf. (d10), i.e., participation during the whole perdurant, which we will use in sections 3.4 and 3.5.
null
[ 112, 474, 882, 569 ]
6
null
null
null
null
null
null
list
null
null
[ 119, 576, 882, 646 ]
6
null
null
null
null
null
null
text
a10 $\mathsf{PC}_{\mathbb{C}}(x,y)\stackrel {\text{def}}{=}\exists t(\mathsf{PRE}(y,t))\wedge \forall t(\mathsf{PRE}(y,t)\to \mathsf{PC}(x,y,t))$ (Const. Participation, cf. Dd63)
null
[ 112, 648, 880, 669 ]
6
null
null
null
null
null
null
text
2.6. Constitution
1
[ 114, 686, 247, 699 ]
6
null
null
null
null
null
null
text
The constitution relation $\mathsf{K}$ is mainly used here to model the scenario in Section 3.1. We report only a few axioms required to model the scenario $(\mathsf{K}(x, y, t)$ reads ' $x$ constitutes $y$ at time $t$ ).
null
[ 112, 718, 880, 750 ]
6
null
null
null
null
null
null
list
null
null
[ 112, 757, 880, 810 ]
6
null
null
null
null
null
null
text
(a11) states that $\kappa$ applies to pairs of endurants or of perdurants and a time. (a12) states that only physical endurants can constitute another physical endurant. (a13) states that constitution is asymmetric.
null
[ 112, 816, 880, 848 ]
6
null
null
null
null
null
null
header
S. Borgo et al. / DOLCE
null
[ 421, 124, 574, 136 ]
6
null
null
null
null
null
null
page_number
7
null
[ 870, 124, 880, 135 ]
6
null
null
null
null
null
null
text
2.7. Concepts, roles, and classification
1
[ 112, 151, 410, 167 ]
7
null
null
null
null
null
null
text
As anticipated, the relation of classification (CF) is not in (Masolo et al., 2003) as it applies to the category Concept (C), and to its subcategories including Role (RL), which informally collects particulars that classify, as introduced in (Masolo et al., 2004). We thus take the following axioms from the latter work $(\mathsf{CF}(x,y,t)$ stands for 'at the time $t$ $x$ is classified by the concept $y$ ):
null
[ 110, 181, 884, 244 ]
7
null
null
null
null
null
null
list
null
null
[ 112, 250, 882, 360 ]
7
null
null
null
null
null
null
text
The classification relationship CF applies to an endurant, a concept and a time (a14), requires the endurant to be present when it is classified (a15), and is not symmetrical (a16). A concept can classify other concepts but not what the latter classify, this is stated to avoid circularity (a17). Roles (RL) are defined as concepts that are anti-rigid (d10) and founded (d11). Informally, the foundation property (FD) holds for a concept that is defined by means of another concept such that the instances of the latter are all external to (not part of) the instances of the former (Masolo et al., 2004).
null
[ 110, 367, 882, 461 ]
7
null
null
null
null
null
null
text
3. Analysis and formalization in DOLCE: examples
1
[ 112, 488, 519, 505 ]
7
null
null
null
null
null
null
text
We present in the following sections how to formalize the five given cases according to DOLCE. Since to model some cases it is helpful to use a temporal ordering relation and since DOLCE does not formalize any, we introduce one here as follows: $\prec$ is an ordering relation over atomic and convex regions of time (usually, these are understood as time instants and time intervals) such that if $t_1 < t_2$ holds, then $t_1$ and $t_2$ are ordered and non-overlapping, i.e., $\neg \mathsf{O}(t_1, t_2)$ . We write $t_1 \leqslant t_2$ to mean that $t_1$ and $t_2$ are ordered, may properly overlap (i.e., they overlap but none is completely included in the other), and, given $t$ their overlapping region, then $t_1 - t < t_2 - t$ holds.
null
[ 110, 519, 882, 627 ]
7
null
null
null
null
null
null
text
3.1. Case 1: Composition/Constitution
1
[ 112, 640, 418, 657 ]
7
null
null
null
null
null
null
text
"There is a four-legged table made of wood. Some time later, a leg of the table is replaced. Even later, the table is demolished so it ceases to exist although the wood is still there after the demolition."
null
[ 196, 668, 823, 714 ]
7
null
null
null
null
null
null
text
DOLCE provides two ways to model this and similar examples. The first option, which we call artifact-based and we follow here, considers entities like tables and legs as ontological entities on their own because of their artifactual status, namely, the fact that tables and the legs are intentionally produced products. The second option, called role-based, considers table and leg as roles of objects. In this view, indeed, some objects play the role of table and leg in a given context but not necessarily. We do not
null
[ 110, 731, 882, 809 ]
7
null
null
null
null
null
null
page_number
8
null
[ 115, 124, 127, 135 ]
7
null
null
null
null
null
null
header
S. Borgo et al. / DOLCE
null
[ 421, 124, 574, 136 ]
7
null
null
null
null
null
null
page_footnote
<sup>10</sup>Note that Masolo et al. (2004) apply classification only to endurants, though the possibility of applying it also to perdurants and abstracts was mentioned. Here we allow concepts to classify also perdurants as done in Section 3.4
null
[ 112, 821, 882, 848 ]
7
null
null
null
null
null
null
End of preview.

No dataset card yet

Downloads last month
16