DESCRIPTION LOGICS. Paula Severi. October 12, University of Leicester

Size: px
Start display at page:

Download "DESCRIPTION LOGICS. Paula Severi. October 12, University of Leicester"

Transcription

1 DESCRIPTION LOGICS Paula Severi University of Leicester October 12, 2009

2 Description Logics Outline Introduction: main principle, why the name description logic, application to semantic web. Syntax and semantics of the description logic ALC. Inference problems. Relation with predicate logic. Decidability of ALC. Relation with modal logic. Semantic tableaux. Extensions to description logic. Description logic of OWL 2 (ontology web language for the semantic web).

3 DESCRIPTION LOGICS Principle from Knowledge Representation (Artificial Intelligence) Knowledge should be represented by characterizing classes of objects and the relationships between them.

4 DESCRIPTION LOGICS Principle from Knowledge Representation (Artificial Intelligence) Knowledge should be represented by characterizing classes of objects and the relationships between them. Knowledge Description First Order representation Logic Logic Classes Concept descriptions Unary predicates Relations Role descriptions Binary predicates

5 DESCRIPTION LOGIC DESCRIPTION LOGIC refers to 1 concept and roles descriptions used to describe classes and relationships between them

6 DESCRIPTION LOGIC DESCRIPTION LOGIC refers to 1 concept and roles descriptions used to describe classes and relationships between them 2 the logic-based semantics which can be given by a translation into first-order predicate logic.

7 Description Logics (DLs) Description Logics (DLs) They are a family of knowledge representation languages which can be used to represent the conceptual knowledge of an application domain in a structured and formally well-understood way.

8 Description Logics (DLs) Description Logics (DLs) They are a family of knowledge representation languages which can be used to represent the conceptual knowledge of an application domain in a structured and formally well-understood way. Why formally well understood? They are decidable fragments of first order logic (a bit more expressive than proposition logic). Complexity usually polynomial.

9 Most succesfull area of application. SEMANTIC WEB SEMANTIC WEB web enriched with a logic to check consistency and do queries OWL (web ontology language) a description logic where logical constructors are written as XML-tags

10 From Jim Hendler, co-chair of the W3C Web Ontology Working Group, and the W3C Communications Team says: What does the acronym OWL stand for? Actually, OWL is not a real acronym. The language started out as the Web Ontology Language but the Working Group disliked the acronym WOL. We decided to call it OWL. The Working Group became more comfortable with this decision when one of the members pointed out the following justification for this decision from the noted ontologist A.A. Milne who, in his influential book Winnie the Pooh stated of the wise character OWL: He could spell his own name WOL, and he could spell Tuesday so that you knew it wasn t Wednesday...

11 Description Logic ALC. Syntax and Semantics. Notation: C, D for concept descriptions and R, S for roles Semantics. Interpretation I = ( I, I) such that C I I and R I I I

12 Description Logic ALC. Syntax and Semantics. Notation: C, D for concept descriptions and R, S for roles Semantics. Interpretation I = ( I, I) such that C I I and R I I I Constructor Syntax Example Semantics Atomic A Human A I I concept Atomic R haschild R I I I role Intersection C D Human Male C I D I Union C D Female Male C I D I Negation C Female I /C I Exists R.C haschild.female {x y.(x, y) R I restriction y C I } Value R.C haschild.female {x y.(x, y) R I restriction y C I }

13 Knowledge Base. TBOX and ABOX Knowledge base TBox (terminological knowledge) is a set of inclusions C D Background knowledge ABox (assertional knowledge) is a set of assertions a : C and < a, b >: R Knowledge about individuals

14 Example of Knowledge Base. Knowledge base 1 TBox (background knowledge) Altarpiece Picture hasfigure.religious hasfigure.(religious Donor) hasheight. > 120 ABox (knowledge about individuals) Sistine Madonna : Altarpiece Raphael : Painter Christ : Religious < Raphael, Sistine Madonna >: haspainted < Sistine Madonna, Christ >: hasfigure < Sistine Madonna, 180 >: hasheight 1 From Ontology of Altarpieces. David Ekserdijan, Jose Fiadeiro, Paula Severi and Monika Solanski

15 Altarpiece: Sistine Madonna by Raphael

16 Open vs Closed World Assumption Closed world assumption: Databases Any statement that is not known to be true is false. Abscense of information in a database is interpreted as negative information. Open world assumption: Description Logics The truth-value of a statement is independent of whether or not it is known by any single observer or agent to be true. Absence of information in a Abox only indicates lack of knowledge.

17 Basic Inference Problems Let K = T, A be a knowledge base. Consistency of K. Is there a model I of K? C satisfiable w.r.t K. Is there a model of K such that C I? C K D. Does C I D I holds for all models I of K? a is an instance of C w.r.t K. Does a I C I holds for all models I of K? a, b is an instance of R w.r.t K. Does (a I, b I ) R I holds for all models I of K.?

18 Example of Knowledge Base. INCONSISTENT KNOWLEDGE BASE TBox (background knowledge) Altarpiece Picture hasfigure.religious hasfigure.(religious Donor) hasheight.> 120 ABox (knowledge about individuals) Sistine Madonna : Altarpiece Christ : Religious < Sistine Madonna, Christ >: hasfigure < Sistine Madonna, 100 >: hasheight

19 Example of Knowledge Base. INCONSISENT KNOWLEDGE BASE TBox (background knowledge) Altarpiece Picture hasfigure.religious hasfigure.(religious Donor) Figure = Religious Donor Other Religious Donor = Religious Other = Donor Other = ABox (knowledge about individuals) Sistine Madonna : Altarpiece Christ : Religious Paula : Other < Sistine Madonna, Christ >: hasfigure < Sistine Madonna, Paula >: hasfigure

20 Example of Knowledge Base. IS THIS KNOWLEDGE BASE CONSISTENT??? TBox (background knowledge) Altarpiece Picture hasfigure.religious hasfigure.(religious Donor) ABox (knowledge about individuals) Sistine Madonna : Altarpiece No information about religious figures of Sistine Madonna

21 Example of Knowledge Base. THIS KNOWLEDGE BASE IS CONSISTENT TBox (background knowledge) Altarpiece Picture hasfigure.religious hasfigure.(religious Donor) ABox (knowledge about individuals) Sistine Madonna : Altarpiece Justification of Consistency. Construction of Model. Define I as the following extension of the term model. I = {Sistine Madonna, figure1} figure1 Religious I Sistine Madonna, figure1 hasfigure I

22 Example of Knowledge Base. THIS KNOWLEDGE BASE IS INCONSISTENT TBox (background knowledge) Altarpiece Religious = Picture hasfigure.religious hasfigure.(religious Donor) ABox (knowledge about individuals) Sistine Madonna : Altarpiece Justification of Inconsistency. Suppose that exists a model of the above knowledge base. Since SistineMadonna I Altarpiece I, there exists fig1 such that fig1 Religious I. This contradicts the fact that Religious I =.

23 Unique Name Assumption (UNA) Unique Name Assumption in Description Logic Different names always refer to different entities, i.e. if a and b are different individual names then a I b I. OWL does not assume UNA It provides explicit constructs owl:sameas and owl:differentfrom.

24 DL and Predicate Logic Translation of ALC into first order logic atomic concept unary predicates role names binary predicates concepts formulas with one free variables Translation of concepts π x (A) π x (C D) π x ( R.C) π x ( R.C). = A(x) = π x (C) π x (D) = y.(r(x, y) π y (C)) = y.(r(x, y) π y (C)) Translation of TBox and ABox π(t ) = C D ( x.π x(c) π x (D)) π(a) = a:c A π x(c)[x/a] (a,b):r C R(a, b)

25 DL and Predicate Logic Theorem The reasoning problems for ALC are all decidable. Proof. The above translation to Predicate Logic uses only two variables x and y. The two variable fragment of first order logic is decidable.

26 Semantic Tableaux Most widely used technique to solve the reasoning problems is the tableux based approach. Algorithm to decide consistency 1 Transform the concepts to negation normal form, i.e. negation is only applied to concept names. 2 Start with the ABox A as initial interpretation. We will extend this interpretation and get a model using semantic tableaux. 3 We build a tree (actually a forest): a labelled node for each individual x where L(x) = {C x : X} and an edge from x to y if < x, y >: R.

27 Complexity of ALC Theorem The reasoning problems for ALC are PSPACE-complete.

28 Description Logics. More Constructors. Constructor Syntax Semantics Number n R {x #({y (x, y) R I }) n} restrictions n R {x #({y (x, y) R I }) n} Inverse role R 1 {(x, y) (y, x) R I } Transitive role R transitive closure of R I Role R S {(x, z) (x, y) R I composition (y, z) R I } Concrete domain D D Concrete roles U U I I D Existential U 1,... U n.p {x y 1,..., y n. predicate x U 1 y 1... x U n y n restriction (y1,..., y n ) P }

29 Description Logics. More Constructors. Constructor Syntax Example Number n R 3 haschild restrictions n R 1 hasmother Inverse role R 1 haschild 1 Transitive role R haschild Role composition R S haschild hasage Concrete domain D Int Concrete roles U hasage Existential U 1,... U n.p hasheight, haswidth. > predicate restriction

30 Description Logics. More Constructors. Constructor Syntax Example Number n R 3 haschild restrictions n R 1 hasmother Inverse role R 1 haschild 1 Transitive role R haschild Role composition R S haschild hasage Concrete domain D Int Concrete roles U hasage Existential U 1,... U n.p hasheight, haswidth. > predicate restriction All these constructors form part of OWL 2 (last version of web ontology language). Yet more constructors investigated in literature: union role, intersection role, n-ary relations, etc.

31 DL and Modal Logic ALC-concepts are syntactic variants of multi-modal logic K m. Translation of concepts. f(a) f(c D) f( R i.c) f( R i.c). = A = f(c) f(d) = i (f(c)) = i (f(c)) Translation of TBoxes π(t ) = C D ( f(c) f(d) ABoxes do not have direct correspondance with modal logic, but they can be seen as special cases of nominals (propositional variables that hold in only one world).

Phase 1. Phase 2. Phase 3. History. implementation of systems based on incomplete structural subsumption algorithms

Phase 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 information

Fuzzy Description Logics

Fuzzy 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 information

Structured Descriptions & Tradeoff Between Expressiveness and Tractability

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 information

ALC Concept Learning with Refinement Operators

ALC 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 information

Chapter 2 Background. 2.1 A Basic Description Logic

Chapter 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 information

Description Logics. an introduction into its basic ideas

Description 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 information

An Introduction to Description Logics

An 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 information

Description Logics (DLs)

Description 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 information

A RESOLUTION DECISION PROCEDURE FOR SHOIQ

A 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 information

Mathematical Logics Description Logic: Introduction

Mathematical 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 information

On Axiomatic Rejection for the Description Logic ALC

On 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 information

Relations to first order logic

Relations 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 information

Introduzione alle logiche descrittive

Introduzione 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 information

OPPA European Social Fund Prague & EU: We invest in your future.

OPPA 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 information

Logics for Data and Knowledge Representation

Logics 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 information

Description Logics. Glossary. Definition

Description 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 information

Inverting Proof Systems for Secrecy under OWA

Inverting 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 information

FOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES

FOUNDATIONS 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 information

Decidability of SHI with transitive closure of roles

Decidability 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 information

An Introduction to Description Logic III

An 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 information

Description 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 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 information

Knowledge Representation and Description Logic Part 2

Knowledge Representation and Description Logic Part 2 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

More information

Completing Description Logic Knowledge Bases using Formal Concept Analysis

Completing Description Logic Knowledge Bases using Formal Concept Analysis Completing Description Logic Knowledge Bases using Formal Concept Analysis Franz Baader 1, Bernhard Ganter 1, Ulrike Sattler 2 and Barış Sertkaya 1 1 TU Dresden, Germany 2 The University of Manchester,

More information

Reasoning in the SHOQ(D n ) Description Logic

Reasoning 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 information

arxiv: v2 [cs.lo] 21 Jul 2014

arxiv: 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 information

Lightweight Description Logics: DL-Lite A and EL ++

Lightweight 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 information

Teil III: Wissensrepräsentation und Inferenz. Kap.11: Beschreibungslogiken

Teil 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 information

A Survey of Temporal Knowledge Representations

A 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 information

Description logics. Description Logics. Applications. Outline. Syntax - AL. Tbox and Abox

Description 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 information

Modular Reuse of Ontologies: Theory and Practice

Modular 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 information

An Introduction to Description Logic IX Tableau-based algorithm

An 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 information

Knowledge Representation for the Semantic Web Lecture 2: Description Logics I

Knowledge 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 information

LTCS Report. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. LTCS-Report 16-07

LTCS 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 information

A Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System

A 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 information

Complexity 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 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 information

An Introduction to Description Logics: Techniques, Properties, and Applications. NASSLLI, Day 3, Part 2. Computational Complexity.

An Introduction to Description Logics: Techniques, Properties, and Applications. NASSLLI, Day 3, Part 2. Computational Complexity. An Introduction to Description Logics: Techniques, Properties, and Applications NASSLLI, Day 3, Part 2 Computational Complexity Uli Sattler 1 Today We will discuss basic notions of computational complexity

More information

A Description Logic with Concrete Domains and a Role-forming Predicate Operator

A Description Logic with Concrete Domains and a Role-forming Predicate Operator A Description Logic with Concrete Domains and a Role-forming Predicate Operator Volker Haarslev University of Hamburg, Computer Science Department Vogt-Kölln-Str. 30, 22527 Hamburg, Germany http://kogs-www.informatik.uni-hamburg.de/~haarslev/

More information

OWL Basics. Technologies for the Semantic Web. Building a Semantic Web. Ontology

OWL 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 information

EXPLANATION AND DIAGNOSIS SERVICES FOR UNSATISFIABILITY AND INCONSISTENCY IN DESCRIPTION LOGICS

EXPLANATION 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 information

Inconsistency-Tolerant Reasoning with OWL DL

Inconsistency-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 information

A tableaux calculus for ALC + T min R

A tableaux calculus for ALC + T min R A tableaux calculus for ALC + T min R Laura Giordano Valentina Gliozzi Adam Jalal Nicola Olivetti Gian Luca Pozzato June 12, 2013 Abstract In this report we introduce a tableau calculus for deciding query

More information

On the Decidability Status of Fuzzy ALC with General Concept Inclusions

On the Decidability Status of Fuzzy ALC with General Concept Inclusions J Philos Logic manuscript No. (will be inserted by the editor) On the Decidability Status of Fuzzy ALC with General Concept Inclusions Franz Baader Stefan Borgwardt Rafael Peñaloza Received: date / Accepted:

More information

A 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 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 information

OWL Semantics COMP Sean Bechhofer Uli Sattler

OWL 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 information

Nonmonotonic Reasoning in Description Logic by Tableaux Algorithm with Blocking

Nonmonotonic 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 information

Week 4. COMP62342 Sean Bechhofer, Uli Sattler

Week 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 information

Least 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* 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 information

OWL Semantics. COMP60421 Sean Bechhofer University of Manchester

OWL 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 information

A Refined Tableau Calculus with Controlled Blocking for the Description Logic SHOI

A 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 information

Knowledge Base Revision in Description Logics

Knowledge Base Revision in Description Logics Knowledge Base Revision in Description Logics Guilin Qi, Weiru Liu, and David A. Bell School of Electronics, Electrical Engineering and Computer Science Queen s University Belfast, UK email: {G.Qi, W.Liu,

More information

Semantic Web Uncertainty Management

Semantic Web Uncertainty Management 1 Semantic Web Uncertainty Management Volker Haarslev Concordia University, Canada S Hsueh-leng Pai Concordia University, Canada Nematollaah Shiri Concordia University, Canada INTRODUCTION Since the introduction

More information

Quasi-Classical Semantics for Expressive Description Logics

Quasi-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 information

The Complexity of Lattice-Based Fuzzy Description Logics

The 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 information

From OWL to Description Logics. U. Straccia (ISTI - CNR) DLs & SW / 170

From 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 information

Realizing Default Logic over Description Logic Knowledge Bases. Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner

Realizing Default Logic over Description Logic Knowledge Bases. Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner Realizing Default Logic over Description Logic Knowledge Bases Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner KBS Group, Institute of Information Systems, Vienna University of Technology ECSQARU 2009

More information

An 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. 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 information

Adding ternary complex roles to ALCRP(D)

Adding ternary complex roles to ALCRP(D) Adding ternary complex roles to ALCRP(D) A.Kaplunova, V. Haarslev, R.Möller University of Hamburg, Computer Science Department Vogt-Kölln-Str. 30, 22527 Hamburg, Germany Abstract The goal of this paper

More information

Extending Logic Programs with Description Logic Expressions for the Semantic Web

Extending Logic Programs with Description Logic Expressions for the Semantic Web Extending Logic Programs with Description Logic Expressions for the Semantic Web Yi-Dong Shen 1 and Kewen Wang 2 1 State Key Laboratory of Computer Science, Institute of Software Chinese Academy of Sciences,

More information

University 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 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 information

Pushing the EL Envelope Further

Pushing the EL Envelope Further Pushing the EL Envelope Further Franz Baader 1, Sebastian Brandt 2, Carsten Lutz 1 1: TU Dresden 2: Univ. of Manchester Abstract. We extend the description logic EL ++ with reflexive roles and range restrictions,

More information

Two Types of Key Constraints in Description Logics with Concrete Domains. Dũng Dinh-Khac

Two Types of Key Constraints in Description Logics with Concrete Domains. Dũng Dinh-Khac Master s Thesis on Two Types of Key Constraints in Description Logics with Concrete Domains by Dũng Dinh-Khac born on 31 st August 1980 in Hanoi, Vietnam Advisor: Maja Miličić Supervising Professor: Prof.

More information

Predicate Logic: Introduction and Translations

Predicate Logic: Introduction and Translations Predicate Logic: Introduction and Translations Alice Gao Lecture 10 Based on work by J. Buss, L. Kari, A. Lubiw, B. Bonakdarpour, D. Maftuleac, C. Roberts, R. Trefler, and P. Van Beek 1/29 Outline Predicate

More information

Representability in DL-Lite R Knowledge Base Exchange

Representability in DL-Lite R Knowledge Base Exchange epresentability in DL-Lite Knowledge Base Exchange M. Arenas 1, E. Botoeva 2, D. Calvanese 2, V. yzhikov 2, and E. Sherkhonov 3 1 Dept. of Computer Science, PUC Chile marenas@ing.puc.cl 2 KDB esearch Centre,

More information

Semantics and Inference for Probabilistic Ontologies

Semantics and Inference for Probabilistic Ontologies Semantics and Inference for Probabilistic Ontologies Fabrizio Riguzzi, Elena Bellodi, Evelina Lamma, and Riccardo Zese ENDIF University of Ferrara, Italy, email: {fabrizio.riguzzi, elena.bellodi, evelina.lamma}@unife.it,

More information

Knowledge Base Exchange: The Case of OWL 2 QL

Knowledge Base Exchange: The Case of OWL 2 QL Knowledge Base Exchange: The Case of OWL 2 QL Marcelo Arenas Pontificia Universidad Católica de Chile, Chile Elena Botoeva, Diego Calvanese, Vladislav Ryzhikov Free University of Bozen-Bolzano, Italy Abstract

More information

Description Logics: a Nice Family of Logics. Day 4: More Complexity & Undecidability ESSLLI Uli Sattler and Thomas Schneider

Description Logics: a Nice Family of Logics. Day 4: More Complexity & Undecidability ESSLLI Uli Sattler and Thomas Schneider Description Logics: a Nice Family of Logics Day 4: More Complexity & Undecidability ESSLLI 2016 Uli Sattler and Thomas Schneider 1 Next Some complexity results: TBox internalisation makes a DL ExpTime-hard

More information

On the Complexity of the Reflected Logic of Proofs

On the Complexity of the Reflected Logic of Proofs On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,

More information

Role-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 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 information

Restricted 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 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 information

INTEGRITY CONSTRAINTS FOR THE SEMANTIC WEB: AN OWL 2 DL EXTENSION

INTEGRITY 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 information

Principles of Knowledge Representation and Reasoning

Principles 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 information

Gödel Negation Makes Unwitnessed Consistency Crisp

Gödel Negation Makes Unwitnessed Consistency Crisp Gödel Negation Makes Unwitnessed Consistency Crisp Stefan Borgwardt, Felix Distel, and Rafael Peñaloza Faculty of Computer Science TU Dresden, Dresden, Germany [stefborg,felix,penaloza]@tcs.inf.tu-dresden.de

More information

A MILP-based decision procedure for the (Fuzzy) Description Logic ALCB

A 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 information

On Terminological Default Reasoning about Spatial Information: Extended Abstract

On Terminological Default Reasoning about Spatial Information: Extended Abstract On Terminological Default Reasoning about Spatial Information: Extended Abstract V. Haarslev, R. Möller, A.-Y. Turhan, and M. Wessel University of Hamburg, Computer Science Department Vogt-Kölln-Str. 30,

More information

Hybrid Rules with Well-Founded Semantics

Hybrid Rules with Well-Founded Semantics Hybrid Rules with Well-Founded Semantics W lodzimierz Drabent Jan Ma luszyński arxiv:0906.3815v1 [cs.lo] 20 Jun 2009 March 13, 2009 Submitted for publication Abstract A general framework is proposed for

More information

Description Logics: an Introductory Course on a Nice Family of Logics. Day 2: Tableau Algorithms. Uli Sattler

Description Logics: an Introductory Course on a Nice Family of Logics. Day 2: Tableau Algorithms. Uli Sattler Description Logics: an Introductory Course on a Nice Family of Logics Day 2: Tableau Algorithms Uli Sattler 1 Warm up Which of the following subsumptions hold? r some (A and B) is subsumed by r some A

More information

Expressiveness, decidability, and undecidability of Interval Temporal Logic

Expressiveness, decidability, and undecidability of Interval Temporal Logic University of Udine Department of Mathematics and Computer Science Expressiveness, decidability, and undecidability of Interval Temporal Logic ITL - Beyond the end of the light Ph.D. Defence Dario Della

More information

The Description Logic ABox Update Problem Revisited

The Description Logic ABox Update Problem Revisited Dresden University of Technology Department of Computer Science Institute for Theoretical Computer Science Master s Thesis on The Description Logic ABox Update Problem Revisited by Yusri Bong born on February

More information

Closed World Reasoning for OWL2 with Negation As Failure

Closed 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 information

Bridging the Gap Between OWL and Relational Databases

Bridging the Gap Between OWL and Relational Databases Bridging the Gap Between OWL and Relational Databases Boris Motik Ian Horrocks Ulrike Sattler Computing Laboratory, University of Oxford, UK Department of Computer Science, University of Manchester, UK

More information

Expressive number restrictions in Description Logics

Expressive number restrictions in Description Logics Expressive number restrictions in Description Logics Franz Baader and Ulrike Sattler August 12, 1999 Abstract Number restrictions are concept constructors that are available in almost all implemented Description

More information

Propositional Logic: Models and Proofs

Propositional Logic: Models and Proofs Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505

More information

Mathematical Logics Description Logic: Tbox and Abox

Mathematical 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 information

Knowledge Integration for Description Logics

Knowledge Integration for Description Logics Knowledge Integration for Description Logics Thomas Meyer and Kevin Lee KRR, National ICT Australia School of Computer Science and Engineering, UNSW, Sydney, Australia {tmeyer,kevinl}@cse.unsw.edu.au Richard

More information

Example. Lemma. Proof Sketch. 1 let A be a formula that expresses that node t is reachable from s

Example. Lemma. Proof Sketch. 1 let A be a formula that expresses that node t is reachable from s Summary Summary Last Lecture Computational Logic Π 1 Γ, x : σ M : τ Γ λxm : σ τ Γ (λxm)n : τ Π 2 Γ N : τ = Π 1 [x\π 2 ] Γ M[x := N] Georg Moser Institute of Computer Science @ UIBK Winter 2012 the proof

More information

A Tractable Rule Language in the Modal and Description Logics that Combine CPDL with Regular Grammar Logic

A Tractable Rule Language in the Modal and Description Logics that Combine CPDL with Regular Grammar Logic A Tractable Rule Language in the Modal and Description Logics that Combine CPDL with Regular Grammar Logic Linh Anh Nguyen Institute of Informatics, University of Warsaw Banacha 2, 02-097 Warsaw, Poland

More information

Next. Description Logics: a Nice Family of Logics. Some

Next. Description Logics: a Nice Family of Logics. Some Next Description Logics: a Nice Family of Logics Day 4: More Complexity & Undecidability ESSLLI 2016 Some complexity results: TBox internalisation makes a DL ExpTime-hard undecidability results: closing

More information

Reasoning with Inconsistent and Uncertain Ontologies

Reasoning with Inconsistent and Uncertain Ontologies Reasoning with Inconsistent and Uncertain Ontologies Guilin Qi Southeast University China gqi@seu.edu.cn Reasoning Web 2012 September 05, 2012 Outline Probabilistic logic vs possibilistic logic Probabilistic

More information

Revision of DL-Lite Knowledge Bases

Revision of DL-Lite Knowledge Bases Revision of DL-Lite Knowledge Bases Zhe Wang, Kewen Wang, and Rodney Topor Griffith University, Australia Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs).

More information

22c:145 Artificial Intelligence

22c:145 Artificial Intelligence 22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not

More information

Adaptive ALE-TBox for Extending Terminological Knowledge

Adaptive ALE-TBox for Extending Terminological Knowledge Adaptive ALE-TBox for Extending Terminological Knowledge Ekaterina Ovchinnikova 1 and Kai-Uwe Kühnberger 2 1 University of Tübingen, Seminar für Sprachwissenschaft e.ovchinnikova@gmail.com 2 University

More information

Computing Least Common Subsumers in Description Logics with Existential Restrictions*

Computing Least Common Subsumers in Description Logics with Existential Restrictions* Computing Least Common Subsumers in Description Logics with Existential Restrictions* Franz Baader, Ralf Kiisters, Ralf Molitor LuFg Theoretische Informatik, RWTH Aachen email: {baader,kuesters,molitor}@infonnatik.rwth-aachcn.dc

More information

Consequence-Based Reasoning for Ontology Classification

Consequence-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 information

Ch. 13 Tableaux systems

Ch. 13 Tableaux systems Ch. 13 Tableaux systems Andreas Herzig IRIT-CNRS Toulouse http://www.irit.fr/~andreas.herzig/ 1 Overview tableaux systems: basic ideas tableaux systems: basic definitions tableaux for simple modal logics

More information

Learning Goals of CS245 Logic and Computation

Learning Goals of CS245 Logic and Computation Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction

More information

OWL 2 Rules (Part 1) Tutorial at ESWC2009 May 31, Pascal Hitzler. AIFB, Universität Karlsruhe (TH) Markus Krötzsch

OWL 2 Rules (Part 1)  Tutorial at ESWC2009 May 31, Pascal Hitzler. AIFB, Universität Karlsruhe (TH) Markus Krötzsch OWL 2 Rules (Part 1) Tutorial at ESWC2009 May 31, 2009 Pascal Hitzler AIFB, Universität Karlsruhe (TH) Markus Krötzsch Sebastian Rudolph http://www.pascal-hitzler.de http://korrekt.org http://www.sebastian-rudolph.de

More information

Incomplete Information in RDF

Incomplete Information in RDF Incomplete Information in RDF Charalampos Nikolaou and Manolis Koubarakis charnik@di.uoa.gr koubarak@di.uoa.gr Department of Informatics and Telecommunications National and Kapodistrian University of Athens

More information

Unification in Description Logic EL without top constructor

Unification in Description Logic EL without top constructor Fakultät Informatik EMCL Master Thesis Unification in Description Logic EL without top constructor by Nguyen Thanh Binh born on March 25 th 1984, Cao Bang, Vietnam S upervisor : Prof.Dr.-Ing. Franz Baader

More information

Reasoning About Typicality in ALC and EL

Reasoning 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 information