Towards a Logic Formalization of Taxonomic Concepts

Slides:



Advertisements
Similar presentations
1 Knowledge Representation Introduction KR and Logic.
Advertisements

Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Semantics Static semantics Dynamic semantics attribute grammars
A System to Generate Test Data and Symbolically Execute Programs Lori A. Clarke September 1976.
Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Recursive Definitions and Structural Induction
ISBN Chapter 3 Describing Syntax and Semantics.
Discrete Structures & Algorithms Counting Counting I: One-To-One Correspondence and Choice Trees.
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
Validating Streaming XML Documents Luc Segoufin & Victor Vianu Presented by Harel Paz.
Knowledge Representation I (Propositional Logic) CSE 473.
 Manmatha MetaSearch R. Manmatha, Center for Intelligent Information Retrieval, Computer Science Department, University of Massachusetts, Amherst.
Winter 2004/5Pls – inductive – Catriel Beeri1 Inductive Definitions (our meta-language for specifications)  Examples  Syntax  Semantics  Proof Trees.
Formal methods Basic concepts. Introduction  Just as models, formal methods is a complement to other specification methods.  Standard is model-based.
Describing Syntax and Semantics
MCA –Software Engineering Kantipur City College. Topics include  Formal Methods Concept  Formal Specification Language Test plan creation Test-case.
The Standards for Mathematical Practice
Artificial Intelligence: Its Roots and Scope
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Dave Thau PASI, Costa Rica, June 7, 2008 Ontologies in Ecology and Biodiversity Informatics Dave Thau With some slides by Shawn Bowers and Josh Madin gratefully.
Computational Intelligence: Methods and Applications Lecture 31 Combinatorial reasoning, or learning from partial observations. Włodzisław Duch Dept. of.
Mathematical Modeling and Formal Specification Languages CIS 376 Bruce R. Maxim UM-Dearborn.
Toward Using Ontologies to Reason About Disagreeing Taxonomic Experts Dave Thau UC Davis
Knowledge Management in Theory and Practice
Section 5.3. Section Summary Recursively Defined Functions Recursively Defined Sets and Structures Structural Induction.
Dimitrios Skoutas Alkis Simitsis
Logical Agents Logic Propositional Logic Summary
CleanTAX, Dave Thau Stanford Research Institute Artificial Intelligence Center Seminar 8/16/ of 47 Dave Thau and Bertram Ludäscher.
LDK R Logics for Data and Knowledge Representation Description Logics (ALC)
1 CS 385 Fall 2006 Chapter 1 AI: Early History and Applications.
ISBN Chapter 3 Describing Semantics.
Chapter 3 Part II Describing Syntax and Semantics.
CS 103 Discrete Structures Lecture 13 Induction and Recursion (1)
THEORY OF COMPUTATION Komate AMPHAWAN 1. 2.
Knowledge Management in Theory and Practice
Dave Thau - Mills College - Technology for a Better World111/24/2009 Biodiversity Informatics Dave Thau.
Some Thoughts to Consider 5 Take a look at some of the sophisticated toys being offered in stores, in catalogs, or in Sunday newspaper ads. Which ones.
Chapter 5 With Question/Answer Animations 1. Chapter Summary Mathematical Induction - Sec 5.1 Strong Induction and Well-Ordering - Sec 5.2 Lecture 18.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 04 : Logic.
Analysis Classes Unit 5.
Set Operations CS 202, Spring 2008 Epp, chapter 5.
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Knowledge Representation and Reasoning
Computer Science cpsc322, Lecture 13
Propositional Logic Session 3
Back to School Night for Mathematics in Context®
ARTIFICIAL INTELLIGENCE
Knowledge Representation
PROBLEM SOLVING CHECKLIST
Knowledge Representation
Ontology Evolution: A Methodological Overview
Computer Science cpsc322, Lecture 13
Problem Solving Activities
Logic Use mathematical deduction to derive new knowledge.
Semantics In Text: Chapter 3.
KNOWLEDGE REPRESENTATION
Back to “Serious” Topics…
Pruning 24-Feb-19.
Logical Truth To show a statement A is a logic truth (tautology) ...
CS 416 Artificial Intelligence
Knowledge Representation I (Propositional Logic)
This Lecture Substitution model
Domain Splitting CPSC 322 – CSP 4 Textbook §4.6 February 4, 2011.
SETS, RELATIONS, FUNCTIONS
Refinement Refine a formal specification by adding more information
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Presentation transcript:

Towards a Logic Formalization of Taxonomic Concepts Dave Thau, Bertram Ludäscher, Shawn Bowers UC Davis thau@learningsite.com

5th International Conference on Ecological Informatics Names are Confusing Adapted from R. Peet Ranunculus plumosa Gray 1834 R.plumosa var intermedia R.plumosa var plumosa Chapman 1860 Kral 1998 Ranunculus pinetcola Ranunculus plumosa Ranunculus plumosa Ranunculus homunculus Thau 2006 thau@learningsite.com 5th International Conference on Ecological Informatics

Impact on Data Analysis Can’t find data If A º B, a search on A should retrieve B Same if A  B Can’t aggregate data If A  B, you should be able to combine data from A into B thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Where In Greece Can I Find Ranunculus aquatilis? R. aquatilis  R. trichophyllus thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Mapping Taxonomies Benson, 1948 FNA-03, 1997 Ranunculus aquatilis  º Ranunculus aquatilis R.a. var calvescens R.a. var capillaceus R.a. var aquatilis R.a. var diffusus R.a. var hispidulus º º  B A A  B B A A  B B  A B A A overlap B B A A disjoint B  This results in 512 (more than 240 million) possible sets of relationships. thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Overview The problems – Names change, experts disagree, data become incomparable The partial solution – Taxonomic Concepts Another part of the solution – Logic Representing taxonomy in logic Using the representation to detect inconsistencies and discover new relations Applications thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Logic, why? Precise modeling language Solid mathematical basis Good tools for reasoning are available Explicit, “portable” representation (not buried in code) thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Basic Taxonomy A Rooted tree Only “Isa” relations isa isa B C T = (N, E) N = {A, B, C} E = {B A, C A}  isa B  isa A  isa C A isaTx:m(x)  n(x)m n  E, T=(N,E)) }  isa In the basic taxonomy TisaT thau@learningsite.com 5th International Conference on Ecological Informatics

Some Additional Constraints No empty nodes All nodes have at least one element Tx: n(x)n  N, T=(N,E)) } Disjointness The children of a node are disjoint !Tx: n1(x)  n2(x)  n1 m  E, n2 m  E, T=(N,E)) } Closed World A node with children is defined as the union of those children This one’s formula is a bit long – trust me… A B C isa  isa  isa thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Mapping Formulae Mappings between nodes in two different taxonomies have their owns In the slides and proofs to come I will use these symbols: A  B: A is included in B A  B: A includes B A  B: A and B are equivalent thau@learningsite.com 5th International Conference on Ecological Informatics

Inferring Unstated Correspondences Benson, 1948 Kartesz, 2004 Ranunculus arizonicus Given: º Ranunculus arizonicus Given:  R.a. var chihuahua R.a. var typicus We can demonstrate:  Peet, 2005: B.1948:R.a.typicus is included in K.2004:R. arizonicus B.1948:R. arizonicus is congruent to K.2004:R. arizonicus thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Proving New Mappings Benson, 1948 Kartesz, 2004 A Ranunculus arizonicus D Ranunculus arizonicus º  B R.a. var chihuahua C R.a. var typicus  ? Show B  D and (D  B) thau@learningsite.com 5th International Conference on Ecological Informatics

Formal Proof of Mapping Part 1 Part 2 thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Inconsistent Mapping Benson, 1948 Kartesz, 2004 Ranunculus hydrocharoides º Ranunculus hydrocharoides R.h. var natans R.h. var stolonifer R.h. var typicus R.h. var stolonifer R.h. var typicus º º Peet, 2005: B.1948:R.h.stolonifer is congruent to K.2004:R.h.stolonifer B.1948:R.h.typicus is congruent to K.2004:R.h.typicus B.1948:R. hydrocharoides is congruent to K.2004:R. hydrocharoides thau@learningsite.com 5th International Conference on Ecological Informatics

Proving Inconsistency Benson, 1948 Kartesz, 2004 Ranunculus hydrocharoides º Ranunculus hydrocharoides R.h. var natans R.h. var stolonifer R.h. var typicus R.h. var stolonifer R.h. var typicus º º good – you could animate and ask “does someone see the problem” then (either way), you show the reasoning. do NOT show the formulas first, but give an “abstract proof” have a formal proof as back-up (but essentially you’ll have to skip over) GOAL: 1. convince audience that the reasoning makes sense 2. convince audience that there is an algorithm that could have done the reasoning for us.. thau@learningsite.com 5th International Conference on Ecological Informatics

Formal Proof of Inconsistency thau@learningsite.com 5th International Conference on Ecological Informatics

Showing Inconsistency Using Popular Tools Benson, 1948 Kartesz, 2004 Ranunculus Ranunculus Ranunculus macranthus Ranunculus petiolaris Ranunculus petiolaris … …   B.48:R. petiolaris  K.04:R. petiolaris  B.48:R. macranthus contradicts B.48:R. macranthus and B.48:R. petiolaris are disjoint. Peet, 2005: B.1948:R. macranthus contains K.2004: R. petiolaris B.1948:R. petiolaris is contained by K. petiolaris thau@learningsite.com 5th International Conference on Ecological Informatics

Resolving Inconsistencies Trying to simultaneously satisfy no emptiness, disjointness and the closed world Relaxing any of these makes the mapping consistent – giving us clues to hidden truths It turns out that Kartesz and Benson focus on different localities. thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Inconsistent Mapping Benson, 1948 Kartesz, 2004 Ranunculus hydrocharoides º Ranunculus hydrocharoides R.h. var natans R.h. var stolonifer R.h. var typicus R.h. var stolonifer R.h. var typicus º º Peet, 2005: B.1948:R.h.stolonifer is congruent to K.2004:R.h.stolonifer B.1948:R.h.typicus is congruent to K.2004:R.h.typicus B.1948:R. hydrocharoides is congruent to K.2004:R. hydrocharoides thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Summary Taxonomic Concepts are important Logic is a useful tool when reasoning about mappings between taxonomies We have the beginnings of a representation for taxonomies That representation can find unstated mappings And detect inconsistent mappings thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Future Work Beefing up the representation Formalizing more constraints, such as rank Working in other factors, such as locality Adding ‘intelligence’ to tools which build mappings Using the representation in a workflow system to aid data integration thau@learningsite.com 5th International Conference on Ecological Informatics

5th International Conference on Ecological Informatics Thanks! Questions? We would like to acknowledge: Bob Peet for the Ranunculus data set NSF, under SEEK awards 0225676, 0225665, 0225635, and 0533368 thau@learningsite.com 5th International Conference on Ecological Informatics