Knowledge Representation and Description Logic Part 2
|
|
- Melvin Fleming
- 5 years ago
- Views:
Transcription
1 Knowledge Representation and Description Logic Part 2 Renata Wassermann renata@ime.usp.br Computer Science Department University of São Paulo September 2014 IAOA School Vitória Renata Wassermann Knowledge Representation and Description Logic Part 2 1 / 40
2 Interpretations - Blocks world A Green B C Non green Is there a green block directly on top of a non-green one? Renata Wassermann Knowledge Representation and Description Logic Part 2 2 / 40
3 Interpretations - Blocks world A Green B C Non green S = {On(a,b), On(b,c), Green(a), Green(c)} Renata Wassermann Knowledge Representation and Description Logic Part 2 3 / 40
4 Interpretations - Blocks world A Green B C Non green S = {On(a,b), On(b,c), Green(a), Green(c)} α = x y(green(x) Green(y) On(x,y)) Renata Wassermann Knowledge Representation and Description Logic Part 2 3 / 40
5 Interpretations - Blocks world A Green B C Non green S = {On(a,b), On(b,c), Green(a), Green(c)} α = x y(green(x) Green(y) On(x,y)) S =α? Renata Wassermann Knowledge Representation and Description Logic Part 2 3 / 40
6 Exercise on interpretations (Brachman & Levesque) For each of the following sentences, give a logical interpretation that makes that sentence false and the other two sentences true: (a) x y z((p(x, y) P(y, z)) P(x, z)) (b) x y((p(x, y) P(y, x)) x = y) (c) x y(p(a, y) P(x, b)) Renata Wassermann Knowledge Representation and Description Logic Part 2 4 / 40
7 (a) x y z((p(x, y) P(y, z)) P(x, z)) (b) x y((p(x, y) P(y, x)) x = y) (c) x y(p(a, y) P(x, b)) I = D, I D = {d 1, d 2, d 3 } I [P] = {(d 1, d 2 ), (d 2, d 3 )} I [a] = d 3 I [b] = d 2 Renata Wassermann Knowledge Representation and Description Logic Part 2 5 / 40
8 (a) x y z((p(x, y) P(y, z)) P(x, z)) (b) x y((p(x, y) P(y, x)) x = y) (c) x y(p(a, y) P(x, b)) I = D, I D = {d 1, d 2 } I [P] = {(d 1, d 2 ), (d 2, d 1 ), (d 1, d 1 ), (d 2, d 2 )} = DÖD I [a] = d 1 I [b] = d 2 Renata Wassermann Knowledge Representation and Description Logic Part 2 6 / 40
9 (a) x y z((p(x, y) P(y, z)) P(x, z)) (b) x y((p(x, y) P(y, x)) x = y) (c) x y(p(a, y) P(x, b)) I = D, I D = {d 1, d 2 } I [P] = {(d 1, d 2 )} I [a] = d 1 I [b] = d 1 Renata Wassermann Knowledge Representation and Description Logic Part 2 7 / 40
10 Deductive Inference Process of finding entailments of KB. Renata Wassermann Knowledge Representation and Description Logic Part 2 8 / 40
11 Deductive Inference Process of finding entailments of KB. Process is sound if whenever it produces α, then KB = α Renata Wassermann Knowledge Representation and Description Logic Part 2 8 / 40
12 Deductive Inference Process of finding entailments of KB. Process is sound if whenever it produces α, then KB = α Process is complete if whenever KB = α, it produces α Renata Wassermann Knowledge Representation and Description Logic Part 2 8 / 40
13 Satisfiability KB = α iff KB { α} has no model Renata Wassermann Knowledge Representation and Description Logic Part 2 9 / 40
14 Satisfiability KB = α iff KB { α} has no model Undecidable for first-order logic! Renata Wassermann Knowledge Representation and Description Logic Part 2 9 / 40
15 Satisfiability KB = α iff KB { α} has no model Undecidable for first-order logic! If we want to have inference procedures that always give an answer, tradeoff expressivity for tractability. Renata Wassermann Knowledge Representation and Description Logic Part 2 9 / 40
16 What are DLs? (Horrocks) Family of logic-based knowledge representation formalisms well-suited for the representation of and reasoning about terminological knowledge descendants of semantics networks, frame-based systems, and KL-ONE aka terminological KR systems, concept languages, etc. Renata Wassermann Knowledge Representation and Description Logic Part 2 10 / 40
17 Brief history of Description Logics Semantic Networks Peirce 1909: Logic of the future Quillian s thesis 60s: Semantic memory The meaning of a concept comes from its relationship to other concepts The information is stored by interconnecting nodes with labelled arcs. Cat Fish is a lives in Mammal Water Renata Wassermann Knowledge Representation and Description Logic Part 2 11 / 40
18 Brief history of Description Logics Semantic Networks Vertebra Cat has Fur has is a has is a is a Animal Mammal Bear is a Fish is a Whale Water lives in lives in Renata Wassermann Knowledge Representation and Description Logic Part 2 12 / 40
19 Brief history of Description Logics Woods What s in a link? (1975) cat colour black Renata Wassermann Knowledge Representation and Description Logic Part 2 13 / 40
20 Brief history of Description Logics Woods What s in a link? (1975) cat colour black All cats are all black. Renata Wassermann Knowledge Representation and Description Logic Part 2 13 / 40
21 Brief history of Description Logics Woods What s in a link? (1975) cat colour black All cats are all black. All cats have some colour black. Renata Wassermann Knowledge Representation and Description Logic Part 2 13 / 40
22 Brief history of Description Logics Woods What s in a link? (1975) cat colour black All cats are all black. All cats have some colour black. There is a cat which is all black. Renata Wassermann Knowledge Representation and Description Logic Part 2 13 / 40
23 Brief history of Description Logics Woods What s in a link? (1975) cat colour black All cats are all black. All cats have some colour black. There is a cat which is all black. There is a cat which has some colour black. Renata Wassermann Knowledge Representation and Description Logic Part 2 13 / 40
24 Brief history of Description Logics KL-ONE Brachman s thesis, Harvard, 1977 William A. Woods, James G. Schmolze, The KL-ONE family, 1992 Used by companies and research institutes. Focus on NLP. Semantics must be clear. Concept structuring primitives. Basis for what comes next... Renata Wassermann Knowledge Representation and Description Logic Part 2 14 / 40
25 Brief history of Description Logics KL-ONE Separate terminological and assertional knowledge External meaning of is a (sets and instances) Multiple inheritance Allows for automatic classification Renata Wassermann Knowledge Representation and Description Logic Part 2 15 / 40
26 Brief history of Description Logics KL-ONE Separate terminological and assertional knowledge External meaning of is a (sets and instances) Multiple inheritance Allows for automatic classification Example: infer that Woman with sons is more specific than Woman with children Renata Wassermann Knowledge Representation and Description Logic Part 2 15 / 40
27 Brief history of Description Logics The beginning of the modern era The Tractability of Subsumption in Frame-Based Description Languages, Brachman and Levesque, Here we present evidence as to how the cost of computing one kind of inference is directly related to the expressiveness of the representation language. As it turns out, this cost is perilously sensitive to small changes in the representation language. Even a seemingly simple frame-based description language can pose intractable computational obstacles. Renata Wassermann Knowledge Representation and Description Logic Part 2 16 / 40
28 Main ideas DL Knowledge Base Description of the concepts and their properties Description of concrete situations. Renata Wassermann Knowledge Representation and Description Logic Part 2 17 / 40
29 Main ideas Concepts Represent classes (sets) May be atomic or constructed from other concepts: Female Female Human Renata Wassermann Knowledge Representation and Description Logic Part 2 18 / 40
30 Main ideas Roles Represent relations (properties) May be used to restrict concepts: Female Human haschild.female Female haschild.human Renata Wassermann Knowledge Representation and Description Logic Part 2 19 / 40
31 Main ideas TBox A TBox contains the terminological knowledge: Concept definitions (introduce names for concepts): Father Man haschild. Axioms (restrict models): Mother Woman BlackCat Cat hascolour.black Renata Wassermann Knowledge Representation and Description Logic Part 2 20 / 40
32 Main ideas ABox The ABox contains assertions about individuals: Concept assertions: BlackCat(mimi) Mother haschild.woman(mary) Role assertions: haschild(mary,betty) Renata Wassermann Knowledge Representation and Description Logic Part 2 21 / 40
33 The typical language Attributive Concept Language with Complements (Schmidt-Schauß and Smolka, 1991). Concept construction closed under boolean operations. Basis for more expressive languages. Renata Wassermann Knowledge Representation and Description Logic Part 2 22 / 40
34 Syntax Concepts C, D A C C D C D R.C R.C Renata Wassermann Knowledge Representation and Description Logic Part 2 23 / 40
35 Semantics Interpretations I: I (domain of interpretation) function that assigns to each: A, a set A I I r, a binary relation R I I I. a, an element a I I Renata Wassermann Knowledge Representation and Description Logic Part 2 24 / 40
36 Semantics Extending the interpretation function I = I I = ( C) I = I \C I (C D) I = C I D I (C D) I = C I D I ( R.C) I = {a I b.(a, b) R I b C I } ( R.C) I = {a I b.(a, b) R I b C I } Renata Wassermann Knowledge Representation and Description Logic Part 2 25 / 40
37 Semantics Semantics of the TBox An interpretation I satisfies C D iff C I = D I. C D iff C I D I. a TBox T iff it satisfies all elements of T Renata Wassermann Knowledge Representation and Description Logic Part 2 26 / 40
38 Semantics Semantics of the ABox An interpretation I satisfies C(a) iff a I C I. r(a, b) iff (a I, b I ) r I. an ABox A iff it satisfies all elements of A Renata Wassermann Knowledge Representation and Description Logic Part 2 27 / 40
39 Semantics DL Knowledge Base An ALC Knowledge Base is a pair Σ = T, A, where T is a TBox A is an ABox An interpretation I is a model of Σ if it satisfies T and A. A knowledge base Σ is said to be satisfiable if it admits a model. Renata Wassermann Knowledge Representation and Description Logic Part 2 28 / 40
40 Semantics Logical Consequence Σ = ϕ iff every model of Σ is a model of ϕ Renata Wassermann Knowledge Representation and Description Logic Part 2 29 / 40
41 Semantics Logical Consequence Σ = ϕ iff every model of Σ is a model of ϕ teaches.course GraduateStudent Professor teaches(john, cs101) Course(cs101) Professor(john) Renata Wassermann Knowledge Representation and Description Logic Part 2 29 / 40
42 Semantics Logical Consequence Σ = ϕ iff every model of Σ is a model of ϕ teaches.course GraduateStudent Professor teaches(john, cs101) Course(cs101) Professor(john) Σ =GraduateStudent(john) Renata Wassermann Knowledge Representation and Description Logic Part 2 29 / 40
43 Semantics Example (Horrocks) - TBox HogwartsStudent Student attendsschool.hogwarts HogwartsStudent haspet.(owl Cat Toad) haspet.phoenix Wizard Phoenix (Owl Cat Toad) Renata Wassermann Knowledge Representation and Description Logic Part 2 30 / 40
44 Semantics Example (Horrocks) - ABox Facts: HogwartsStudent(harryPotter) Inferences: Renata Wassermann Knowledge Representation and Description Logic Part 2 31 / 40
45 Semantics Example (Horrocks) - ABox Facts: HogwartsStudent(harryPotter) Inferences: attendsschool.hogwarts(harrypotter) Renata Wassermann Knowledge Representation and Description Logic Part 2 31 / 40
46 Semantics Example (Horrocks) - ABox Facts: HogwartsStudent(harryPotter) haspet(harrypotter, hedwig) Inferences: attendsschool.hogwarts(harrypotter) Renata Wassermann Knowledge Representation and Description Logic Part 2 31 / 40
47 Semantics Example (Horrocks) - ABox Facts: HogwartsStudent(harryPotter) haspet(harrypotter, hedwig) Inferences: attendsschool.hogwarts(harrypotter) (Owl Cat Toad)(hedwig) Renata Wassermann Knowledge Representation and Description Logic Part 2 31 / 40
48 Semantics Example (Horrocks) - ABox Facts: HogwartsStudent(harryPotter) haspet(harrypotter, hedwig) Phoenix(fawks) Inferences: attendsschool.hogwarts(harrypotter) (Owl Cat Toad)(hedwig) Renata Wassermann Knowledge Representation and Description Logic Part 2 31 / 40
49 Semantics Example (Horrocks) - ABox Facts: HogwartsStudent(harryPotter) haspet(harrypotter, hedwig) Phoenix(fawks) Inferences: attendsschool.hogwarts(harrypotter) (Owl Cat Toad)(hedwig) haspet(harrypotter,fawks) Renata Wassermann Knowledge Representation and Description Logic Part 2 31 / 40
50 Semantics Example (Horrocks) - ABox Facts: HogwartsStudent(harryPotter) haspet(harrypotter, hedwig) Phoenix(fawks) haspet(dumbledore,fawks) Inferences: attendsschool.hogwarts(harrypotter) (Owl Cat Toad)(hedwig) haspet(harrypotter,fawks) Renata Wassermann Knowledge Representation and Description Logic Part 2 31 / 40
51 Semantics Example (Horrocks) - ABox Facts: HogwartsStudent(harryPotter) haspet(harrypotter, hedwig) Phoenix(fawks) haspet(dumbledore,fawks) Inferences: attendsschool.hogwarts(harrypotter) (Owl Cat Toad)(hedwig) haspet(harrypotter,fawks) Wizard(dumbledore) and HogwartsStudent(dumbledore) Renata Wassermann Knowledge Representation and Description Logic Part 2 31 / 40
52 Semantics Reasoning Services Satisfiability: Checking whether Σ has a model Concept Satisfiability (w.r.t. Σ): Checking whether there is a model I of Σ such that C I Σ = C Student Person Renata Wassermann Knowledge Representation and Description Logic Part 2 32 / 40
53 Semantics Reasoning Services Subsumption (w.r.t. Σ): Checking whether for all models I of Σ, C I D I. Σ = C D Student Person This is the first problem that was studied (classification). For simple logics, solved by structural methods. Renata Wassermann Knowledge Representation and Description Logic Part 2 33 / 40
54 Semantics Reasoning Services Instance Checking (w.r.t. Σ): Checking whether for all models I of Σ, a I C I. Σ = C(a) Renata Wassermann Knowledge Representation and Description Logic Part 2 34 / 40
55 Semantics Reasoning Services Instance Checking (w.r.t. Σ): Checking whether for all models I of Σ, a I C I. Σ = C(a) Retrieval Finding the individuals a s.t. for all models I of Σ, a I C I {a Σ = C(a)} Renata Wassermann Knowledge Representation and Description Logic Part 2 34 / 40
56 Semantics Reasoning Services Instance Checking (w.r.t. Σ): Checking whether for all models I of Σ, a I C I. Σ = C(a) Retrieval Finding the individuals a s.t. for all models I of Σ, a I C I {a Σ = C(a)} Realization Finding the concepts C s.t. for all models I of Σ, a I C I {C Σ = C(a)} Renata Wassermann Knowledge Representation and Description Logic Part 2 34 / 40
57 Semantics Reasoning services All boils down to satisfiability. Renata Wassermann Knowledge Representation and Description Logic Part 2 35 / 40
58 Semantics Reasoning services All boils down to satisfiability. Concept satisfiability: Σ = C Renata Wassermann Knowledge Representation and Description Logic Part 2 35 / 40
59 Semantics Reasoning services All boils down to satisfiability. Concept satisfiability: Σ = C iff Σ {(C)(x)} is satisfiable. Renata Wassermann Knowledge Representation and Description Logic Part 2 35 / 40
60 Semantics Reasoning services All boils down to satisfiability. Concept satisfiability: Σ = C iff Σ {(C)(x)} is satisfiable. Subsumption: Σ = C D Renata Wassermann Knowledge Representation and Description Logic Part 2 35 / 40
61 Semantics Reasoning services All boils down to satisfiability. Concept satisfiability: Σ = C iff Σ {(C)(x)} is satisfiable. Subsumption: Σ = C D iff Σ {(C D)(x)} is not satisfiable. Renata Wassermann Knowledge Representation and Description Logic Part 2 35 / 40
62 Translation into FOL Concepts are translated into formulas with one free variable: t(c D) = t(c) t(d) t( r.c) = yr(x, y) t y (C) t( r.c) = yr(x, y) t y (C) And then axioms C D correspond to x(t(c) t(d)) Renata Wassermann Knowledge Representation and Description Logic Part 2 36 / 40
63 Translation into FOL Cat Mammal xcat(x) Mammal(x) Student haspet.(owl Cat Toad) x(student(x) y (haspet(x,y) (Owl(y) Cat(y) Toad(y)))) Renata Wassermann Knowledge Representation and Description Logic Part 2 37 / 40
64 Below ALC EL C, D A C D R.C Looks rather inexpressive, but: SNOMED, Galen, etc. Renata Wassermann Knowledge Representation and Description Logic Part 2 38 / 40
65 Above ALC SHOIQ S = ALC+ transitive roles H = role hierarchies O = nominals I = inverse of roles Q = qualified number restriction Renata Wassermann Knowledge Representation and Description Logic Part 2 39 / 40
66 Above ALC SHOIQ S = ALC+ transitive roles (ancestor) H = role hierarchies O = nominals I = inverse of roles Q = qualified number restriction Renata Wassermann Knowledge Representation and Description Logic Part 2 39 / 40
67 Above ALC SHOIQ S = ALC+ transitive roles (ancestor) H = role hierarchies (hasson haschild) O = nominals I = inverse of roles Q = qualified number restriction Renata Wassermann Knowledge Representation and Description Logic Part 2 39 / 40
68 Above ALC SHOIQ S = ALC+ transitive roles (ancestor) H = role hierarchies (hasson haschild) O = nominals ({hogwarts}) I = inverse of roles Q = qualified number restriction Renata Wassermann Knowledge Representation and Description Logic Part 2 39 / 40
69 Above ALC SHOIQ S = ALC+ transitive roles (ancestor) H = role hierarchies (hasson haschild) O = nominals ({hogwarts}) I = inverse of roles (ispetof = haspet 1 ) Q = qualified number restriction Renata Wassermann Knowledge Representation and Description Logic Part 2 39 / 40
70 Above ALC SHOIQ S = ALC+ transitive roles (ancestor) H = role hierarchies (hasson haschild) O = nominals ({hogwarts}) I = inverse of roles (ispetof = haspet 1 ) Q = qualified number restriction (> 3hasChild.Male) Renata Wassermann Knowledge Representation and Description Logic Part 2 39 / 40
71 Above ALC OWL Web Ontology Language W3C standard for ontologies since 2004 Based on SHOIQ XML syntax Renata Wassermann Knowledge Representation and Description Logic Part 2 40 / 40
Structured Descriptions & Tradeoff Between Expressiveness and Tractability
5. Structured Descriptions & Tradeoff Between Expressiveness and Tractability Outline Review Expressiveness & Tractability Tradeoff Modern Description Logics Object Oriented Representations Key Representation
More informationAn Introduction to Description Logics
An Introduction to Description Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, 21.11.2013 Marco Cerami (UPOL) Description Logics 21.11.2013
More informationDescription Logics. an introduction into its basic ideas
Description Logics an introduction into its basic ideas A. Heußner WS 2003/2004 Preview: Basic Idea: from Network Based Structures to DL AL : Syntax / Semantics Enhancements of AL Terminologies (TBox)
More informationAn Introduction to Description Logic III
An Introduction to Description Logic III Knowledge Bases and Reasoning Tasks Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014
More informationKnowledge Representation and Description Logic Part 3
Knowledge Representation and Description Logic Part 3 Renata Wassermann renata@ime.usp.br Computer Science Department University of São Paulo September 2014 IAOA School Vitória Renata Wassermann Knowledge
More informationChapter 2 Background. 2.1 A Basic Description Logic
Chapter 2 Background Abstract Description Logics is a family of knowledge representation formalisms used to represent knowledge of a domain, usually called world. For that, it first defines the relevant
More informationLogics for Data and Knowledge Representation
Logics for Data and Knowledge Representation 4. Introduction to Description Logics - ALC Luciano Serafini FBK-irst, Trento, Italy October 9, 2012 Origins of Description Logics Description Logics stem from
More informationPhase 1. Phase 2. Phase 3. History. implementation of systems based on incomplete structural subsumption algorithms
History Phase 1 implementation of systems based on incomplete structural subsumption algorithms Phase 2 tableau-based algorithms and complexity results first tableau-based systems (Kris, Crack) first formal
More informationDescription Logics. Glossary. Definition
Title: Description Logics Authors: Adila Krisnadhi, Pascal Hitzler Affil./Addr.: Wright State University, Kno.e.sis Center 377 Joshi Research Center, 3640 Colonel Glenn Highway, Dayton OH 45435, USA Phone:
More informationIntroduzione alle logiche descrittive
Introduzione alle logiche descrittive I principali formalismi di KR Reti semantiche Sistemi a Frame Sistemi di Produzione FOL (First Order Logic) e vari altri linguaggi logici Logiche descrittive Le logiche
More informationOPPA European Social Fund Prague & EU: We invest in your future.
OPPA European Social Fund Prague & EU: We invest in your future. Description Logics Petr Křemen petr.kremen@fel.cvut.cz FEL ČVUT 39 / 157 Our plan Towards Description Logics ALC Language 40 / 157 Towards
More informationRestricted role-value-maps in a description logic with existential restrictions and terminological cycles
Restricted role-value-maps in a description logic with existential restrictions and terminological cycles Franz Baader Theoretical Computer Science, Dresden University of Technology D-01062 Dresden, Germany
More informationLightweight Description Logics: DL-Lite A and EL ++
Lightweight Description Logics: DL-Lite A and EL ++ Elena Botoeva 1 KRDB Research Centre Free University of Bozen-Bolzano January 13, 2011 Departamento de Ciencias de la Computación Universidad de Chile,
More informationDescription Logics. Adrian Groza. Department of Computer Science Technical University of Cluj-Napoca
Description Logics Adrian Groza Department of Computer Science Technical University of Cluj-Napoca Outline 1 The World as a Graph 2 Description Logics Family Ontology Description Logics How far can we
More informationDescription Logics (DLs)
OWL Three species of OWL OWL full is union of OWL syntax and RDF (Undecidable) OWL DL restricted to FOL fragment (decidable in NEXPTIME) OWL Lite is easier to implement subset of OWL DL (decidable in EXPTIME)
More informationALC Concept Learning with Refinement Operators
ALC Concept Learning with Refinement Operators Jens Lehmann Pascal Hitzler June 17, 2007 Outline 1 Introduction to Description Logics and OWL 2 The Learning Problem 3 Refinement Operators and Their Properties
More informationDESCRIPTION LOGICS. Paula Severi. October 12, University of Leicester
DESCRIPTION LOGICS Paula Severi University of Leicester October 12, 2009 Description Logics Outline Introduction: main principle, why the name description logic, application to semantic web. Syntax and
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Semantic Networks and Description Logics II: Description Logics Terminology and Notation Bernhard Nebel, Felix Lindner, and Thorsten Engesser November 23, 2015
More informationMathematical Logics Description Logic: Introduction
Mathematical Logics Description Logic: Introduction Fausto Giunchiglia and Mattia Fumagallli University of Trento *Originally by Luciano Serafini and Chiara Ghidini Modified by Fausto Giunchiglia and Mattia
More informationA RESOLUTION DECISION PROCEDURE FOR SHOIQ
A RESOLUTION DECISION PROCEDURE FOR SHOIQ Yevgeny Kazakov and Boris Motik The University of Manchester August 20, 2006 SHOIQ IS A DESCRIPTION LOGIC! Yevgeny Kazakov and Boris Motik A Resolution Decision
More informationDescription logics. Description Logics. Applications. Outline. Syntax - AL. Tbox and Abox
Description Logics Description logics A family of KR formalisms, based on FOPL decidable, supported by automatic reasoning systems Used for modelling of application domains Classification of concepts and
More informationFuzzy Description Logics
Fuzzy Description Logics 1. Introduction to Description Logics Rafael Peñaloza Rende, January 2016 Literature Description Logics Baader, Calvanese, McGuinness, Nardi, Patel-Schneider (eds.) The Description
More informationInverting Proof Systems for Secrecy under OWA
Inverting Proof Systems for Secrecy under OWA Giora Slutzki Department of Computer Science Iowa State University Ames, Iowa 50010 slutzki@cs.iastate.edu May 9th, 2010 Jointly with Jia Tao and Vasant Honavar
More informationModular Reuse of Ontologies: Theory and Practice
Journal of Artificial Intelligence Research 31 (2008) 273-318 Submitted 07/07; published 02/08 Modular Reuse of Ontologies: Theory and Practice Bernardo Cuenca Grau Ian Horrocks Yevgeny Kazakov Oxford
More informationMathematical Logics Description Logic: Tbox and Abox
Mathematical Logics Description Logic: Tbox and Abox Fausto Giunchiglia and Mattia Fumagallli University of Trento *Originally by Luciano Serafini and Chiara Ghidini Modified by Fausto Giunchiglia and
More informationKnowledge Representation for the Semantic Web Lecture 2: Description Logics I
Knowledge Representation for the Semantic Web Lecture 2: Description Logics I Daria Stepanova slides based on Reasoning Web 2011 tutorial Foundations of Description Logics and OWL by S. Rudolph Max Planck
More informationOWL Semantics COMP Sean Bechhofer Uli Sattler
OWL Semantics COMP62342 Sean Bechhofer sean.bechhofer@manchester.ac.uk Uli Sattler uli.sattler@manchester.ac.uk 1 Toward Knowledge Formalization Acquisition Process Elicit tacit knowledge A set of terms/concepts
More informationTeil III: Wissensrepräsentation und Inferenz. Kap.11: Beschreibungslogiken
Vorlesung Künstliche Intelligenz Wintersemester 2006/07 Teil III: Wissensrepräsentation und Inferenz Kap.11: Beschreibungslogiken Mit Material von Carsten Lutz, Uli Sattler: http://www.computationallogic.org/content/events/iccl-ss-
More informationDecidability of SHI with transitive closure of roles
1/20 Decidability of SHI with transitive closure of roles Chan LE DUC INRIA Grenoble Rhône-Alpes - LIG 2/20 Example : Transitive Closure in Concept Axioms Devices have as their direct part a battery :
More informationA Survey of Temporal Knowledge Representations
A Survey of Temporal Knowledge Representations Advisor: Professor Abdullah Tansel Second Exam Presentation Knowledge Representations logic-based logic-base formalisms formalisms more complex and difficult
More informationA Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System
1 / 31 A Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System Judy Zhao 1, Harold Boley 2, Weichang Du 1 1. Faculty of Computer Science, University
More informationFOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES
FOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES OWL & Description Logics Markus Krötzsch Dresden, 16 May 2014 Content Overview & XML Introduction into RDF RDFS Syntax & Intuition Tutorial 1 RDFS Semantics RDFS
More informationRelations to first order logic
An Introduction to Description Logic IV Relations to first order logic Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014 Marco
More informationKnowledge Bases in Description Logics
(1/23) Description Logics Knowledge Bases in Description Logics Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/23) Understanding
More informationCS560 Knowledge Discovery and Management. CS560 - Lecture 3 1
CS560 Knowledge Discovery and Management Yugi Lee STB #560D (816) 235-5932 leeyu@umkc.edu www.sce.umkc.edu/~leeyu CS560 - Lecture 3 1 Logic A logic allows the axiomatization of the domain information,
More informationarxiv: v2 [cs.lo] 21 Jul 2014
ExpTime Tableaux with Global Caching for the Description Logic SHOQ Linh Anh Nguyen 1,2 and Joanna Golińska-Pilarek 3 1 Institute of Informatics, University of Warsaw Banacha 2, 02-097 Warsaw, Poland nguyen@mimuw.edu.pl
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationOptimisation of Terminological Reasoning
Optimisation of Terminological Reasoning Ian Horrocks Department of Computer Science University of Manchester, UK horrocks@cs.man.ac.uk Stephan Tobies LuFG Theoretical Computer Science RWTH Aachen, Germany
More informationReasoning About Typicality in ALC and EL
Reasoning About Typicality in ALC and EL Laura Giordano 1, Valentina Gliozzi 2, Nicola Olivetti 3, and Gian Luca Pozzato 2 1 Dipartimento di Informatica - Università del Piemonte Orientale A. Avogadro
More informationA Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions
A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions Fernando Bobillo Miguel Delgado Juan Gómez-Romero Department of Computer Science and Artificial Intelligence University
More informationClosed World Reasoning for OWL2 with Negation As Failure
Closed World Reasoning for OWL2 with Negation As Failure Yuan Ren Department of Computing Science University of Aberdeen Aberdeen, UK y.ren@abdn.ac.uk Jeff Z. Pan Department of Computing Science University
More informationQuasi-Classical Semantics for Expressive Description Logics
Quasi-Classical Semantics for Expressive Description Logics Xiaowang Zhang 1,4, Guilin Qi 2, Yue Ma 3 and Zuoquan Lin 1 1 School of Mathematical Sciences, Peking University, Beijing 100871, China 2 Institute
More informationModeling Ontologies Using OWL, Description Graphs, and Rules
Modeling Ontologies Using OWL, Description Graphs, and Rules Boris Motik 1, Bernardo Cuenca Grau 1, Ian Horrocks 1, and Ulrike Sattler 2 1 University of Oxford, UK 2 University of Manchester, UK 1 Introduction
More informationAn Introduction to Description Logic IX Tableau-based algorithm
An Introduction to Description Logic IX Tableau-based algorithm Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, March 26 th 2015 Marco Cerami
More informationConsequence-Based Reasoning for Ontology Classification
Consequence-Based Reasoning for Ontology Classification František Simančík Worcester College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Trinity 2013 Abstract Description
More informationA Refined Tableau Calculus with Controlled Blocking for the Description Logic SHOI
A Refined Tableau Calculus with Controlled Blocking for the Description Logic Mohammad Khodadadi, Renate A. Schmidt, and Dmitry Tishkovsky School of Computer Science, The University of Manchester, UK Abstract
More informationKnowledge Representation for the Semantic Web
Knowledge Representation for the Semantic Web Winter Quarter 2012 Pascal Hitzler Slides 10 02/21/2012 Kno.e.sis Center Wright State University, Dayton, OH http://www.knoesis.org/pascal/ KR4SW Winter 2012
More informationIntroduction to Description Logic and Ontology Languages
CS6999 Presentation Introduction to Description Logic and Ontology Languages Jidi (Judy) Zhao October 21, 2009 Talk Outline Introduction to Ontologies Introduction to Description Logic (DL) Reasoning in
More informationTranslating Ontologies from Predicate-based to Frame-based Languages
1/18 Translating Ontologies from Predicate-based to Frame-based Languages Jos de Bruijn and Stijn Heymans Digital Enterprise Research Institute (DERI) University of Innsbruck, Austria {jos.debruijn,stijn.heymans}@deri.org
More informationUniversity of Oxford. Consequence-based Datatype Reasoning in EL: Identifying the Tractable Fragments
University of Oxford Consequence-based Datatype Reasoning in EL: Identifying the Tractable Fragments by Despoina Magka St. Peter s College under joint supervision by Prof. Ian Horrocks and Dr. Yevgeny
More informationLeast Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles*
Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles* Franz Baader Theoretical Computer Science TU Dresden D-01062 Dresden, Germany
More informationA New Approach to Knowledge Base Revision in DL-Lite
A New Approach to Knowledge Base Revision in DL-Lite Zhe Wang and Kewen Wang and Rodney Topor School of ICT, Griffith University Nathan, QLD 4111, Australia Abstract Revising knowledge bases (KBs) in description
More informationOWL Basics. Technologies for the Semantic Web. Building a Semantic Web. Ontology
Technologies for the Semantic Web OWL Basics COMP60421 Sean Bechhofer University of Manchester sean.bechhofer@manchester.ac.uk Metadata Resources are marked-up with descriptions of their content. No good
More informationRevising General Knowledge Bases in Description Logics
Revising General Knowledge Bases in Description Logics Zhe Wang and Kewen Wang and Rodney Topor Griffith University, Australia Abstract Revising knowledge bases (KBs) in description logics (DLs) in a syntax-independent
More informationComplexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes
Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes Christoph Haase 1 and Carsten Lutz 2 Abstract. We perform an exhaustive study of the complexity of subsumption
More informationProbabilistic Ontologies: Logical Approach
Probabilistic Ontologies: Logical Approach Pavel Klinov Applied Artificial Intelligence Lab ECE Department University of Cincinnati Agenda Why do we study ontologies? Uncertainty Probabilistic ontologies
More informationWeb Ontology Language (OWL)
Web Ontology Language (OWL) Need meaning beyond an object-oriented type system RDF (with RDFS) captures the basics, approximating an object-oriented type system OWL provides some of the rest OWL standardizes
More informationINTEGRITY CONSTRAINTS FOR THE SEMANTIC WEB: AN OWL 2 DL EXTENSION
INTEGRITY CONSTRAINTS FOR THE SEMANTIC WEB: AN OWL 2 DL EXTENSION By Jiao Tao A Thesis Submitted to the Graduate Faculty of Rensselaer Polytechnic Institute in Partial Fulfillment of the Requirements for
More informationA normal form for hypergraph-based module extraction for SROIQ
A normal form for hypergraph-based module extraction for SROIQ Riku Nortje, Katarina Britz, and Thomas Meyer Center for Artificial Intelligence Research, University of KwaZulu-Natal and CSIR Meraka Institute,
More informationExtended Decision Procedure for a Fragment of HL with Binders
Extended Decision Procedure for a Fragment of HL with Binders Marta Cialdea Mayer Università di Roma Tre, Italy This is a draft version of a paper appearing on the Journal of Automated Reasoning. It should
More informationReasoning in the SHOQ(D n ) Description Logic
Reasoning in the SHOQ(D n ) Description Logic Jeff Z. Pan and Ian Horrocks Information Management Group Department of Computer Science University of Manchester Oxford Road, Manchester M13 9PL, UK {pan,horrocks}@cs.man.ac.uk
More informationEXPLANATION AND DIAGNOSIS SERVICES FOR UNSATISFIABILITY AND INCONSISTENCY IN DESCRIPTION LOGICS
EXPLANATION AND DIAGNOSIS SERVICES FOR UNSATISFIABILITY AND INCONSISTENCY IN DESCRIPTION LOGICS Xi Deng A thesis in The Department of Computer Science and Software Engineering Presented in Partial Fulfillment
More informationWeek 4. COMP62342 Sean Bechhofer, Uli Sattler
Week 4 COMP62342 Sean Bechhofer, Uli Sattler sean.bechhofer@manchester.ac.uk, uli.sattler@manchester.ac.uk Today Some clarifications from last week s coursework More on reasoning: extension of the tableau
More informationPart 1: (Pills of) Knowledge Representation and Reasoning. Lucia Winter School, Daniele Nardi, December 2013 Knowledge Representation and Reasoning 1
Part 1: (Pills of) Knowledge Representation and Reasoning Lucia Winter School, Daniele Nardi, December 2013 Knowledge Representation and Reasoning 1 Knowledge base A knowledge base is a representation
More informationOn Axiomatic Rejection for the Description Logic ALC
On Axiomatic Rejection for the Description Logic ALC Hans Tompits Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group Joint work with Gerald Berger Context The
More informationOntology and Database Systems: Knowledge Representation and Ontologies Part 2: Description Logics
Ontology and Database Systems: Knowledge Representation and Ontologies Diego Calvanese Faculty of Computer Science European Master in Computational Logic A.Y. 2014/2015 Part 2 Description Logics D. Calvanese
More informationLogic: Propositional Logic Truth Tables
Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
More information473 Topics. Knowledge Representation III First-Order Logic. Logic-Based KR. Propositional. Logic vs. First Order
473 Topics Knowledge Representation III First-Order Logic CSE 473 Perception NLP Robotics Multi-agent Inference Logic Supervised Learning Knowledge Representation Search Problem Spaces Agency Reinforcement
More informationRole-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes
Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes Rafael Peñaloza and Anni-Yasmin Turhan TU Dresden, Institute for Theoretical Computer Science Abstract. The least common
More informationA MILP-based decision procedure for the (Fuzzy) Description Logic ALCB
A MILP-based decision procedure for the (Fuzzy) Description Logic ALCB Fernando Bobillo 1 and Umberto Straccia 2 1 Dpt. of Computer Science & Systems Engineering, University of Zaragoza, Spain 2 Istituto
More informationExtracting Modules from Ontologies: A Logic-based Approach
Extracting Modules from Ontologies: A Logic-based Approach Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov and Ulrike Sattler The University of Manchester School of Computer Science Manchester, M13
More informationKernel Contraction in EL
Kernel Contraction in EL by Zhiwei Liao B.Sc., Peking University, 2012 Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in the School of Computing Science
More informationNonmonotonic Reasoning in Description Logic by Tableaux Algorithm with Blocking
Nonmonotonic Reasoning in Description Logic by Tableaux Algorithm with Blocking Jaromír Malenko and Petr Štěpánek Charles University, Malostranske namesti 25, 11800 Prague, Czech Republic, Jaromir.Malenko@mff.cuni.cz,
More informationOWL Semantics. COMP60421 Sean Bechhofer University of Manchester
OWL Semantics COMP60421 Sean Bechhofer University of Manchester sean.bechhofer@manchester.ac.uk 1 Technologies for the Semantic Web Metadata Resources are marked-up with descriptions of their content.
More informationThe Complexity of Lattice-Based Fuzzy Description Logics
Noname manuscript No (will be inserted by the editor) The Complexity of Lattice-Based Fuzzy Description Logics From ALC to SHI Stefan Borgwardt Rafael Peñaloza the date of receipt and acceptance should
More informationTableau-based Revision for Expressive Description Logics with Individuals
Tableau-based Revision for Expressive Description Logics with Individuals Thinh Dong, Chan Le Duc, Myriam Lamolle LIASD - IUT de Montreuil, Université Paris 8, France Abstract Our understanding of an application
More informationContext-Sensitive Description Logics in a Dynamic Setting
Context-Sensitive Description Logics in a Dynamic Setting Satyadharma Tirtarasa 25.04.2018 RoSI - TU Dresden Role-based Software Infrastructures for continuous-context-sensitive Systems Overview Context-Sensitive
More informationA Fuzzy Description Logic
From: AAAI-98 Proceedings. Copyright 1998, AAAI (www.aaai.org). All rights reserved. A Fuzzy Description Logic Umberto Straccia I.E.I - C.N.R. Via S. Maria, 46 I-56126 Pisa (PI) ITALY straccia@iei.pi.cnr.it
More informationOntoRevision: A Plug-in System for Ontology Revision in
OntoRevision: A Plug-in System for Ontology Revision in Protégé Nathan Cobby 1, Kewen Wang 1, Zhe Wang 2, and Marco Sotomayor 1 1 Griffith University, Australia 2 Oxford University, UK Abstract. Ontologies
More informationALC + T: a Preferential Extension of Description Logics
Fundamenta Informaticae 96 (2009) 1 32 1 DOI 10.3233/FI-2009-185 IOS Press ALC + T: a Preferential Extension of Description Logics Laura Giordano Dipartimento di Informatica Università del Piemonte Orientale
More informationTractable Extensions of the Description Logic EL with Numerical Datatypes
Tractable Extensions of the Description Logic EL with Numerical Datatypes Despoina Magka, Yevgeny Kazakov, and Ian Horrocks Oxford University Computing Laboratory Wolfson Building, Parks Road, OXFORD,
More informationThe Bayesian Ontology Language BEL
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) The Bayesian Ontology Language BEL İsmail İlkan Ceylan Rafael Peñaloza Received: date / Accepted: date Abstract We introduce
More informationAn Introduction to Description Logics: Techniques, Properties, and Applications. NASSLLI, Day 2, Part 2. Reasoning via Tableau Algorithms.
An Introduction to Description Logics: Techniques, Properties, and Applications NASSLLI, Day 2, Part 2 Reasoning via Tableau Algorithms Uli Sattler 1 Today relationship between standard DL reasoning problems
More informationComplexity Results and Practical Algorithms for Logics in Knowledge Representation
Complexity Results and Practical Algorithms for Logics in Knowledge Representation Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westfälischen Technischen Hochschule
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationA Logical Framework for Modularity of Ontologies
A Logical Framework for Modularity of Ontologies Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov and Ulrike Sattler The University of Manchester School of Computer Science Manchester, M13 9PL, UK {bcg,
More informationForgetting and uniform interpolation in large-scale description logic terminologies
Forgetting and uniform interpolation in large-scale description logic terminologies Boris Konev, Dirk Walther, and Frank Wolter Department of Computer Science University of Liverpool, UK {konev, dwalther,
More informationThe Information Flow Foundation for Fusing Inferences
The Information Flow Foundation for Fusing Inferences Bo Hu IAM Group, ECS University of Southampton, UK bh@ecs.soton.ac.uk Abstract A practical and efficient approach to hybrid reasoning is to fuse different
More informationKnowledge Representation and Description Logic Part 1
Knowledge Representation and Description Logic Part 1 Renata Wassermann renata@ime.usp.br Computer Science Department University of São Paulo September 2014 IAOA School Vitória Renata Wassermann Knowledge
More informationAll Elephants are Bigger than All Mice
Wright State University CORE Scholar Computer Science and Engineering Faculty Publications Computer Science & Engineering 5-2008 All Elephants are Bigger than All Mice Sebastian Rudolph Markus Krotzsch
More informationPlan-based Axiom Absorption for Tableau-based Description. Logics Reasoning
Plan-based Axiom Absorption for Tableau-based Description Logics Reasoning Jiewen Wu A thesis in The Department of Computer Science and Software Engineering Presented in Partial Fulfillment of the Requirements
More informationParaconsistent OWL and Related Logics
Semantic Web journal, to appear 0 (2012) 1 0 1 IOS Press Paraconsistent OWL and Related Logics Editor(s): Krzysztof Janowicz, University of California, Santa Barbara, U.S.A. Solicited review(s): Two anonymous
More informationFirst Order Logic (FOL)
First Order Logic (FOL) CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2013 Soleymani Course material: Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter
More informationFrom OWL to Description Logics. U. Straccia (ISTI - CNR) DLs & SW / 170
From OWL to Description Logics U. Straccia (ISTI - CNR) DLs & SW 2007 67 / 170 What Are Description Logics? (http://dl.kr.org/) A family of logic-based knowledge representation formalisms Descendants of
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationInconsistency-Tolerant Reasoning with OWL DL
Inconsistency-Tolerant Reasoning with OWL DL Xiaowang Zhang a,, Guohui Xiao b, Zuoquan Lin c, Jan Van den Bussche a a Hasselt University and transnational University of Limburg, 3590 Diepenbeek, Belgium
More informationLTCS Report. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. LTCS-Report 16-07
Technische Universität Dresden Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
More informationTranslating XML Web Data into Ontologies
Translating XML Web Data into Ontologies Yuan An and John Mylopoulos University of Toronto, Canada {yuana,jm}@cs.toronto.edu Abstract. Translating XML data into ontologies is the problem of finding an
More information