CSE-291: Ontologies in Data & Process Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies.

Slides:



Advertisements
Similar presentations
Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec Yuan Ren, Kees van Deemter and Jeff.
Advertisements

Description Logic Based Ontology Languages Ian Horrocks Information Systems Group Oxford University Computing Laboratory.
Artificial Intelligence Description Logics - Background and Motivation for DL Relation between DL and FOPL (extensional Semantics) Example.
CS848: Topics in Databases: Foundations of Query Optimization Topics covered  Introduction to description logic: Single column QL  The ALC family of.
Artificial Intelligence Description Logics see references last slide.
Knowledge Representation and Reasoning using Description Logic Presenter Shamima Mithun.
Bart Gajderowicz, Ryerson University, Dept. of Computer Science
OWL - DL. DL System A knowledge base (KB) comprises two components, the TBox and the ABox The TBox introduces the terminology, i.e., the vocabulary of.
An Introduction to Description Logics
1 A Description Logic with Concrete Domains CS848 presentation Presenter: Yongjuan Zou.
Knowledge Representation and Reasoning using PowerLoom Presenter Shamima Mithun.
High-level Data Access Based on Query Rewritings Ekaterina Stepalina Higher School of Economics.
INTRODUCTION TO ARTIFICIAL INTELLIGENCE Massimo Poesio LECTURE 4: Semantic Networks and Description Logics.
Combining the strengths of UMIST and The Victoria University of Manchester A Tableaux Decision Procedure for SHOIQ Ian Horrocks and Ulrike Sattler University.
Natural Language Processing  First-Order Predicate Logic - Predicates  Short Introduction to Description Logics  PowerLoom.
Description Logics. Outline Knowledge Representation Knowledge Representation Ontology Language Ontology Language Description Logics Description Logics.
DL systems DL and the Web Ilie Savga
Part 6: Description Logics. Languages for Ontologies In early days of Artificial Intelligence, ontologies were represented resorting to non-logic-based.
Basics of Reasoning in Description Logics
ANHAI DOAN ALON HALEVY ZACHARY IVES Chapter 12: Ontologies and Knowledge Representation PRINCIPLES OF DATA INTEGRATION.
FiRE Fuzzy Reasoning Engine Nikolaos Simou National Technical University of Athens.
Amarnath Gupta Univ. of California San Diego. An Abstract Question There is no concrete answer …but …
Chapter 6 Understanding Each Other CSE 431 – Intelligent Agents.
Description Logics Franz Baader, Ian Horrocks, Ulrike Sattler Presented By Jahan Ara Arju Muhammad Nazmus Sakib CSCE
An Introduction to Description Logics. What Are Description Logics? A family of logic based Knowledge Representation formalisms –Descendants of semantic.
A Logic for Decidable Reasoning about Services Yilan Gu Dept. of Computer Science University of Toronto Mikhail Soutchanski Dept. of Computer Science Ryerson.
Computing & Information Sciences Kansas State University Wednesday, 08 Oct 2008CIS 530 / 730: Artificial Intelligence Lecture 17 of 42 Wednesday, 08 October.
Notes on DL Reasoning Shawn Bowers April, 2004.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
Query Answering Based on the Modal Correspondence Theory Evgeny Zolin University of Manchester Manchester, UK
Chapter 6 Understanding Each Other CSE 431 – Intelligent Agents.
Presented by:- Somya Gupta( ) Akshat Malu ( ) Swapnil Ghuge ( ) Franz Baader, Ian Horrocks, and Ulrike Sattler.
An Introduction to Description Logics (chapter 2 of DLHB)
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description Logics: Logic foundation of Semantic Web Semantic.
LDK R Logics for Data and Knowledge Representation Description Logics (ALC)
More on Description Logic(s) Frederick Maier. Note Added 10/27/03 So, there are a few errors that will be obvious to some: So, there are a few errors.
LDK R Logics for Data and Knowledge Representation Description Logics.
Knowledge Representation in Description Logic. 1. Introduction Description logic denotes a family of knowledge representation formalisms that model the.
Bertram Ludäscher Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies in Data Integration.
CSE-291: Ontologies in Data & Process Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies.
DL Overview Second Pass Ming Fang 06/19/2009. Outlines  Description Languages  Knowledge Representation in DL  Logical Inference in DL.
4-Nov-05 CS6795 Semantic Web Techniques 1 Description Logic – 2.
LDK R Logics for Data and Knowledge Representation ClassL (Propositional Description Logic with Individuals) 1.
LDK R Logics for Data and Knowledge Representation ClassL (part 2): Reasoning with a TBox 1.
References [1] D:\My Documents\SemanticWebWorkshop\kaynak\Ian Horrocks - CS646\intro-2004.pptD:\My Documents\SemanticWebWorkshop\kaynak\Ian Horrocks -
Description Logics Dr. Alexandra I. Cristea. Description Logics Description Logics allow formal concept definitions that can be reasoned about to be expressed.
ece 627 intelligent web: ontology and beyond
CSE-291: Ontologies in Data Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies in Data Integration.
Knowledge Repn. & Reasoning Lec #11+13: Frame Systems and Description Logics UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2004.
1 Instance Store Database Support for Reasoning over Individuals S Bechhofer, I Horrocks, D Turi. Instance Store - Database Support for Reasoning over.
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2011 Adina Magda Florea
Presented by Kyumars Sheykh Esmaili Description Logics for Data Bases (DLHB,Chapter 16) Semantic Web Seminar.
Of 29 lecture 15: description logic - introduction.
CSE-291: Ontologies in Data Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies in Data Integration.
LDK R Logics for Data and Knowledge Representation Description Logics: family of languages.
Ontology Technology applied to Catalogues Paul Kopp.
Knowledge Representation and Inference Dr Nicholas Gibbins 32/3019.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 16 Description Logic.
Knowledge Representation Part II Description Logic & Introduction to Protégé Jan Pettersen Nytun.
Logics for Data and Knowledge Representation
ece 720 intelligent web: ontology and beyond
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Description Logics.
Logics for Data and Knowledge Representation
A Tutorial Summary of Description Logic and Hybrid Rules
CIS Monthly Seminar – Software Engineering and Knowledge Management IS Enterprise Modeling Ontologies Presenter : Dr. S. Vasanthapriyan Senior Lecturer.
Logics for Data and Knowledge Representation
Presentation transcript:

CSE-291: Ontologies in Data & Process Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies in Data Integration Spring 2004 Bertram Ludäscher

CSE-291: Ontologies in Data & Process Integration Outline Introduction to Description Logics (DLs)Introduction to Description Logics (DLs) BreakBreak First-order logic (FOL) and Mapping DLs to FOLFirst-order logic (FOL) and Mapping DLs to FOL Material based on: F. Baader, W. Nutt. Basic Description Logics. In the Description Logic Handbook, edited by F. Baader, D. Calvanese, D.L. McGuinness, D. Nardi, P.F. Patel-Schneider, Cambridge University Press, 2002, pages F. Baader, W. Nutt. Basic Description Logics. In the Description Logic Handbook, edited by F. Baader, D. Calvanese, D.L. McGuinness, D. Nardi, P.F. Patel-Schneider, Cambridge University Press, 2002, pages Description Logics Tutorial, Ian Horrocks and Ulrike Sattler, ECAI-2002, Lyon, France, July 23rd, 2002.Description Logics Tutorial, Ian Horrocks and Ulrike Sattler, ECAI-2002, Lyon, France, July 23rd, Emerging Sparrow toolkit (Bowers, Ludaescher)Emerging Sparrow toolkit (Bowers, Ludaescher)

CSE-291: Ontologies in Data & Process Integration Example: Description Logic DL definition of “Happy Father” (Example from Ian Horrocks, U Manchester, UK)DL definition of “Happy Father” (Example from Ian Horrocks, U Manchester, UK)

CSE-291: Ontologies in Data & Process Integration Scientific Example: Domain Map for SYNAPSE and NCMIR Domain Map = labeled graph with concepts ("classes") and roles ("associations") additional semantics: expressed as logic rules Domain Map = labeled graph with concepts ("classes") and roles ("associations") additional semantics: expressed as logic rules Domain Map (DM) Purkinje cells and Pyramidal cells have dendrites that have higher-order branches that contain spines. Dendritic spines are ion (calcium) regulating components. Spines have ion binding proteins. Neurotransmission involves ionic activity (release). Ion-binding proteins control ion activity (propagation) in a cell. Ion-regulating components of cells affect ionic activity (release). Domain Expert Knowledge DM in Description Logic

CSE-291: Ontologies in Data & Process Integration Source Contextualization & DM Refinement Source Contextualization & DM Refinement In addition to registering (“hanging off”) data relative to existing concepts, a source may also refine the mediator’s domain map...  sources can register new concepts at the mediator...

CSE-291: Ontologies in Data & Process Integration Introduction to Description Logics (aka terminological logics, member of concept languages)

CSE-291: Ontologies in Data & Process Integration Roots “Structured Inheritance Networks” [Brachman 1977]“Structured Inheritance Networks” [Brachman 1977] KL-ONE [Brachman, Schmolze 1985]KL-ONE [Brachman, Schmolze 1985] Core ideas:Core ideas: –Building blocks: atomic concepts (unary predicates), atomic roles (binary predicates), individuals (constants) –Constructors for building complex concepts and roles from simpler ones –Automated inference for concept subsumption and instance classification (is-a/is-instance-of are not explicitly given by the user, but inferred from concept definitions/instance properties)

CSE-291: Ontologies in Data & Process Integration Source: Description Logics Tutorial, Ian Horrocks and Ulrike Sattler, ECAI-2002, Lyon, France, July 23rd, 2002

CSE-291: Ontologies in Data & Process Integration Knowledge Base (DL-Style) Terminological Knowledge (TBox)Terminological Knowledge (TBox) –Concept Definition (naming of concepts): –Axiom (constraining of concepts): => a mediators “glue knowledge source” Assertional Knowledge (ABox) about IndividualsAssertional Knowledge (ABox) about Individuals –n27_img118 : Neuron => the concrete instances/individuals of the concepts/classes that your sources export

CSE-291: Ontologies in Data & Process Integration Example TBox Atomic concepts = {P,F,W, M1,…} Base concepts = {P,F} Defined concepts = {W, M1, M2, …} Roles = {h1,h2} Concept Definition Axiom where A atomic concept, C, D complex concept expressions C, D complex concept expressions

CSE-291: Ontologies in Data & Process Integration Example TBox Base concepts = {Person, Female} Base concepts = {Person, Female} … occur on the RHS only Defined concepts = {P, F, W, …} Defined concepts = {P, F, W, …} … occur on the LHS (& maybe RHS) Base interpretation J: interpret base concepts only Base interpretation J: interpret base concepts only Extension I of J: on same domain as J and agrees (on base) with J Extension I of J: on same domain as J and agrees (on base) with J TBox T is definitorial if every base interpretation has exactly one extension that is a model of T TBox T is definitorial if every base interpretation has exactly one extension that is a model of T

CSE-291: Ontologies in Data & Process Integration Exercise: Starting with the base interpretation of I(Person) := “the class of persons” I(Person) := “the class of persons” I(Female) := “the class of females” I(Female) := “the class of females” … what is the meaning of the defined concepts? … what role play the roles in this process?

CSE-291: Ontologies in Data & Process Integration Example TBox atomic conceptatomic concept concept def. w/ intersectionconcept def. w/ intersection … plus negation… plus negation … existential restriction… existential restriction … value restriction… value restriction

CSE-291: Ontologies in Data & Process Integration Digression: “Sparrow” (Prolog) Syntax for DL Sparrow “Grammar” and “Parser” Example in Sparrow Syntax

CSE-291: Ontologies in Data & Process Integration Back to Reasoning with the Family... concept definition: MyConcept  DL-formulaconcept definition: MyConcept  DL-formula concept inclusion: MyConcept  DL-formulaconcept inclusion: MyConcept  DL-formula finite set of definitions is a terminology or TBox if for every atomic concept A there is at most one axiom whose lhs is Afinite set of definitions is a terminology or TBox if for every atomic concept A there is at most one axiom whose lhs is A

CSE-291: Ontologies in Data & Process Integration Definitorial Terminologies In a Tbox T we distinguish: primitive concepts (occurring only on rhs) and defined concepts (occurring on lhs)In a Tbox T we distinguish: primitive concepts (occurring only on rhs) and defined concepts (occurring on lhs) T is definitorial if every interpretation of primitive concepts yields exactly one model of T (and thus for the defined concepts)T is definitorial if every interpretation of primitive concepts yields exactly one model of T (and thus for the defined concepts)  meaning of defined concepts is fixed once the primitive concepts are interpreted ! A directly uses B in T if B appears in the rhs of the definition of AA directly uses B in T if B appears in the rhs of the definition of A A uses B is the transitive closure of ‘directly uses’A uses B is the transitive closure of ‘directly uses’ T is cyclic if A uses A for some A; else acyclicT is cyclic if A uses A for some A; else acyclic One can show: If T is acyclic then T is definitorial What about this one? What about this one?

CSE-291: Ontologies in Data & Process Integration Expansion of Terminologies For acyclic T we can “unfold” concept definitions until every defined concepts is specified in terms of primitive concepts onlyFor acyclic T we can “unfold” concept definitions until every defined concepts is specified in terms of primitive concepts only  the expansion of a TBox T Example:Example:

CSE-291: Ontologies in Data & Process Integration Acyclic Terminologies Source: F. Baader, W. Nutt. Basic Description Logics. In Description Logic Handbook, edited by F. Baader, et al, 2002

CSE-291: Ontologies in Data & Process Integration Reasoning in the Tableaux calculus TBox Expansion From this We want to show this In First-order (LeanTap) syntax

CSE-291: Ontologies in Data & Process Integration LeanTap Demo

CSE-291: Ontologies in Data & Process Integration Source: Description Logics Tutorial, Ian Horrocks and Ulrike Sattler, ECAI-2002, Lyon, France, July 23rd, 2002

CSE-291: Ontologies in Data & Process Integration Source: Description Logics Tutorial, Ian Horrocks and Ulrike Sattler, ECAI-2002, Lyon, France, July 23rd, 2002

CSE-291: Ontologies in Data & Process Integration Source: Description Logics Tutorial, Ian Horrocks and Ulrike Sattler, ECAI-2002, Lyon, France, July 23rd, 2002

CSE-291: Ontologies in Data & Process Integration Source: Description Logics Tutorial, Ian Horrocks and Ulrike Sattler, ECAI-2002, Lyon, France, July 23rd, 2002

CSE-291: Ontologies in Data & Process Integration Source: Description Logics Tutorial, Ian Horrocks and Ulrike Sattler, ECAI-2002, Lyon, France, July 23rd, 2002

CSE-291: Ontologies in Data & Process Integration Source: Description Logics Tutorial, Ian Horrocks and Ulrike Sattler, ECAI-2002, Lyon, France, July 23rd, 2002

CSE-291: Ontologies in Data & Process Integration Source: Description Logics Tutorial, Ian Horrocks and Ulrike Sattler, ECAI-2002, Lyon, France, July 23rd, 2002