Making Basic Ontological Assumptions: The DOLCE Experience
Nicola Guarino Laboratory for Applied Ontology Institute for Cognitive Sciences and Technology, National Research Council Trento, Italy
Thanks to all LOA people!
www.loa-cnr.it
The DOLCE Experience Nicola Guarino Laboratory for Applied Ontology - - PowerPoint PPT Presentation
Making Basic Ontological Assumptions: The DOLCE Experience Nicola Guarino Laboratory for Applied Ontology Institute for Cognitive Sciences and Technology, National Research Council Trento, Italy Thanks to all LOA people! www.loa-cnr.it
Nicola Guarino Laboratory for Applied Ontology Institute for Cognitive Sciences and Technology, National Research Council Trento, Italy
Thanks to all LOA people!
www.loa-cnr.it
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 2
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 3
“Trying to engage with too many partners too fast is one of the main reasons that so many online market makers have foundered. The transactions they had viewed as simple and routine actually involved many
subtle distinctions in terminology and meaning”
Harvard Business Review, October 2001
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 4
how many events? …only ontological analysis solves these problems!!
(relevant invariants across situations: D, ℜ)
Intended models IK(L)
State of affairs State of affairs Situations
Ontological commitment K Tarskian interpretation I Ontology models IK(L) Models MD(L)
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 6
Low precision, max coverage
Low precision, limited coverage
High precision, max coverage
Max precision, limited coverage
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 7
Area
agreement!
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 8
is important
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 9
different roles of ontologies
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 10
positioned with respect to the space of possible choices, reflecting different commitments and purposes
approaches
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 11
(the library of formal ontologies)
Top Bank Law 4D 3D Single Vision Single Module Formal Links Between Visions & Modules
Space of
choices Space of application areas
Mappings with Lexicons
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 12
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 13
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 14
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 15
Part, Constitution, and Identity
K D
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 16
a) repeatable universals, belonging to different entities b) non-repeatable tropes, inhering only in a specific entity”
a) Aggregations (bundles) of properties b) Properties inhering to some substrate (bare particular)
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 17
localized?
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 19
a Descriptive Ontology for Linguistic and Cognitive Engineering
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 20
Endurant Physical Amount of matter Physical object Feature Non-Physical Mental object Social object … Perdurant Static State Process Dynamic Achievement Accomplishment Quality Physical Spatial location … Temporal Temporal location … Abstract Abstract Quality region Time region Space region Color region … …
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 21
Q Quality PQ Physical Quality AQ Abstract Quality TQ Temporal Quality PD Perdurant EV Event STV Stative ACH Achievement ACC Accomplishment ST State PRO Process PT Particular R Region PR Physical Region AR Abstract Region TR Temporal Region T Time Interval S Space Region AB Abstract Set Fact … … … … TL Temporal Location SL Spatial Location … … … ASO Agentive Social Object NASO Non-agentive Social Object SC Society MOB Mental Object SOB Social Object F Feature POB Physical Object NPOB Non-physical Object PED Physical Endurant NPED Non-physical Endurant ED Endurant SAG Social Agent APO Agentive Physical Object NAPO Non-agentive Physical Object … AS Arbitrary Sum M Amount of Matter … … … …
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 22
events)
"values" (qualia) that qualities (of that kind) can assume. Quality Spaces are neither in time nor in space.
constitution is considered.
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 23
no temporal parts)
presence,temporal parts)
(1)
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 24
electric charge…)
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 25
and morphological wholes emerge
belonging to different situations
belonging to different situations
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 26
and the multiplicative choice
substitutivity tests :
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 27
inhere to it and are unique of it
spaces.
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 28
The rose and the chair have the same color:
Therefore, the same color attribute (red) is ascribed to the two
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 29
Color of rose1 Red421 Rose1
Inheres Has-quale
Rose Color Color-space Red-obj Quality Red-region
Has-part Has-part
Quality attribution Quality space
q-location
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 30
… or places
no features.
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 31
exemplifications) ☛ Not located in space-time (no inherent spatial or temporal location)
sets are abstract...
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 32
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 34
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 35
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 36
Quale: “x is the quale of y (during t)”
ql(x, y) → (TR(x) ∧ TQ(y)) ql(x, y, t) → ((PR(x) ∨ AR(x)) ∧ (PQ(y) ∨ AQ(y)) ∧ T(t))
Quality: “x is a quality of y”
qt(x, y) → (Q(x) ∧ (Q(y) ∨ ED(y) ∨ PD(y)))
Participation: “x participates in y during t”
PC(x, y, t) → (ED(x) ∨ PD(y) ∧ T(t))
Constitution: “x constitutes y during t”
K(x, y, t) → ((ED(x) ∨ PD(x)) ∧ (ED(y) ∨ PD(y)) ∧ T(t))
Temporary Parthood: “x is part of y during t”
P(x, y, t) → (ED(x) ∧ ED(y) ∧ T(t))
Parthood: “x is part of y”
P(x, y) → (AB(x) ∨ PD(x)) ∧ (AB(y) ∨ PD(y))
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 37
(D1) SD(x, y) = df ο(∃t(PR(x, t)) ∧ ∀t(PR(x, t) → PR(y, t))) (Specific Const. Dep.) (D2) SD(φ, ψ) = df DJ(φ, ψ) ∧ ο∀x(φ(x) → ∃y(ψ(y) ∧ SD(x, y))) (Specific Const. Dep.) (D3) GD(φ, ψ) =df DJ(φ, ψ) ∧ ο(∀x(φ(x) → ∃t(PR(x, t)) ∧ ∀x,t((φ(x) ∧ At(t) ∧ PR(x, t)) → ∃y(ψ(y) ∧ PR(y, t)))) (Generic Const. Dep.) (D4) D(φ, ψ) = df SD(φ, ψ) ∨ GD(φ, ψ)) (Constant Dependence) (D5) OD(φ, ψ) =df D(φ, ψ) ∧ ¬D(ψ, φ) (One-sided Constant Dependence) (D6) OSD(φ, ψ) =df SD(φ, ψ) ∧ ¬D(ψ, φ) (One-sided Specific Constant Dependence) (D7) OGD(φ, ψ) =df GD(φ, ψ) ∧ ¬D(ψ, φ) (One-sided Generic Constant Dependence) (D8) MSD(φ, ψ) =df SD(φ, ψ) ∧ SD(ψ, φ) (Mutual Specific Constant Dependence) (D9) MGD(φ, ψ) =df GD(φ, ψ) ∧ GD(ψ, φ) (Mutual Generic Constant Dependence)
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 38
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 39
Primitive relations and basic categories
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 40
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 41
produce analytic definitions
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 43
(mainly by Aldo Gangemi @LOA-RM)
description and negotiation
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 44
(Aldo Gangemi, Alessandro Oltramari, Massimiliano Ciaramita)
emotion, psychological feature)
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 45
1. Populate a general ontology (DOLCE) by adding single synsets (or whole taxonomy branches) from a c. lexicon (upon suitable classification) 2. Restructure a c. lexicon by checking ontological constraints (e.g. OntoClean meta-properties) throughout the branches 3. Merge an ontology and a c. lexicon (includes 1. and 2.) 4. Enrich the resulting structure by extracting relationships from the glosses.
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 46
the Semantic Web)
electronic commerce (LOA: SIG on Content Standards)
units
(LOA: ontology of social interaction)
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 47
…Is this hard?
(Why should it be easy??)
Nicola Guarino ISTC-CNR Mark Musen Stanford University
Amsterdam, Berlin, Washington, Tokyo, Beijing www.applied-ontology-org
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 49
FOIS-2006 International Conference on Formal Ontology in Information Systems
November 9-11, 2006 Baltimore, Maryland (USA)
http://www.formalontology.org/
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 52
relation that binds together all the parts of x, such that P(y,x) → (P(z,x) ↔ ω(y,z)) but not ω(y,z) ↔ ∃x(P(y,x) ∧ P(z,x))
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 53
* a whole can have parts that are themselves wholes (with a different ω)
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 54
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 55
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 56
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 57
OntoLog Telecon, Feb 2, 2006 www.loa-cnr.it 58
harmonizing of existing clinical guidelines standards
execution as configuration
“approved” vs. “started”)
communication