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

Slides:



Advertisements
Similar presentations
1 First order theories (Chapter 1, Sections 1.4 – 1.5)
Advertisements

Dr. David A Ferrucci -- Logic Programming and AI Lecture Notes Knowledge Structures Building the Perfect Object.
Semantics Static semantics Dynamic semantics attribute grammars
Rigorous Software Development CSCI-GA Instructor: Thomas Wies Spring 2012 Lecture 11.
Answer Set Programming Overview Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma de Guadalajara
1 A Description Logic with Concrete Domains CS848 presentation Presenter: Yongjuan Zou.
David Lewis, “Counterparts and Double Lives” Modal Realism: “When I profess realism about possible worlds, I mean to be taken literally. Possible worlds.
CS 599 – Spatial and Temporal Databases Realm based Spatial data types: The Rose Algebra Ralf Hartmut Guting Markus Schneider.
Copyright © 2006 Addison-Wesley. All rights reserved.1-1 ICS 410: Programming Languages Chapter 3 : Describing Syntax and Semantics Axiomatic Semantics.
Correlation and Autocorrelation
CPSC 322 Introduction to Artificial Intelligence September 20, 2004.
1 2. Constraint Databases Next level of data abstraction: Constraint level – finitely represents by constraints the logical level.
Axiomatic Semantics Dr. M Al-Mulhem ICS
CS 330 Programming Languages 09 / 18 / 2007 Instructor: Michael Eckmann.
Pathways and Networks for Realists Barry Smith 1.
PSUCS322 HM 1 Languages and Compiler Design II Formal Semantics Material provided by Prof. Jingke Li Stolen with pride and modified by Herb Mayer PSU Spring.
Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Fundamentals (Chapter 4) Axiomatic Semantics ICS 535.
Physical Symbol System Hypothesis
CS 330 Programming Languages 09 / 16 / 2008 Instructor: Michael Eckmann.
© M.E. Fayad SJSU -- CmpE Database Design Dr. M.E. Fayad, Professor Computer Engineering Department, Room #283I College of Engineering San José.
Meaning and Language Part 1.
CS Bayesian Learning1 Bayesian Learning. CS Bayesian Learning2 States, causes, hypotheses. Observations, effect, data. We need to reconcile.
Meaningful Modeling: What’s the Semantics of “Semantics”? David Harel, Weizmann Institute of Science Bernhard Rumpe, Technische Universität Braunschweig.
CSC 8310 Programming Languages Meeting 2 September 2/3, 2014.
Is Consciousness a brain process?. What does it take even to entertain the possibility that minds are nothing more than brains? i. e. Maybe this sentence.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
6. Simple Features Specification Background information UML overview Simple features geometry.
First Order Logic Chapter 7. PL is a Weak Representational Language §Propositional Logic (PL) is not a very expressive language because: §Hard to identify.
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
CSI 3125, Axiomatic Semantics, page 1 Axiomatic semantics The assignment statement Statement composition The "if-then-else" statement The "while" statement.
Grammars CPSC 5135.
Formal Models in AGI Research Pei Wang Temple University Philadelphia, USA.
Computabilty Computability Finite State Machine. Regular Languages. Homework: Finish Craps. Next Week: On your own: videos +
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Activity 1-19: The Propositional Calculus
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
A Brief Introduction to Set Theory. How Many Things?
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Semantics In Text: Chapter 3.
FORSVARETS FORSKNINGSINSTITUTT Transformation of geographical information into linguistic sentences: Two case studies Jan Terje Bjørke.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
ISBN Chapter 3 Describing Syntax and Semantics.
Artificial Intelligence Chapter 15 The Predicate Calculus Artificial Intelligence Chapter 15 The Predicate Calculus Biointelligence Lab School of Computer.
1 CSC384: Intro to Artificial Intelligence Lecture 5.  Knowledge Representation.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
ece 627 intelligent web: ontology and beyond
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
CSC3315 (Spring 2009)1 CSC 3315 Languages & Compilers Hamid Harroud School of Science and Engineering, Akhawayn University
1 CSC384: Intro to Artificial Intelligence Reasoning under Uncertainty ● Reading. Chapter 13.
∞ Infinity Week 10: Formal Mathematics. Week 7 Formalization.
Introduction to Ontology Introductions Alan Ruttenberg Science Commons.
Knowledge Representation Lecture 2 out of 5. Last Week Intelligence needs knowledge We need to represent this knowledge in a way a computer can process.
Lecture 7 Modality: Metaphysics of possible worlds
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Topics Covered since 1st midterm…
Survey of Knowledge Base Content
Ontology.
CRMarchaeo Modelling Context, Stratigraphic Unit, Excavated Matter
Ontology.
Towards a Naive Geography
Logics for Data and Knowledge Representation
Semantics In Text: Chapter 3.
Artificial Intelligence Chapter 15. The Predicate Calculus
A Brief Summary for Exam 1
Ontology.
Predicates and Quantifiers
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
Database Design Dr. M.E. Fayad, Professor
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

Towards a Naive Geography Pat Hayes & Geoff Laforte IHMC University of West Florida

Ontology All the things you are… Upper-level ontology standardization effort now under way. Top levels form a lattice (more or less) based on about a dozen (more or less) orthogonal distinctions: (abstract/concrete) (dependent/independent) (individual/plurality) (essential/non-essential) (universal/particular) (occurrent/continuant)… Most of these dont have anything particularly to do with geography, but they seem to apply to geography as much as to everything else.

Ontology Some particularly geographical concepts Continuant physical entity with space-like parts Occurrent physical entity with time-like parts (Can some things be both?) Location piece of physical space Terrainpiece of geographical space (consisting of locations suitably related to each other.) Historyspatio-temporal region (the envelope of a continuant or occurrent.)

Ontology Many tricky ontological issues dont seem to arise in geographical reasoning. What happens to the hole in a bagel when you take the bagel into a railway tunnel? Is a carpet in the room or part of the room? (What about the paint?) Is doing nothing a kind of action? Is a flame an object or a process? On the other hand, maybe they do...

Ontology Some issues are basically tamed Holes, surfaces, boundaries; Dimension; Qualitative spatiotemporal reasoning. Some others arent Blurred things, indistinctness; tolerances and granularity. ( heap paradox...been around for a while. ) Distributive properties: textures, roughness, etc. some personal opinions

Geographical Inference Should apply to maps, sentences and databases. Valid = truth-preserving Interpretation = a way the world could be, if the representation is true of it

Semantics a la Tarski, a brief primer l Specify the syntax l Expressions have immediate parts Interpretation is defined recursively I(e) = M(t, I(e 1 ),…,I(e n ) ) l Structural agnosticism yields validity l Interpretation is assumed to have enough structure to define truth…..but thats all.

= Oil well = Town Simple maps have no syntax (worth a damn…)

Different tokens of same symbol mean different things Indexical?? ( This city…) Bound variable?? ( The city which exists here…) Existential assertion? ( A city exists here…)

Different tokens of same symbol mean different things Indexical?? ( This city…) Bound variable?? ( The city which exists here…) Existential assertion? ( A city exists here…) Located symbol = location plus a predicate The map location is part of the syntax

I(e)=M(t, I(e 1 ),…,I(e n ) ) …. where n = 1 The interpretation of a symbol of type t located at p is given by M(t, I(p) ) = M(t)( I(p) ) M(triangle) = Oil-well M(circle) = Town

The map location is part of the syntax I(e)=M(t, I(e 1 ),…,I(e n ) ) …. where n = 1 The interpretation of a symbol of type t located at p is given by M(t, I(p) ) = M(t)( I(p) ) M(triangle) = Oil-well M(circle) = Town But what is I(p) ? For that matter, what is p, exactly ?

What is I(p) ? For that matter, what is p ? Need a way to talk about spaces and locations 1. Geometry (not agnostic; rules out sketch-maps) 2. Topology (assumes continuity) 3. Axiomatic mereology (more or less…)

What is I(p) ? For that matter, what is p ? Assume that space is defined by a set of locations (obeying certain axioms) … map and terrain are similar … tread delicately when making assumptions

What is I(p) ? For that matter, what is p ? A location can be any place a symbol can indicate, or where a thing might be found (or any piece of space defining a relation between other pieces of space) surface patches, lines, points, etc... Different choices of location set will give different geometries of the space. Note, do not want to restrict to solid space (unlike most axiomatic mereology in the literature.)

Sets of pixels on a finite screen All open discs in R2 (or R3 or R4 or…) All unions of open discs The closed subsets of any topological space The open subsets The regular (= solid) subsets All subsets All finite sets of line segments in R2 All piecewise-linear polygons … and many more …

Assume basic relation of covering p<q p<p p<q & q<r implies p<r p<q & q<p implies p=q Every set S of locations has a unique minimal covering location (p S) implies p< ^S ((p S) implies p<q) implies q< ^S (Mereologists usually refuse to use set theory...but we have no mereological sensibility :-)

Can define many useful operations and properties: Everywhere: forall p (p<^L) Overlap: pOq = df exists r ( r<p and r<q ) Sum: p+q = df ^{p,q} Complement: ¬ p = df ^{q: not pOq} … but not (yet) all that we will need: Boundary? Direction?

There is a basic tension between continuity and syntax What are the subexpressions of a spatially extended symbol in a continuum? Set of sub-locations is clear if it covers no location of a symbol; it is maximally clear if any larger location isnt clear. Immediate subexpressions are minimal covers of maximally clear sets. Sets of subexpressions of a finite map are well-founded (even in a continuum.)

Part of the meaning of an interpretation must be the projection function from the terrain of the interpretation to the map: What is I(p) ?

But interpretation mappings go from the map to the interpretation: …and they may not be invertible. What is I(p) ?

covering inverse of function between location spaces: /f(p) = ^{q : f(q) = p } What is I(p) ? I(p) =?= /projection I (p) f /f

For locations of symbols, the covering inverse of the projection function isnt an adequate interpretation: What is I(p) ?

For locations of symbols, the covering inverse of the projection function isnt an adequate interpretation. I(p) is a location covered by the covering inverse: I(p) < /projection(p) Which is really just a fancy way of saying: projection(I(p))=p What is I(p) ?

Some examples London tube map Terrain is Gill space: minimal sets of elongated rectangles joined at pivots Projection takes rectangle to spine (and adds global fisheye distortion)

Some examples Linear route map Terrain is restriction of R2 to embedded road graph. Projection takes non-branching segment to (numerical description of) length and branch-point to (description of) direction.

Some examples Choropleth Map Terrain is restriction of underlying space to maximal regions Projection preserves maximality. (Actually, to be honest, it requires boundaries.)

Adjacency requires boundaries Need extra structure to describe touching (Asher : C) We want boundaries to be locations as well… b p b is part of the boundary of p

Adjacency requires boundaries b p Define full boundary of p to be ^{b : b p } Boundary-parts may have boundaries but full boundaries dont. Adjacency is defined to be sharing a common boundary part: pAq = df exist b (b p and b q )

Axioms for boundaries ( b p & c<b ) implies c p ( b p & p<q ) implies ( b p or b<q ) ( -->adjacency analysis) Homology axiom: not ( c ^{b : b p } )

Boundaries define paths

Examples of boundary spaces Pixel regions with linear boundaries joined at edge and corners Pixel regions with interpixels Subsets of a topological space with sets of limit points Circular discs with circular arcs in R2 Piecewise linear regions with finite sets of line-segments and points in R2

Need to consider edges between pixels as boundary locations. Or, we can have both interpixels and lines as boundaries.

Maps and sentences Since map surface and interpretation terrain are similar, axiomatic theory applies to both. Terrain spatial ontology applies to map surface, so axiomatic theory of terrain is also a theory of map locations. A theory which is complete for the relations used in a map is expressive enough to translate map content, via I(p) < /projection I (p)

Maps and Sentences n Goal is to provide a coherent account of how geographical information represented in maps can be translated into logical sentences while preserving geographical validity. n Almost there... current work focussing on adjacency and qualitative metric information.