A Survey of Temporal Knowledge Representations
|
|
- Briana Allison
- 6 years ago
- Views:
Transcription
1 A Survey of Temporal Knowledge Representations Advisor: Professor Abdullah Tansel Second Exam Presentation
2 Knowledge Representations logic-based logic-base formalisms formalisms more complex and difficult to understand all based on formal logic Syntax Semantics E.g.: Description Logics non logic-based formalisms closer to human intuition therefore easier to understand usually don t have consistent semantics E.g.: Semantic Networks Frame-based representations Rule-based representations
3 FOL as Semantic Web Language? Why not simply take FOL for Ontologies? FOL can do everything.. compare higher programming Languages to assemblers FOL has high expressivity too bulky for modelling not appropriate to find consensus in modelling proof theoretically very complex (semidecidable) FOL is also not a markup language Look for an appropriate fragment of FOL
4 Description Logics (DLs) DLs are Fragments of FOL In DL from simple descriptions more complex descriptions are created with the help of Constructors. DLs differ in the applied constructors (Expressivity) DLs have been developed from semantic Networks DLs are decidable (most times) DLs possess sufficient expressivity (most times) DLs are related to modal logics e.g., W3C Standard OWL 2 DL is based on description logics SHROIQ(D)
5 Attributive Language with complements ALC Building Blocks: Concepts/ Classes Roles / Properties Individuals Student(John) Individual John is of class Student Lecture(Database) Individual Database is of class lecture attendslecture(john,database) John attends the lecture Database
6 ALC - Building Blocks Atomic Types Concept names A,B,... Special concepts - Top (universal concept) - Bottom concept Role names R,S,... Constructors Negation: C Conjunction: C Disjunction: C Existential quantifier: R.C Universal quantifier: R.C D D
7 ALC - Building Blocks Class Inclusion Professor FacultyMember every Professor isa Faculty Member In FOL equals ( x)(professor(x) FacultyMember(x)) Class Equivalence Professor FacultyMember the Faculty Members are exactly the Professors In FOL equals ( x)(professor(x) FacultyMember(x))
8 ALC - Complex Class Relations Conjunction Disjunction Negation Professor (Person UniversityEmployee) (Person Student) ( x)(professor(x) ((Person(x) Λ UniversityEmployee(x)) V (Person(x) Λ Student(x)))
9 ALC - Quantifiers on Roles Strict Binding of the Range of a Role to a Class Examination hassupervisor.professor An Examination must be supervised by a Professor ( x)(examination(x) ( y)(hassupervisor(x,y) Professor(y))) Open Binding of the Range of a Role to a Class Examination hassupervisor.person Every Examinationhas at least one supervisor (who is a person) ( x)(examination(x) ( y)(hassupervisor(x,y) Λ Person(y)))
10 ALC - Formal Syntax Production rules for creating classes in ALC: (A is an atomic class, C and D are complex classes and R is a Role) C,D := A C C D C D R.C R.C
11 ALC - Formal Syntax Production rules for creating classes in ALC: (A is an atomic class, C and D are complex classes and R is a Role) C,D := A C C D C D R.C R.C An ALC TBox contains assertions of the form C and C D, where C,D are complex classes. D
12 ALC - Formal Syntax Production rules for creating classes in ALC: (A is an atomic class, C and D are complex classes and R is a Role) C,D := A C C D C D R.C R.C An ALC TBox contains assertions of the form C and C D, where C,D are complex classes. An ALC ABox contains assertions of the form C(a) and R(a,b), where C is a complex Class, R a Role and a,b Individuals. D
13 ALC - Formal Syntax Production rules for creating classes in ALC: (A is an atomic class, C and D are complex classes and R is a Role) C,D := A C C D C D R.C R.C An ALC TBox contains assertions of the form C and C D, where C,D are complex classes. An ALC ABox contains assertions of the form C(a) and R(a,b), where C is a complex Class, R a Role and a,b Individuals. An ALC-Knowledge Base contains an ABox and a TBox. D
14 ALC - Semantic (Interpretation) we define a model-theoretic semantic for ALC (i.e. Entailment will be defined via Interpretations) an Interpretation I=(Δ I,. I ) contains a set Δ I (Domain)of Individuals and an interpretation function Individual names a to domain elements a I Δ I. I that maps Class names C to a set of domain elements C I Δ I Role names R to a set of pairs of domain elements R I Δ I Δ I
15 ALC - Semantic (Interpretation) Individual Names Class Names Role Names
16 ALC - Semantic (Interpretation) Extension for complex classes: I = Δ I and I =
17 ALC - Semantic (Interpretation) Extension for complex classes: I = Δ I and I = (C (C D) I D) I = = C I C I D I D I and
18 ALC - Semantic (Interpretation) Extension for complex classes: I = Δ I and I = (C (C D) I D) I = = C I C I D I D I and ( C) I = Δ I \ C I
19 ALC - Semantic (Interpretation) Extension for complex classes: I = Δ I and I = (C (C D) I D) I = = C I C I D I D I and ( C) I = Δ I \ C I R.C={a Δ I ( b Δ I )((a,b) R I b C I )}
20 ALC - Semantic (Interpretation) Extension for complex classes: I = Δ I and I = (C (C D) I D) I = = C I C I D I D I and ( C) I = Δ I \ C I R.C={a Δ I ( b Δ I )((a,b) R I b C I )} R.C={a Δ I ( b Δ I )((a,b) R I b C I )}
21 ALC - Semantic (Interpretation)...and Axioms: C(a) holds, iff a I C I R(a,b) holds, iff (a I,b I ) R I C D holds, iff C I D I C D holds, iff C I = D I
22 ALC - Knowledgebase Terminological Knowledge (TBox) Axioms that describe the structure ofthe modeled domain (conceptional schema): Human parentof.human Orphan Human hasparent.alive Assertional Knowledge (ABox) Axioms that describe specific situations (data): Orphan(harrypotter) hasparent(harrypotter,jamespotter)
23 Tableaux Algorithm: Proof algorithm to check the consistency of a logical formula by inferring that its negation is a contradiction (proof by refutation). Construct tree, where each node is marked with a logical formula. A path from the root to a leaf is the conjunction of all formulas represented within the nodes of the path; a branch of the path represents a disjunction. The tree is created by successive application of the Tableaux Extension Rules. (q r) (p r) r (q r) (p r) r q (p r) r r p r
24 Tableaux Algorithm for Description Logics Transformation to Negation normalform necessary Let W be a knowledge base, Substitute C D by C D and D C Substitute C D by C D. Apply the NNF Transformations from the next page Resulting knowledge base NNF(W) Negation normalform of W. Negation is placed directly in front of atomic classes.
25 Tableaux Transformation in Negation Normalform NNF Transformations NNF(C) = C, if C NNF( C) = C, if NNF( C) = NNF(C D) = NNF(C D) = NNF( (C D)) NNF( (C D)) NNF( R.C) = NNF( R.C) = NNF( R.C) NNF( R.C) NNF(C) NNF(C) NNF(C) = = is atomic C is atomic NNF(D) NNF(D) = NNF( C) = NNF( C) R.NNF(C) R.NNF(C) R.NNF( C) R.NNF( C) NNF( D) NNF( D) W and NNF(W) are logically equivalent.
26 Tableaux Transformation in Negation Normalform Example: P (E U) ( E D) In NNF: P (E U) (E D) C D (C D)= = C C D D
27 Tableaux Extension Rules for DL Selection C(a) W (ABox) R(a,b) W (ABox) C W (TBox) (C D)(a) A (C D)(a) A ( R.C)(a) A ( R.C)(a) A Action Add C(a) Add R(a,b) Add C(a) for a known Individual a Add C(a) and D(a) Split the path. Add (1) C(a) and (2) D(a) Add R(a,b) and C(b) for a new Individual b if R(a,b) A, then add C(b) Ifthe resulting tableaux is closed, the original knowledge base is unsatisfiable. Only select elements that lead to new elements within the tableaux. If this is not possible, then the algorithm terminates and the original knowledge base is satisfiable.
28 Tableaux Algorithm (DL) Example: P E U D Professor Person University Employee Student Knowledge Base: P (E U) (E D) Is P E a logical consequence? Knowledge Base (with [negated] query)in NNF: { P (E U) (E D),(P E)(a)}
29 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)}
30 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A:
31 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A: (1)(P E)(a)(from knowledge base)
32 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A: (1)(P E)(a)(from knowledge base) (2 α from 1) P(a)
33 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A: (1)(P E)(a)(from knowledge base) (2 α from 1) P(a) (3 α from 1) E(a)
34 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A: (1)(P E)(a)(from knowledge base) (2 α from 1) P(a) (3 α from 1) E(a) (4)( P (E U) (E D))(a)(from knowledge base)
35 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A: (1)(P E)(a)(from knowledge base) (2 α from 1) P(a) (3 α from 1) E(a) (4)( P (E U) (E D))(a)(from knowledge base) (5 β from 4)) P(a) (6)((E U) (E D))(a)
36 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A: (1)(P E)(a)(from knowledge base) (2 α from 1) P(a) (3 α from 1) E(a) (4)( P (E U) (E D))(a)(from knowledge base) (5 β from 4)) P(a) (6)((E U) (E D))(a) (7 β from 6) (E U)(a) (8) (E D)(a)
37 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A: (1)(P E)(a)(from knowledge base) (2 α from 1) P(a) (3 α from 1) E(a) (4)( P (E U) (E D))(a)(from knowledge base) (5 β from 4)) P(a) (6)((E U) (E D))(a) (7 β from 6) (E U)(a) (8) (E D)(a) (9 α from 7) E(a)
38 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A: (1)(P E)(a)(from knowledge base) (2 α from 1) P(a) (3 α from 1) E(a) (4)( P (E U) (E D))(a)(from knowledge base) (5 β from 4)) P(a) (6)((E U) (E D))(a) (7 β from 6) (E U)(a) (8) (E D)(a) (9 α from 7) E(a) (11 α from 7)U(a)
39 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A: (1)(P E)(a)(from knowledge base) (2 α from 1) P(a) (3 α from 1) E(a) (4)( P (E U) (E D))(a)(from knowledge base) (5 β from 4)) P(a) (6)((E U) (E D))(a) (7 β from 6) (E U)(a) (8) (E D)(a) (9 α from 7) E(a) (10 α from 8) E(a) (11 α from 7)U(a)
40 Tableaux Algorithm (DL) Example: Knowledge Base W:{ P (E U) (E D),(P E)(a)} Tableaux A: (1)(P E)(a)(from knowledge base) (2 α from 1) P(a) (3 α from 1) E(a) (4)( P (E U) (E D))(a)(from knowledge base) (5 β from 4)) P(a) (6)((E U) (E D))(a) (7 β from 6) (E U)(a) (8) (E D)(a) (9 α from 7) E(a) (11 α from 7)U(a) (10 α from 8) E(a) (12 α from 8) D(a)
41 Tableaux Algorithm (DL) with Blocking The Selection of ( R.C)(a) in the tableaux path A is blocked, if there is already an individualb with {C C(a) A} {C C(b) A}. Two possibilities of termination: 1. Closing the Tableaux. Knowledge Base is unsatisfiable. 2. All non blocked selections from thetableaux don t lead to an extension. Knowledge Base is satisfiable.
42 Temporal extensions of DLs How can time be modelled?
43 Temporal extensions of DLs How can time be modelled? Point-based notion of time Interval-based notion of time
44 Temporal extensions of DLs How can time be modelled? Point-based notion of time Interval-based notion of time How can the temporal dimension be handled?
45 Temporal extensions of DLs How can time be modelled? Point-based notion of time Interval-based notion of time How can the temporal dimension be handled? Implicit notion of time: sequences of events through state-change representations Explicit notion of time: definition of temporal operators and new formulae
46 Temporal extensions of DLs How can time be modelled? Point-based notion of time Interval-based notion of time How can the temporal dimension be handled? Implicit notion of time: sequences of events through state-change representations Explicit notion of time: definition of temporal operators and new formulae Internal point of view: different states of an individual are modelled as different individual components External point of view: an individual has different states in different moments
47 An Example How to become a doctor: Be a PhD student for some years (5-6) Defend a thesis Become a doctor Let s try to model it with different temporal Description Logics!
48 Combining Description Logics and Tense Operators: ALCT [Sch93] Combination of ALC with point-based modal temporal connectives Time part of the semantic structure Recall: an individual has different states at different moments Temporal connectives can be applied only to concepts
49 An Example Every doctor has been a PhD student in the past Every thesis defenderis a PhD student that has been a PhD student in the past
50 An Example Every doctor has been a PhD student in the past Every thesis defenderis a PhD student that has been a PhD student in the past
51 Example Every doctor has been a PhD student in the past Every thesis defenderis a PhD student that has been a PhD student in the past
52 Interval-based Temporal DLs Schmiedel s Formalism Idea Examples Bettini,The Undecidable Realm Idea Examples Artale and Franconi, Towards Decidable Logic Idea Examples
53 Interval-based Temporal DLs: Characteristics Interval-based - Explicit, eg: alltime, TE - Follows the external approach, eg: C<i,a> for temporalconcept assertions and R<i, a,b> for temporal role assertions
54 Schmiedel s Formalism: Idea The first of such an interval-based temporal DL (proposed in 1990) Underlying DL = FLEN R (no T,,, but with cardinality restrictions on roles, and role conjunction) - Temporal operators = at, alltime, sometime - Subsumption is argued to be undecidable
55 Schmiedel s Formalism: Examples Concept: PhD students during 1993 (at 1993 PhDStudent) Terminological Axiom: Doctors were PhD students
56 The Undecidable Realm: Idea Proposed by Bettini Variable-free extension with existential and universal temporal quantification - Arbitrary relationships between more than two intervals can t be represented Satisfiability and subsumptionare undecidable Starting from the DL ALCN Two concept constructors: TE.C and TE.C
57 The Undecidable Realm: Examples Concept: Persons who become a doctor sometime after.doctor, eg: <1990, michael>belongs to this, if <1992, michael>belongs to Doctor Terminological Axiom: Doctors were PhD students Doctor (metby ).PhDStudent
58 Towards Decidable Logics: Idea Developed by Artale and Franconi Decidable: Expressivity is reduced, universal quantificationon temporal variables has been eliminated Underlying DL (most expressive): T L-ALCF Temporal variables are introduced by the temporalexistential quantifier, excluding the predefined temporal var #
59 Towards Decidable Logics: Examples Terminological Axiom: Doctors were PhD students Terminological Axiom: PhD thesis defendersfinish their PhDs
60 The Semantic Web The Semantic Web is an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation. [Berners-Lee et al, 2001]
61 The Semantic Web Web pages are written in HTML HTML describes the structure of information HTML describes the syntax not the semantics If computers machines can understand the meaning behind the information on the web, not just simply display it. They can learn what we are interested in. They can help us better find what we want. This is really what the semantic web is all about.
62 The Semantic Web The goal of the semantic web is that it would be possible for machines to understand the information on the web rather than simply display. The major obstacle to this goal is the fact that most information on the web is designed solely for human consumption. This information should be structured in a way that machines can understand and process that information. The key technological threads that are currently employed in the development of Semantic Web are: extensible Markup Language (XML), Resource Description Framework (RDF), and Web Ontology Language (OWL)
63 RDF Triple RDF is a W3C standard for describing resources in the web An RDF Triple (s,p,o) is such that: s, p are URI-s, ie, resources on the Web; o is a URI or a literal s, p, and o stand for subject, property, and object RDF is a general model for such triples with machine readable formats like RDF/XML.
64 RDF Graph Representation
65 RDF Schema: Basic Ideas RDF is a universal language that enables users to describe their own vocabularies. But, RDF does not make assumption about any particular domain. It is up to user to define this in RDF schema.
66 What does RDF Schema add? Defines vocabulary for RDF Organizes this vocabulary in a typed hierarchy Class, subclassof, type Property, subpropertyof domain, range Staff subclassof subclassof Schema(RDFS) Lecturer domain supervisedby range Research Assistant type Tom supervisedby Alan type Data(RDF)
67 Temporal RDF
68 OWL Web Ontology Language (OWL) extends RDF by adding several other constructs such as owl:class (in addition to the rdfs:class), relationships between class and individuals, and property characteristics Follows Description Logic in having class, property, and individuals Allows setting the cardinality constraints
69 Reification WorksFor(Employee, Company, TimeInterval) representing the fact that an employee works for a company during a specific time interval.
70 4D fluent WorksFor(Employee, Company, TimeInterval) representing the fact that an employee works for a company during a specific time interval.
71 Thank You
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 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. 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 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 informationStructured 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 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 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 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 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 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 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 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 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 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 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 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 informationDescription Logics. Deduction in Propositional Logic. franconi. Enrico Franconi
(1/20) Description Logics Deduction in Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/20) Decision
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 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 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 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 informationRDF and Logic: Reasoning and Extension
RDF and Logic: Reasoning and Extension Jos de Bruijn Faculty of Computer Science, Free University of Bozen-Bolzano, Italy debruijn@inf.unibz.it Stijn Heymans Digital Enterprise Research Institute (DERI),
More informationA 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 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 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 informationKnowledge 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 informationExpressive 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 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 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 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 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 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 informationRevision 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 informationAdaptive 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 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 informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic - sequent calculus To overcome the problems of natural
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 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 informationA METRIC INTERVAL-BASED TEMPORAL DESCRIPTION LOGIC
A METRIC INTERVAL-BASED TEMPORAL DESCRIPTION LOGIC A METRIC INTERVAL-BASED TEMPORAL DESCRIPTION LOGIC By MORTEZA YOUSEF SANATI, B.Sc., M.Sc. A Thesis Submitted to the School of Graduate Studies in Partial
More informationOn 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 informationT Reactive Systems: Temporal Logic LTL
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most
More informationDescription 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 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 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 informationIntroduction to Isabelle/HOL
Introduction to Isabelle/HOL 1 Notes on Isabelle/HOL Notation In Isabelle/HOL: [ A 1 ;A 2 ; ;A n ]G can be read as if A 1 and A 2 and and A n then G 3 Note: -Px (P x) stands for P (x) (P(x)) -P(x, y) can
More informationSemantics and Pragmatics of NLP
Semantics and Pragmatics of NLP Alex Ewan School of Informatics University of Edinburgh 28 January 2008 1 2 3 Taking Stock We have: Introduced syntax and semantics for FOL plus lambdas. Represented FOL
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 informationA 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 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 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 informationFirst-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig
First-Order Logic First-Order Theories Roopsha Samanta Partly based on slides by Aaron Bradley and Isil Dillig Roadmap Review: propositional logic Syntax and semantics of first-order logic (FOL) Semantic
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 informationKnowledge 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 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 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 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 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 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 informationDecidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, 2010. Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms Chan
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationCompleting Description Logic Knowledge Bases using Formal Concept Analysis
Completing Description Logic Knowledge Bases using Formal Concept Analysis Franz Baader, 1 Bernhard Ganter, 1 Barış Sertkaya, 1 and Ulrike Sattler 2 1 TU Dresden, Germany and 2 The University of Manchester,
More informationDL-Lite Contraction and Revision
Journal of Artificial Intelligence Research 56 (2016) 329-378 Submitted 12/15; published 06/16 DL-Lite Contraction and Revision Zhiqiang Zhuang Institute for Integrated and Intelligent Systems Griffith
More informationOWL 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 informationAdding 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 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 informationCompleting 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 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 informationLearning 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 informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationDeduction by Daniel Bonevac. Chapter 3 Truth Trees
Deduction by Daniel Bonevac Chapter 3 Truth Trees Truth trees Truth trees provide an alternate decision procedure for assessing validity, logical equivalence, satisfiability and other logical properties
More informationCOMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati"
COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati" Last week" Main components of PRM" Collision check for a configuration"
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationFirst-Order Logic (FOL)
First-Order Logic (FOL) Also called Predicate Logic or Predicate Calculus 2. First-Order Logic (FOL) FOL Syntax variables x, y, z, constants a, b, c, functions f, g, h, terms variables, constants or n-ary
More informationPropositional Resolution Introduction
Propositional Resolution Introduction (Nilsson Book Handout) Professor Anita Wasilewska CSE 352 Artificial Intelligence Propositional Resolution Part 1 SYNTAX dictionary Literal any propositional VARIABLE
More informationTimo Latvala. February 4, 2004
Reactive Systems: Temporal Logic LT L Timo Latvala February 4, 2004 Reactive Systems: Temporal Logic LT L 8-1 Temporal Logics Temporal logics are currently the most widely used specification formalism
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
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 informationMotivation. CS389L: Automated Logical Reasoning. Lecture 10: Overview of First-Order Theories. Signature and Axioms of First-Order Theory
Motivation CS389L: Automated Logical Reasoning Lecture 10: Overview of First-Order Theories Işıl Dillig Last few lectures: Full first-order logic In FOL, functions/predicates are uninterpreted (i.e., structure
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 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 informationConservative Extensions in Expressive Description Logics
Conservative Extensions in Expressive Description Logics Carsten Lutz 1, Dirk Walther 2, Frank Wolter 2 1 Institut für Theoretische Informatik, TU Dresden, Germany 2 Department of Computer Science, University
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 informationPropositional and Predicate Logic - V
Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus
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 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 informationChapter 4: Computation tree logic
INFOF412 Formal verification of computer systems Chapter 4: Computation tree logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 CTL: a specification
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 informationFrom Tableaux to Automata for Description Logics
From Tableaux to Automata for Description Logics Franz Baader 1, Jan Hladik 1, Carsten Lutz 1, and Frank Wolter 2 1 Theoretical Computer Science, TU Dresden, D-01062 Dresden, Germany, {baader,hladik,lutz}@tcs.inf.tu-dresden.de
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 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 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 informationClassical First-Order Logic
Classical First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) First-Order Logic (Classical) MFES 2008/09
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 Fuzzy Description Logic for Multimedia Knowledge Representation
A Fuzzy Description Logic for Multimedia Knowledge Representation Giorgos Stoilos 1, Giorgos Stamou 1, Vassilis Tzouvaras 1, Jeff Z. Pan 2 and Ian Horrocks 2 1 Department of Electrical and Computer Engineering,
More informationTemporal Representation and Reasoning in OWL 2
Semantic Web 0 (2016) 1 21 1 IOS Press Temporal Representation and Reasoning in OWL 2 Editor(s): Aldo Gangemi, ISTC-CNR, Italy & Université Paris 13, France Solicited review(s): Anisa Rula, Università
More informationFORMAL METHODS LECTURE III: LINEAR TEMPORAL LOGIC
Alessandro Artale (FM First Semester 2007/2008) p. 1/39 FORMAL METHODS LECTURE III: LINEAR TEMPORAL LOGIC Alessandro Artale Faculty of Computer Science Free University of Bolzano artale@inf.unibz.it http://www.inf.unibz.it/
More informationInference in Probabilistic Ontologies with Attributive Concept Descriptions and Nominals URSW 2008
Inference in Probabilistic Ontologies with Attributive Concept Descriptions and Nominals URSW 2008 Rodrigo B. Polastro - Fabio G. Cozman rodrigopolastro@usp.br - fgcozman@usp.br Decision Making Lab, Escola
More informationAn 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 informationOverview. CS389L: Automated Logical Reasoning. Lecture 7: Validity Proofs and Properties of FOL. Motivation for semantic argument method
Overview CS389L: Automated Logical Reasoning Lecture 7: Validity Proofs and Properties of FOL Agenda for today: Semantic argument method for proving FOL validity Işıl Dillig Important properties of FOL
More information