Making sense of Description Logics Paul Warren, Paul Mulholland, Trevor Collins, Enrico Motta Knowledge Media Institute, Open University, UK UK Ontology.

Slides:



Advertisements
Similar presentations
1 Knowledge Representation Introduction KR and Logic.
Advertisements

1 ISWC-2003 Sanibel Island, FL IMG, University of Manchester Jeff Z. Pan 1 and Ian Horrocks 1,2 {pan | 1 Information Management.
Chronos: A Tool for Handling Temporal Ontologies in Protégé
Logic Use mathematical deduction to derive new knowledge.
Logic Concepts Lecture Module 11.
CLASSICAL LOGIC and FUZZY LOGIC. CLASSICAL LOGIC In classical logic, a simple proposition P is a linguistic, or declarative, statement contained within.
Of 27 lecture 7: owl - introduction. of 27 ece 627, winter ‘132 OWL a glimpse OWL – Web Ontology Language describes classes, properties and relations.
INTRODUCTION TO ARTIFICIAL INTELLIGENCE Massimo Poesio LECTURE 4: Semantic Networks and Description Logics.
CS 355 – Programming Languages
Reasoning Lindsay Anderson. The Papers “The probabilistic approach to human reasoning”- Oaksford, M., & Chater, N. “Two kinds of Reasoning” – Rips, L.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Suppressing valid inferences with conditionals Ruth M.J. Byrne, MRC Applied Psychology Unit, Cambridge (1987, 1988, 1989) Ruth M.J. Byrne, MRC Applied.
Chapter 8: Web Ontology Language (OWL) Service-Oriented Computing: Semantics, Processes, Agents – Munindar P. Singh and Michael N. Huhns, Wiley, 2005.
Knoweldge Representation & Reasoning
PSY 369: Psycholinguistics Some basic linguistic theory part3.
COMP 3009 Introduction to AI Dr Eleni Mangina
Cognitive Processes PSY 334 Chapter 10 – Reasoning & Decision-Making August 19, 2003.
Let remember from the previous lesson what is Knowledge representation
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Part 6: Description Logics. Languages for Ontologies In early days of Artificial Intelligence, ontologies were represented resorting to non-logic-based.
Propositional Logic Reasoning correctly computationally Chapter 7 or 8.
Chapter 6: Objections to the Physical Symbol System Hypothesis.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
An Introduction to Description Logics. What Are Description Logics? A family of logic based Knowledge Representation formalisms –Descendants of semantic.
OWL and SDD Dave Thau University of Kansas
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Pattern-directed inference systems
Logical Agents Logic Propositional Logic Summary
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
An Introduction to Description Logics (chapter 2 of DLHB)
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM]
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.
 I can identify and use the properties of real numbers.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
CS6133 Software Specification and Verification
2.1 Sets 2.2 Set Operations –Set Operations –Venn Diagrams –Set Identities –Union and Intersection of Indexed Collections 2.3 Functions 2.4 Sequences and.
Basic Concepts of Logic An Overview of Introduction to Logic Yingrui Yang
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
11 Artificial Intelligence CS 165A Thursday, October 25, 2007  Knowledge and reasoning (Ch 7) Propositional logic 1.
RULES Patty Nordstrom Hien Nguyen. "Cognitive Skills are Realized by Production Rules"
Cognitive Processes PSY 334 Chapter 10 – Reasoning.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
Review: What is a logic? A formal language –Syntax – what expressions are legal –Semantics – what legal expressions mean –Proof system – a way of manipulating.
Of 29 lecture 15: description logic - introduction.
LDK R Logics for Data and Knowledge Representation Description Logics: family of languages.
CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway
Artificial Intelligence Hossaini Winter Outline book : Artificial intelligence a modern Approach by Stuart Russell, Peter Norvig. A Practical Guide.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
Chapter 7. Propositional and Predicate Logic
2. The Logic of Compound Statements Summary
ece 720 intelligent web: ontology and beyond
CS 4700: Foundations of Artificial Intelligence
Semantic Web Foundations
CS 4700: Foundations of Artificial Intelligence
EA C461 – Artificial Intelligence Logical Agent
Propositional Calculus: Boolean Algebra and Simplification
ece 720 intelligent web: ontology and beyond
Logics for Data and Knowledge Representation
CS 270 Math Foundations of CS
A Brief Summary for Exam 1
MAT 3100 Introduction to Proof
Chapter 7. Propositional and Predicate Logic
CSNB234 ARTIFICIAL INTELLIGENCE
ONTOMERGE Ontology translations by merging ontologies Paper: Ontology Translation on the Semantic Web by Dejing Dou, Drew McDermott and Peishen Qi 2003.
Presentation transcript:

Making sense of Description Logics Paul Warren, Paul Mulholland, Trevor Collins, Enrico Motta Knowledge Media Institute, Open University, UK UK Ontology Network 14 th April 2016

Goal What can we learn from theories of reasoning … and theories of language –to understand the difficulties experienced with DLs –to mitigate those difficulties achieving a better cognitive fit … … to help human reasoning 2

Theories of Reasoning … and Language 3

4 Rule-based E.g. Lance Rips We reason by constructing logical steps akin to those created formally by a logician in a proof Model-based E.g. Philip Johnson-Laird We reason by constructing mental models which represent the situation versus complemented by Relational Complexity E.g. Graeme Halford “the number of variables that can be related in a single cognitive representation” SyntacticSemantic Scale to measure complexity

Language - the implicature 5 “It is a commonplace of philosophical logic that there are, or appear to be, divergences in meaning between … the FORMAL devices … and … what are taken to be their analogs or counterparts in natural language” H.P. Grice, Logic and Conversation, 1975

In our context … 6 EnglishManchester OWL syntax John only has sons Implicature: he does have children (but no daughters) John has_children only Male Implication: if he has children, they are sons, but he might not have any at all) Mental models John sonsJohn son(s) John ⊥

… and 7 EnglishManchester OWL syntax John has some sons Implicature: he doesn’t have any daughters (else the statement would have said so) John has_children some Male Implication: he has sons, and he may also have daughters Mental models John sonsJohn son(s) John son(s)John ¬ son

Example 1: thinking syntactically All examples described in: Paul Warren, Paul Mulholland, Trevor Collins, and Enrico Motta. ‘Making Sense of Description Logics’. In Proceedings of the 11th International Conference on Semantic Systems, 49–56. 8

X and Y disjoint? X SubClassOf has_child only (not MALE) Y SubClassOf has_child some MALE 9 Yes – 50% correct (14/28) X SubClassOf not (has_child some MALE) Y SubClassOf has_child some MALE Yes – 79% correct (22/28)

X and Y disjoint? X SubClassOf has_child only (not MALE) Y SubClassOf has_child some MALE 10 X SubClassOf not (has_child some MALE) Y SubClassOf has_child some MALE Yes – 50% correct (14/28) Yes – 79% correct (22/28)

X and Y disjoint? X SubClassOf has_child only (not MALE) Y SubClassOf has_child some MALE 11 X SubClassOf not (has_child some MALE) Y SubClassOf has_child some MALE Yes – 50% correct (14/28) Yes – 79% correct (22/28)

Recommendations Use syntax to emphasize semantics But beware of false equivalences: –has_child only (not MALE) –not (has_child only MALE) Teach duality laws, expressed in Manchester OWL Syntax –P some (not X) ≡ not (P only X) –not (P some X) ≡ P only (not X) and let tools show alternative equivalent expressions 12

Example 2: thinking semantically 13

X and Y Disjoint? 14 X SubClassOf has_child only (not MALE) Y SubClassOf has_child only MALE No – 50% correct (14/28) Need to understand that an individual with no children can be in both X and Y

Recommendations Emphasize ‘less favoured’ model –in notation, e.g. only > onlyOrNone –in training 15

Example 3: measuring complexity 16

Functionality vs. transitivity 1.a F b 2.a F c 3.b F d 4.c F e ⇒ d = e (1) + (2) ⇒ b = c; RC = 3 Sub. b for c in (4); RC = 2 (3) + (4) ⇒ d = e;RC = a T b 2.b T c 3.c SameAs d 4.d T e ⇒ a T e (1) + (2) ⇒ a T c;RC = 3 Sub. c for d in (4);RC = 2 a T c + (4) ⇒ a T e;RC = 3 75% correct (21/28) average time = 52 secs 96% correct (27/28) average time = 34 secs F a functional property: has_nearest_neighbour T a transitive property: greater_than_or_equal_to

Recommendations Functionality inherently difficult –confusion with inverse functionality –emphasize that object is unique i.e. one object per subject not one subject per object e.g. s has_nearest_neighbour solely t 18

Conclusion Theories of reasoning and language provide insight –using appropriate theory for particular context Leading to recommendations for: –modifications to syntax –tool support –training 19

20

Rule-based Each deduction uses a sequence of rules –e.g. modus ponens Each rule has an ‘availability’ –measure of ease of use 21 Rips, L. J. (1983). Cognitive processes in propositional reasoning. Psychological Review, 90(1), 38.

Model-based 22 Inclusive or ‘there is a circle or there is a triangle, or both’ Exclusive or ‘there is a circle or there is a triangle, but not both’ E.g. Johnson-Laird, P. N. (2005). Mental models and thought. The Cambridge handbook of thinking and reasoning, 185–208. Full Disjunctive Normal Form with 3 disjuncts versus 2 disjuncts

Relational complexity We need to consider both premises … … and three entities … which means processing a ternary relation 23 E.g. transitive inference Tom is happier than Mark Peter is happier than Tom Who is happiest? TomPeter MarkTom Peter Tom Mark Adapted from Halford, G. “Analysis of Complexity in Cognitive Tasks.” Keynote Address to the 35th Annual Conference of the Australian Psychological Society