Ontology and the lexicon Nicola Guarino and Christopher A. Welty(2004). An Overview of OntoClean Weber ( 張澄清 ) 2014/04/23 1.

Slides:



Advertisements
Similar presentations
12 Março 2003 Departamento de Informática Universidade do Minho Departamento de Informática Lic. Matemática e Ciências de Computação Laboratório de Métodos.
Advertisements

65,536 Definitions of Physicalism David J. Chalmers.
Ontology-Driven Conceptual Modeling Chris Welty IBM Watson Research Center.
Ontology Quality and the Semantic Web Chris Welty IBM Watson Research Center.
KR-2002 Panel/Debate Are Upper-Level Ontologies worth the effort? Chris Welty, IBM Research.
Object-Oriented Programming Basics Prof. Ankur Teredesai, Computer Science Department, RIT.
Ontological Analysis of Taxonomic Relationships Nicola Guarino, LADSEB-CNR,Italy Chris Welty, Vassar College, USA Thanks to: Bill Andersen, Pierdaniele.
Saul Kripke, “Identity and Necessity” Driving question: How are contingent identity statements possible? For example, we take it to be the case that it.
Knowledge Representation
Gibbard, “Contingent Identity” Against Kripke, for whom identity statements involving names (rigid designators) are necessary. Gibbard wants to argue that.
Ontology-Driven Conceptual Modelling Speaker:. Harmonization Meeting What is Ontology?  A discipline of Philosophy  Meta-physics dates.
Analysis Modeling.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
NIST Foundations of Ontological Analysis Chris Welty, Vassar College.
Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall A.1.
IBM T.J. Watson Research Center Foundations of Ontological Analysis Chris Welty, Vassar College.
Chapter 22 Object-Oriented Systems Analysis and Design and UML Systems Analysis and Design Kendall and Kendall Fifth Edition.
Klaus M. Frei1 WordNet „An On-line Lexical Database“ (Miller, G. A.; Beckwith, R.; Fellbaum, Chr.; Gross, D.; Miller, K. 1993, title). Based on psycho-linguistic.
1 Draft of a Matchmaking Service Chuang liu. 2 Matchmaking Service Matchmaking Service is a service to help service providers to advertising their service.
Copyright 2004 Prentice-Hall, Inc. Essentials of Systems Analysis and Design Second Edition Joseph S. Valacich Joey F. George Jeffrey A. Hoffer Appendix.
What is an Ontology? AmphibiaTree 2006 Workshop Saturday 8:45–9:15 A. Maglia.
Ontology Development Kenneth Baclawski Northeastern University Harvard Medical School.
The physical reductive explainability of phenomenal consciousness and the logical impossibility of zombies Marco Giunti University of Cagliari (Italy)
Conceptual Modeling and Ontological Analysis Nicola Guarino, LADSEB CNR,Italy Chris Welty, Vassar College, USA.
Bertrand Russell, “Existence and Description” §1 General Propositions and Existence “Now when you come to ask what really is asserted in a general proposition,
Of 39 lecture 2: ontology - basics. of 39 ontology a branch of metaphysics relating to the nature and relations of being a particular theory about the.
INF 384 C, Spring 2009 Ontologies Knowledge representation to support computer reasoning.
Testing Theory cont. Introduction Categories of Metrics Review of several OO metrics Format of Presentation CEN 5076 Class 6 – 10/10.
Applying Rigidity to Standardizing OBO Foundry Candidate Ontologies A.Patrice Seyed and Stuart C. Shapiro Department of Computer Science Center for Cognitive.
Copyright 2001 Prentice-Hall, Inc. Essentials of Systems Analysis and Design Joseph S. Valacich Joey F. George Jeffrey A. Hoffer Appendix A Object-Oriented.
Copyright 2002 Prentice-Hall, Inc. Modern Systems Analysis and Design Third Edition Jeffrey A. Hoffer Joey F. George Joseph S. Valacich Chapter 20 Object-Oriented.
USCISIUSCISI Background Description Logic Systems Thomas Russ.
Evaluating Ontological Decisions with OntoClean Chris Welty, Vassar College, USA Nicola Guarino, LADSEB-CNR, Italy.
Programming in Java Unit 3. Learning outcome:  LO2:Be able to design Java solutions  LO3:Be able to implement Java solutions Assessment criteria: 
11 Chapter 11 Object-Oriented Databases Database Systems: Design, Implementation, and Management 4th Edition Peter Rob & Carlos Coronel.
1 ©Amit Mitra & Amar Gupta AGGREGATION Reading Assignment Supplementary module 5 Object Aggregation.
SWAP-07 Ontology Engineering with OntoClean Chris Welty IBM Watson Research Center.
LDK R Logics for Data and Knowledge Representation PL of Classes.
The Theory of Natural Individuals The McDonald’s Version Gregg Rosenberg.
Mariano Fernández López &Asunción Gómez Pérez The integration of OntoClean in WebODE Mariano Fernández-López Asunción Gómez-Pérez Artificial Intelligence.
Lecture 2 (Chapter 2) Introduction to Semantics and Pragmatics.
MDA & RM-ODP. Why? Warehouses, factories, and supply chains are examples of distributed systems that can be thought of in terms of objects They are all.
Knowledge Representation. Keywordsquick way for agents to locate potentially useful information Thesaurimore structured approach than keywords, arranging.
ece 627 intelligent web: ontology and beyond
Inferring Declarative Requirements Specification from Operational Scenarios IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 24, NO. 12, DECEMBER, 1998.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
EEL 5937 Content languages EEL 5937 Multi Agent Systems Lecture 10, Feb. 6, 2003 Lotzi Bölöni.
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall Appendix A Object-Oriented Analysis and Design A.1.
Ontologies, Conceptualizations, and Possible Worlds Revisiting “Formal Ontologies and Information Systems” 10 years later Nicola Guarino CNR Institute.
Of 29 lecture 15: description logic - introduction.
LDK R Logics for Data and Knowledge Representation Description Logics: family of languages.
Ontology Evaluation Outline Motivation Evaluation Criteria Evaluation Measures Evaluation Approaches.
Model Checking Early Requirements Specifications in Tropos Presented by Chin-Yi Tsai.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 16 Description Logic.
Data Modeling Using the Entity- Relationship (ER) Model
Lecture 6 Modality: Possible worlds
3. The Logic of Quantified Statements Summary
Object-Oriented Programming Basics
ece 720 intelligent web: ontology and beyond
Conceptual Modeling and Ontological Analysis
Particulars and Properties Lecture one: Universalism and Nominalism.
A new perspective on philosophical debates
Ontology.
Chapter 20 Object-Oriented Analysis and Design
Appendix A Object-Oriented Analysis and Design
Logics for Data and Knowledge Representation
Chapter 22 Object-Oriented Systems Analysis and Design and UML
Appendix A Object-Oriented Analysis and Design
Appendix A Object-Oriented Analysis and Design
Presentation transcript:

Ontology and the lexicon Nicola Guarino and Christopher A. Welty(2004). An Overview of OntoClean Weber ( 張澄清 ) 2014/04/23 1

Outline Introduction Basic notions Rigidity Identity Unity Dependence Constraints and Assumptions Methodology Example Conclusion 2

Introduction domain modelers can structure a taxonomy, but unable to justify themselves to others OntoClean provided a logical basis for arguing against the most common modeling pitfalls basic notions in OntoClean were not new property and class are used in computer science with different meaning from the original(property in RDF) Subsumption, properties, classes Basic notions: essence, rigidity, identity, unity, and dependence Adopt a first-order logic 3

Introduction If time argument is omitted for predicate ɸ, then the predicate is assumed to be time invariant, that is Identity relation will be assumed as time invariant: if two things are identical, they are identical forever □ ɸ means ɸ is necessarily true, i.e., true in all possible worlds; ◊ ɸ means ɸ is possible true, i.e., true in at least one possible world Domain of quantification will be that of possibilia  the extension of predicates will not be limited to what exits in the actual world the examples will not be the point 4

Rigidity Definition 1 _A rigid property is a property that is essential to all its instances, i.e, a property ɸ such that: i.e., PERSON as rigid Definition 2 _A non-rigid property is a property that is not essential to some of its instances, i.e., i.e., having a brain in our Wizard of Oz world Definition 3 _An anti-rigid property is a property that is not essential to all its instances, i.e., i.e., STUDENT as anti-rigid 5

Rigidity 6

Identity 7

8

An IC is necessary if it satisfies (3) and sufficient if it satisfies (4), and need not be both. This is weaker than 9

Identity Time duration Time interval 1:00~2:00 Next Tue. 2:00~3:00 Next Wed. 10

Unity 11

Unity 12

Unity 13

Dependence An externally dependent property is +D (-D otherwise) 14

Constraints and Assumptions Given two properties, p and q, when q subsumes p, the following constraints hold: q is anti-rigid, then p must be anti-rigid q carries an identity criterion, then p must carry the same criterion q carries a unity criterion, then p must carry the same criterion q has anti-unity, then p must also have anti-unity q is dependent on property c, then p is dependent on property c 15

Constraints and Assumptions Sortal Individuation: Every domain element must instantiate some property carrying an IC (+I). In this way we satisfy Quine’s dicto “No entity without identity” Sortal Expandability: If something is an instance of different properties (for instance related to different times), then it must be also instance of a more general property carrying a criterion for its identity 16

Methodology Assigning Meta-Properties Analyzing Rigid Properties The Backbone Taxonomy Analyzing Non-rigid Properties Phased Sortals Roles Attributions 17

Methodology 18

Methodology Useful property kind All possible combinations of meta-properties 19

Methodology Ontology-based modeling principles Unity and identity assumption Ideal taxonomy structure 20

Summary rigid property is a property that is essential to all its instances(+R) non-rigid property is a property that is not essential to some of its instances(-R) anti-rigid property is a property that is not essential to all its instances Any property carries an IC iff it is subsumed by a property supplying this IC(including the case where it supplies the IC itself) A property ɸ supplies an IC iff (1) it is rigid; (2) there is an IC for it; (3) the same IC is not carried by all the properties subsuming ɸ. This means that, if ɸ inherits different(but compatible) ICs from multiple properties, it still counts as supplying an IC. 21

Summary property carrying an IC is marked +I (-I otherwise); property supplying an IC is +O (-O otherwise) Any property carrying an IC (+I) is called a sortal A property ɸ carries a unity condition (+U) iff there exists an equivalence relation ω such that all its instances are intrinsic wholes under ω A property has anti-unity (~U) if every instance of the property is not necessarily a whole a property ɸ is externally dependent on a property Ψ if, for all its instances x, necessarily some instance of y must exist, which is not a part nor a constituent of x 22

Example 23

Assigning Meta-property 24

Assigning Meta-property 25

Assigning Meta-property 26

Assigning Meta-property 27

Analyzing Rigid Properties Living beings are not amounts of matter: ~U/+U violation; IC: amounts of matter have an extensional identity Physical objects are not amounts of matter: ~U/+U violation; Physical objects are not themselves amounts of matter, they are constituted of matter Social entities are not groups of people: ~U/+U violation; social entity more than a group of people, must be somehow unified Animals are not physical objects: being alive is an essential property for animals, not for physical object 28

Analyzing Non-rigid Properties Phased Sortals: whose instances are allowed to change certain of their identity criteria during their existence canonical example is a caterpillar independent, anti-rigid, and supply identity criteria Roles: participates to a contingent event or state of affairs anti-rigid; differently from phase sortals, do not supply identity criteria Attributions: the proper way to model attributions is with a simple attribute, like color, and a value, such as red 29

Outcome 30

Conclusion heavier lines indicate subsumption relationships between members of the backbone taxonomy subsumption is often used to represent things other than subsumption, can be described on language using “is a” Sometimes “is a” is not logically consistent with the subsumption relationship 31

Reference Welty, C. and Guarino, N Supporting ontological analysis of taxonomic relationships. Data and Knowledge Engineering, 39(1): 51–