From Layered Mereotopology to Dynamic Spatial Ontology Maureen Donnelly and Barry Smith Department of Philosophy, University at Buffalo and Institute for.

Slides:



Advertisements
Similar presentations
Towards a Naive Geography Pat Hayes & Geoff Laforte IHMC University of West Florida.
Advertisements

Laws, Dispositions and Properties A Discussion of Bird's "Nature's Metaphysics" Gerhard Schurz (University of Duesseldorf)
Equivalence Relations
Anatomical boundaries and immaterial objects Stefan Schulz Department of Medical Informatics University Hospital Freiburg (Germany)
Applied Discrete Mathematics Week 11: Graphs
Induction and recursion
Logic and Set Theory.
1 SNAP and SPAN Barry Smith. 2 Two categories of entities Substances and processes Continuants and occurrents In preparing an inventory of reality we.
Chapter 4 Probability.
1 SNAP and SPAN Barry Smith and Pierre Grenon University at Buffalo and ifomis.de University of Leipzig.
Constituent ontologies and granular partitions Thomas Bittner and Barry Smith IFOMIS – Leipzig and Department of Philosophy, SUNY Buffalo.
Part 2 Tools of Ontology: Mereology, Topology, Dependence.
From Layered Mereotopology to Dynamic Spatial Ontology Maureen Donnelly and Barry Smith Department of Philosophy, University at Buffalo and Institute for.
A taxonomy of granular partitions Thomas Bittner and Barry Smith Northwestern University, NCGIA and SUNY Buffalo.
VT. From Basic Formal Ontology to Medicine Barry Smith and Anand Kumar.
BFO/MedO: Basic Formal Ontology and Medical Ontology Draft ( )
Theory and Applications
1 VT 2 Ontology and Ontologies Barry Smith 3 IFOMIS Strategy get real ontology right first and then investigate ways in which this real ontology can.
GOL A General Ontological Language Barry Smith Heinrich Herre Barbara Heller.
1 SNAP and SPAN Barry Smith and Pierre Grenon University at Buffalo and Institute for Formal Ontology and Medical Information Science (ifomis.de) University.
A taxonomy of granular partitions Thomas Bittner and Barry Smith Northwestern University, NCGIA and SUNY Buffalo.
The Logic of Biological Classification Barry Smith March 2004.
A Formal Theory for Spatial Representation and Reasoning in Biomedical Ontologies Maureen Donnelly Thomas Bittner.
Constituent ontologies and granular partitions Thomas Bittner and Barry Smith IFOMIS – Leipzig and Department of Philosophy, SUNY Buffalo.
Relations are Not Sets of Ordered Pairs Ingvar Johansson, Institute for Formal Ontology and Medical Information Science, Saarbrücken
From Knowledge Representation to Reality Representation Barry Smith.
Chapter 4: A Universal Program 1. Coding programs Example : For our programs P we have variables that are arranged in a certain order: Y 1 X 1 Z 1 X 2.
Relations Chapter 9.
1 Summer school “Physics and Philosophy of Time”, Saig, Quantum non-locality and the philosophy of time Michael Esfeld Université de Lausanne
Induction and recursion
Standardization of Anatomy Parts and Wholes – From Function to Location Stefan Schulz Department of Medical Informatics University Hospital Freiburg (Germany)
 Let A and B be any sets A binary relation R from A to B is a subset of AxB Given an ordered pair (x, y), x is related to y by R iff (x, y) is in R. This.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
Basic Concepts of Discrete Probability (Theory of Sets: Continuation) 1.
1 2. Independence and Bernoulli Trials Independence: Events A and B are independent if It is easy to show that A, B independent implies are all independent.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Chapter 4 Probability ©. Sample Space sample space.S The possible outcomes of a random experiment are called the basic outcomes, and the set of all basic.
Sets Define sets in 2 ways  Enumeration  Set comprehension (predicate on membership), e.g., {n | n  N   k  k  N  n = 10  k  0  n  50} the set.
A Brief Introduction to Set Theory. How Many Things?
Software testing techniques Spring 2009 Csci565: Theory and Practice of Software Testing1.
Copyright © Cengage Learning. All rights reserved.
A Logic of Partially Satisfied Constraints Nic Wilson Cork Constraint Computation Centre Computer Science, UCC.
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Equivalence Relations. Partial Ordering Relations 1.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Mereotopology. The formal theory for parthood and connection relations is called mereotopology Mereotopology, built on mereology and some elements of.
1 Section 8.3 Higher-Order Logic A logic is higher-order if it allows predicate names or function names to be quantified or to be arguments of a predicate.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and B = {a,b} {( 0, a), (
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
1 The Relational Data Model David J. Stucki. Relational Model Concepts 2 Fundamental concept: the relation  The Relational Model represents an entire.
English for Economic Informatics I Tomáš Foltýnek Theoretical Foundations of Informatics.
New York State Center of Excellence in Bioinformatics & Life Sciences R T U Discovery Seminar /UE 141 MMM – Spring 2008 Solving Crimes using Referent.
BFO 2.0 Modularization and Verification
Theory of Computation Lecture 10: A Universal Program I
Lecture 10 Persistence: endurance and perdurance
Department of Geography Jeon-Young Kang · Yi Yang
Discovery Seminar UE141 PP– Spring 2009 Solving Crimes using Referent Tracking Entities and their relationships - How the homework should have been.
CS 9633 Machine Learning Concept Learning
What is Probability? Quantification of uncertainty.
7/3/2018 EMR 17 Logical Reasoning Lecture 11.
Complex Variables. Complex Variables Open Disks or Neighborhoods Definition. The set of all points z which satisfy the inequality |z – z0|
Chapter 2 Sets and Functions.
David Lewis’s Response To Parfit
Formal Theories for Reasoning about Parthood, Connection, and Location
Standardization of Anatomy Parts and Wholes – From Function to Location Stefan Schulz Department of Medical Informatics University Hospital Freiburg (Germany)
Standardization of Anatomy Parts and Wholes – From Function to Location Stefan Schulz Department of Medical Informatics University Hospital Freiburg (Germany)
Presentation transcript:

From Layered Mereotopology to Dynamic Spatial Ontology Maureen Donnelly and Barry Smith Department of Philosophy, University at Buffalo and Institute for Formal Ontology and Medical Information Science, University of Leipzig

Two entities coincide when they occupy overlapping regions All entities coincide exactly with themselves All pairs of overlapping entities coincide: my hand coincides with my body the European Union coincides with the British Commonwealth (United Kingdom … Malta, Cyprus)

Some entities coincide even though they share no parts any material object coincides with its spatial region a portion of food coincides with my stomach cavity

Holes may coincide with material objects The hole in the chunk of amber coincides completely with, but does not overlap, the encapsulated insect which fills it Sometimes holes and objects are moving independently (a bullet flying through a railway carriage moving through a tunnel)

Layered Ontology of Lakes L1. a region layer L2. a lake layer, consisting of a certain concave portion of the earth’s surface together with a body of water L3. a fish layer L4. a chemical contaminant layer

Layered Epidemiology Ontology L1. a two-dimensional region layer in some undisclosed location L2. a topographical layer, consisting of mountains, valleys, deserts, gullies L3. a storm-system occupying sub-regions of L2 L4: an airborne cloud of smallpox virus particles.

Motivation Each spatial domain is partioned into layers in such a way that only members of the same layer can stand in parthood and connection relations. Entities of different ontological types (regions, objects, holes... ) belong to different layers.

Layered Mereology = General Extensional Mereology (GEM) with three small modifications

Parthood (P) Parthood is a partial ordering: (P1) Pxx (reflexive) (P2) Pxy & Pyx  x = y (antisymmetric) (P3) Pxy & Pyz  Pxz (transitive) (P4) ~Pxy   z(Pzx & ~Ozy) (the remainder principle: if x is not part of y, then x has a part that does not overlap y)

Defined Mereological Relations Oxy =:  z (Pzx & Pzy) (x and y overlap) Uxy =:  z (Pxz & Pyz)(x and y underlap) No universal object. P, O and U hold only among objects on the same layer. Every object is part of its layer.

Layered Mereology (P5) (Uxy & Uyz)  Uxz (underlap is transitive) FIRST DEVIATION FROM GEM P5 implies that underlap is an equivalence relation.

Restricted Summation Principle (P6) (  x  &  x,y(  &  /y  Uxy))  z (  y (Oyz  x (  & Oyx)) For each satisfied layer-conform predicate  there is a sum of  -ers SECOND DEVIATION FROM GEM

Formal Definition of Layer x’s layer = the sum of all objects x underlaps z is x’s layer: Lxz =:  y (Oyz  w (Uwx & Owy)) y is a layer: Ly =:  x Lxy Every object has a unique layer: l(x).

Some Theorems Pxl(x) every object is part of its layer Uxy  l(x) = l(y) two objects underlap iff they have the same layer Uxy  Pyl(x) x underlaps y iff y is part of x's layer Lz  z = l(z) z is a layer iff z is its own layer

The Region Layer

layers co-located objects The region layer

The Region Function r(x) = the region at which x is exactly located. r is a new primitive THIRD DEVIATION FROM GEM r maps (collapses) entities on all higher layers onto the region layer

layers co-located objects The region layer

Axioms for the region function (R1) Ry & Rz  Uyz (all regions are located in the same layer) (R2) Ry & Uyz  r(z) = z (every member of the region layer is its own region) (R3) Pxy  Pr(x)r(y) (R4) Uxy & Or(x)r(y)  Oxy

Some Theorems Ry  r(y) = y (every region is located at itself) (  x  &  x(   Rx) &  y (Oyz  x (  & Oyx)))  Rz (every sum of regions is a region)

Layered Mereotopology Cxy means: x is connected to y

Axioms for the Connection Relation (C1) Cxx (connection is reflexive) (C2) Cxy  Cyx (connection is symmetric) (C3) Pxy   z(Czx  Czy) (if x is part of y, then everything connected to x is connected to y) (C4) Cxy  Uxy (if x and y are connected, then they are parts of the same layer) (C5) Cxy  C(r(x), r(y)) (if x and y are connected, their regions are also connected) (C6) Uxy & C(r(x), r(y))  Cxy (if x and y are members of the same layer and their regions are connected, then x and y are connected)

Defined Relations ECxy =: Cxy & ~ Oxy (x and y are externally connected) Axy =: EC(r(x), r(y)) (x and y abut)

Towards Dynamic Spatial Ontology

Objects move through space An adequate ontology of motion requires at least two independent sorts of spatial entities: 1. locations, which remain fixed, 2. objects, which move relative to them. many region-based approaches to spatial reasoning admit only the first type of entity, they simulate motion, in the manner of cartoons, via successive assignments of attributes to a fixed frame of locations.

Example sparrow 152 moves from one location (region A) to another (region B) Becomes: each member of this continuous sequence of sparrow-shaped regions, starting with A and ending with B, has at successive times, rufous- winged (etc.) attributes. Instead of talking about sparrows flying through the sky, we talk of mappings of the form: Sparrow 152 : time  regular closed subsets of R 3.

Region-based approaches have no means of distinguishing true overlap (i.e. the sharing of parts) from mere spatial co- location. They identify the relation of a fish to the lake it inhabits with the relation of a genuine part of a lake (a bay, an inlet) to the lake as a whole. They identify the genuine parts of the human body, such as the heart or lungs, with foreign occupants such as parasites or shrapnel.

Region-based approaches leave unexplained what it means for rufous-winged sparrowness (or more particularly, Sparrow(ness) 152 ) to characterize or to occupy a given region at a given time … a mystical artifact of the theory

The solution is to recognize both objects and locations, on separate layers and then we need a theory of coincidence and of layered mereotopology to do justice to the entities in these two categories … BUT THERE IS MORE

Some entities coincide spatially even though they share no parts a portion of food coincides with my stomach cavity at a certain time

Some entities coincide spatio- temporally even though they share no parts the course of a disease coincides with the treatment of the disease The Second World War coincides with a growth in popularity of the British Labour Party

Hypothesis: processes may coincide with objects The Great Plague of 1664 coincides with, but does not overlap, Holland A process of deforestation coincides with, but does not overlap, the forest … but this is not quite right

A better hypothesis The Great Plague of 1664 coincides with, but does not overlap, the history of Holland in the 17th century A process of deforestation coincides with, but does not overlap, the history of the forest

Objects and processes do not coincide For they are of different dimension: Objects are 3-dimensional Processes are 4-dimensional Object-layers are always 3-dimensional Process-layers are always 4-dimensional

Two ontologies of motion and change series of samples, or snapshots object x 1 is at region r 1 at time t 1 object x 2 is at region r 2 at time t 2 object x 3 is at region r 3 at time t 3  SNAP ontologies (ontologies indexed by times)

t 1

t 2

t 3

SPAN ontology

SNAP vs SPAN Continuants vs Occurrents (Sampling vs. Tracking)

SPAN ontology is an ontology which recognizes processes, changes, themselves = four-dimensional (spatio-temporal) entities not via a sequence of instantaneous samplings but via extended observations

Many different interconnections traverse the SNAP-SPAN divide But SNAP and SPAN entities are never related by part_of, connected_to or coincidence (layer) relations

Processes may coincide with each other A process of absorption of a drug coincides, but does not share parts, with the disease processes which the drug is designed to alleviate The manouvres of the coalition troops coincide, but do not share parts in common, with the activities of the terrorists

Processes may coincide with each other Your hearing coincides with but does not share parts with my speaking

There are layers in both the SNAP (object) ontology and the SPAN (process) ontology In SNAP the region layer = space In SPAN the region layer = spacetime

But distinguishing layers in the process realm of SPAN is a matter of gerrymandering (of fiat carvings) to a much greater degree than in the realm of SNAP

One big difference between SNAP and SPAN In SNAP, higher layers are categorially well- distinguished nicely separated (physical objects, holes, administrative entities …) In SPAN everything is flux

E N D E