Approximate Inference Techniques and Their Applications to the Semantic Web Perry Groot IPA Fall days, 26 November 2004.

Slides:



Advertisements
Similar presentations
Anytime reasoning by Ontology Approximation S.Schlobach, E.Blaauw, M.El Kebir, A.ten Teije, F.van Harmelen, S.Bortoli, M.Hobbelman, K.Millian, Y.Ren, S.Stam,,
Advertisements

Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec Yuan Ren, Kees van Deemter and Jeff.
Query Answering based on Standard and Extended Modal Logic Evgeny Zolin The University of Manchester
Modal Logic with Variable Modalities & its Applications to Querying Knowledge Bases Evgeny Zolin The University of Manchester
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.
Logics for Data and Knowledge Representation Modeling Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia, Rui Zhang.
CPSC 322, Lecture 20Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Computer Science cpsc322, Lecture 20 (Textbook.
Description Logics. Outline Knowledge Representation Knowledge Representation Ontology Language Ontology Language Description Logics Description Logics.
Part 6: Description Logics. Languages for Ontologies In early days of Artificial Intelligence, ontologies were represented resorting to non-logic-based.
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.
LDK R Logics for Data and Knowledge Representation Description Logics as query language.
Ontology Matching Basics Ontology Matching by Jerome Euzenat and Pavel Shvaiko Parts I and II 11/6/2012Ontology Matching Basics - PL, CS 6521.
Reasoning the FMA Ontologies with TrOWL Jeff Z. Pan, Yuan Ren, Nophadol Jekjantuk, and Jhonatan Garcia University of Aberdeen, UK ORE2013.
Knowledge Interchange Format Michael Gruninger National Institute of Standards and Technology
An Introduction to Description Logics. What Are Description Logics? A family of logic based Knowledge Representation formalisms –Descendants of semantic.
Tableau Algorithm.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
USCISIUSCISI Background Description Logic Systems Thomas Russ.
Using the TBox to Optimise SPARQL Queries Birte Glimm Yevgeny Kazakov Ilianna Kollia and Giorgos Stamou CS 848 Paper Critique Vishnu Prathish.
LDK R Logics for Data and Knowledge Representation ClassL (part 3): Reasoning with an ABox 1.
Presented by:- Somya Gupta( ) Akshat Malu ( ) Swapnil Ghuge ( ) Franz Baader, Ian Horrocks, and Ulrike Sattler.
Topics in artificial intelligence 1/1 Dr hab. inż. Joanna Józefowska, prof. PP Reasoning and search techniques.
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.
Semantics: A Many-Splendored Thing Amicalola Lodge 3-5 April 2002 Mike Uschold Mathematics and Computing Technology Boeing Phantom Works.
Updating ABoxes in DL-Lite D. Calvanese, E. Kharlamov, W. Nutt, D. Zheleznyakov Free University of Bozen-Bolzano AMW 2010, May 2010.
LDK R Logics for Data and Knowledge Representation PL of Classes.
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.
Using Fuzzy DLs to Enhance Semantic Image Analysis S. Dasiopoulou, I. Kompatsiaris, M.G.Strintzis 3 rd International Conference on Semantic and Digital.
9/30/98 Prof. Richard Fikes Inference In First Order Logic Computer Science Department Stanford University CS222 Fall 1998.
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.
Logics for Data and Knowledge Representation Exercises: ClassL Fausto Giunchiglia, Rui Zhang and Vincenzo Maltese.
LDK R Logics for Data and Knowledge Representation ClassL (part 2): Reasoning with a TBox 1.
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
Knowledge Repn. & Reasoning Lec #11+13: Frame Systems and Description Logics UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2004.
Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec Yuan Ren, Kees van Deemter and Jeff.
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
Of 29 lecture 15: description logic - introduction.
LDK R Logics for Data and Knowledge Representation Description Logics: family of languages.
Ontology Technology applied to Catalogues Paul Kopp.
Artificial Intelligence Logical Agents Chapter 7.
LDK R Logics for Data and Knowledge Representation Description Logics.
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.
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
ece 720 intelligent web: ontology and beyond
Introduction to Description Logics
Logics for Data and Knowledge Representation
Updating TBoxes in DL-Lite
OWL-S: Experiences and Directions, 6th of June, Austria, 2007
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
CS 416 Artificial Intelligence
Description Logics.
Logics for Data and Knowledge Representation
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:

Approximate Inference Techniques and Their Applications to the Semantic Web Perry Groot IPA Fall days, 26 November 2004

IPA Perry Groot Motivation behind Approximation Reducing complexity  Reasoning under time pressure  Reasoning with other limited resources Reduce/increase number of solutions Reasoning that is not “perfect” but “good enough”

IPA Perry Groot Anytime Reasoning Computation time Quality output

IPA Perry Groot Types of Approximation Numerical Logical  Soundness  Completeness

IPA Perry Groot The purpose of this review is to remind operators of the existence of the Operations Manual Bulletin 80-1, which provides information regarding flight operations with low fuel quantities, and to provide supplementary information regarding main tank boost pump low pressure indications.747 FUEL PUMP LOW PRESSURE INDICATIONS When operating 747 airplanes with low fuel quantities for short Shared Hydraulics Repository (SHR) (pump has (superclasses (mechanical-device)) (text-def (“A device for …”)) (thesaurus-term (|Pumps|))) (every pump has (physical-parts (piston, valve, cylinder)) (device-purpose (Pumping-A-Fluid))) Hey, I know this ontology, so now I know something about Fuel Pump. What the heck is a Fuel Pump? Semantic Markup has (superclasses SHR: pump)) ( fuel-pump FUEL PUMP Machine Processible Semantics © Mike Ushold

IPA Perry Groot KB Architecture TBox ABox Reasoning Description Language Query

IPA Perry Groot C A A C D R.C R. C A A C D R.C R.C C A A C C D C D R.C R.C Description Logics

IPA Perry Groot WomanPerson Female ManPerson Woman MotherWoman hasChild.Person Mother(MARY), hasChild(MARY, PETER) TBox + ABox

IPA Perry Groot Reasoning Satisfiability Subsumption Classification Concept/Instance retrieval Instance realization

IPA Perry Groot Application: Individual Retrieval (I) Retrieval Process 1. Classify Query Q   Q

IPA Perry Groot Application: Individual Retrieval (II) Retrieval Process 1. Classify Query Q 2. Select Instances from subsumed classes 3. Q

IPA Perry Groot Application: Individual Retrieval (III) Retrieval Process 1. Classify Query Q 2. Select Instances from subsumed classes 3. Realize instances from direct parents, if they belong to Q Q

IPA Perry Groot KB Architecture TBox ABox Reasoning Description Language Query Language Weakening Approximate Deduction Knowledge Compilation

IPA Perry Groot Approximate Entailment Two approximate entailment operators [Schaerf & Cadoli, 1995]  S-1-Entailment: Complete but unsound  S-3-Entailment: Sound but incomplete Propositional Theory  Underlying finite language L  Subset S of L used as parameter

IPA Perry Groot Approximate Entailment S-1-entailment: interpret everything outside of S as false S-3-entailment: interpret everything outside of S as true (or normal) S L x¬x¬x S1 S3 0/01/1 1/0 0/1

IPA Perry Groot Approximate Entailment S1S1 L S2S2 L S3S3 L S n = L Anytime behaviour when S i is increased Previous steps can be reused

IPA Perry Groot Approximate Entailment Semantically well-founded Computationally attractive Improvable Dual Flexible

IPA Perry Groot Approximate Entailment Unclear effect Parameter S is crucial for approximate behaviour Almost no quantitative analysis

IPA Perry Groot Approximation for DLs Elements: Concept expressions Task: Satisfiability checking Approximation: “Simpler” concept expr.  Stronger (more specific)  Weaker (less specific) - Unsatisfiability of D implies unsatisfiability of C - Satisfiability of C implies satisfiability of D

IPA Perry Groot Approximation for DLs Depth of subconcept D: number of universal quantifiers that have D in its scope. Depth: 0Depth: 1Depth: 2

IPA Perry Groot Approximation for DLs C i : Replace every existentially quantified subconcept D of depth greater or equal than i by. C = C 0 = C 1 =

IPA Perry Groot Approximating Subsumption Level := 0 Compute Level := Level+1 Unsatisfiable? Max Level? t f ft TRUE FALSE

Thank you for your attention