Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall 2005 1 Description Logics: Logic foundation of Semantic Web Semantic.

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

Knowledge Representation and Reasoning using Description Logic Presenter Shamima Mithun.
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
Ontological Logic Programming by Murat Sensoy, Geeth de Mel, Wamberto Vasconcelos and Timothy J. Norman Computing Science, University of Aberdeen, UK 1.
1 A Description Logic with Concrete Domains CS848 presentation Presenter: Yongjuan Zou.
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.
Description Logics. Outline Knowledge Representation Knowledge Representation Ontology Language Ontology Language Description Logics Description Logics.
Chapter 7 Reasoning about Knowledge by Neha Saxena Id: 13 CS 267.
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
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
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.
Tableau Algorithm.
CSE-291: Ontologies in Data & Process Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies.
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.
Description Logics. What Are Description Logics? A family of logic based KR formalisms – Descendants of semantic networks and KL-ONE – Describe domain.
LDK R Logics for Data and Knowledge Representation Modeling First version by Alessandro Agostini and Fausto Giunchiglia Second version by Fausto Giunchiglia.
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Semantic Web Towards a Web of Knowledge - Introduction.
Presented by:- Somya Gupta( ) Akshat Malu ( ) Swapnil Ghuge ( ) Franz Baader, Ian Horrocks, and Ulrike Sattler.
An Introduction to Description Logics (chapter 2 of DLHB)
Logics for Data and Knowledge Representation Exercises: DL.
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Knowledge Representation Semantic Web - Fall 2005 Computer.
LDK R Logics for Data and Knowledge Representation Description Logics (ALC)
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 13 of 41 Monday, 20 September.
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.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
LDK R Logics for Data and Knowledge Representation Description Logics.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
CS6133 Software Specification and Verification
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.
A Preferential Tableau for Circumscriptive ALCO RR 2009 Stephan Grimm Pascal Hitzler.
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
CSE-291: Ontologies in Data Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies in Data Integration.
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
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.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2011 Adina Magda Florea
Of 29 lecture 15: description logic - introduction.
Logics for Data and Knowledge Representation Exercises: DL.
LDK R Logics for Data and Knowledge Representation Description Logics: family of languages.
Computing & Information Sciences Kansas State University Wednesday, 04 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 17 of 42 Wednesday, 04 October.
Knowledge Representation and Inference Dr Nicholas Gibbins 32/3019.
Artificial Intelligence Logical Agents Chapter 7.
LDK R Logics for Data and Knowledge Representation Description Logics.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 16 Description Logic.
Logics for Data and Knowledge Representation
Description Logics.
ece 720 intelligent web: ontology and beyond
Introduction to Description Logics
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
CSE 4705 Artificial Intelligence
Logics for Data and Knowledge Representation
Description Logics.
Logics for Data and Knowledge Representation
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:

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description Logics: Logic foundation of Semantic Web Semantic Web - Fall 2005 Computer Engineering Department Sharif University of Technology

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Outline  First order logic and Models  Introduction to Description Logics  Reasoning on Description Logics

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Prepositional Logic

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Truth Tables

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall First Order Logic (FOL)

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Models

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Important Equivalences

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Example of a model

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Knowledge Representation with FOL

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Knowledge Representation with FOL

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall What Are Description Logics?  A family of logic based Knowledge Representation formalisms Based on concepts and roles  Concepts are interpreted as sets of objects.  Roles are interpreted as binary relations between objects. Descendants of semantic networks and KL-ONE  Key features of DLs are: Formal semantics  Decidable fragments of FOL  Closely related to Propositional Modal & Dynamic Logics Provision of inference services  Sound and complete decision procedures for key problems  Implemented systems (highly optimised)  Trade-off between expressive power and computational complexity.

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description Logic Family  Particular languages mainly characterised by: Set of constructors for building complex concepts and roles from simpler ones. Set of axioms for asserting facts about concepts, roles and individuals. Simplest logic in this family is named AL Others are specified by adding some suffixes like U  NC : ALC ALCU …

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description logic AL

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Fundamental Equivalences

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Interpretation (model)

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Example of a model

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall AL Constructors at Work

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Additional Constructors (1)

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Additional Constructors (2)

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall  The “Happy Father” concept:  A person who has at most one child or has at least 3 children from which at least one of them is female. Some Examples

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Some more examples! Π

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Classes

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Semantic Networks

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Rule Constructors

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Examples  Expressing what we stated in slides 9 and 10 with DL: There is a lecturer who teaches INFS4201 Guido teaches every course Bob teaches some courses

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall DL as fragments of Predicate Logic

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Lisp like style for DL

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Normal Forms

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Representing Knowledge in DL

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall DL Architecture

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Terminologies or TBoxes

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Terminologies or Tboxes (cont.)

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Reasoning about TBoxes

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Reduction to Subsumption

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Reduction to Unsatisfiability

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Reducing Unsatisfiability

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Inference services

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Inference service: concept satisfiability

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Inference services based on satisfiability

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Inference service: concept subsumption

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Concept examples

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Example taxonomy

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall World description: ABox

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall ABox inference services

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Abox inference services (cont.)

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall ABox example

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall TBox taxonomy plus individuals

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Open world assumption

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Reasoning Procedures

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Structural Subsumption

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Examples

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Example (do it yourself !)

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Tableaux  The Tableaux Algorithm is a decision procedure solving the problem of satisfiability.  If a formula is satisfiable, the procedure will constructively exhibit a model of the formula.  The basic idea is to incrementally build the model by looking at the formula, by decomposing it in a top/down fashion. The procedure exhaustively looks at all the possibilities, so that it can eventually prove that no model could be found for unsatisfiable formulas.

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Tableaux Algorithm

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Negation Normal Form

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Completion Rules: the AND rule

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall The AND rule

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall The OR rule

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall The SOME rule

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall The FORALL rule

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Clash

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Completion rules for the logic ALC

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Example inference

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Example inference

Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall References  Chapters 1 and 2 of DLHB.