LDK R Logics for Data and Knowledge Representation Modal Logic: exercises Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,

Slides:



Advertisements
Similar presentations
LDK R Logics for Data and Knowledge Representation Exercises: First Order Logics (FOL) Originally by Alessandro Agostini and Fausto Giunchiglia Modified.
Advertisements

Modal Logic with Variable Modalities & its Applications to Querying Knowledge Bases Evgeny Zolin The University of Manchester
Possible World Semantics for Modal Logic
Distributed knowledge & beliefs Lennart v. Luijk Tijs Zwinkels Jeroen Kuijpers Jelle Prins.
LDK R Logics for Data and Knowledge Representation Modal Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Logics for Data and Knowledge Representation Modeling Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia, Rui Zhang.
Artificial Intelligence Modal Logic
CPSC 322, Lecture 20Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Computer Science cpsc322, Lecture 20 (Textbook.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
Artificial Intelligence Modal Logic Systems
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Logics for Data and Knowledge Representation Introduction to Algebra Chiara Ghidini, Luciano Serafini, Fausto Giunchiglia and Vincenzo Maltese.
LDK R Logics for Data and Knowledge Representation Context Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Automaten und Formale Sprachen Epilog
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation Propositional Logic: Reasoning Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto.
LDK R Logics for Data and Knowledge Representation Modeling First version by Alessandro Agostini and Fausto Giunchiglia Second version by Fausto Giunchiglia.
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
Logics for Data and Knowledge Representation Exercises: Modeling Fausto Giunchiglia, Rui Zhang and Vincenzo Maltese.
LDK R Logics for Data and Knowledge Representation First Order Logics (FOL) Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto.
LDK R Logics for Data and Knowledge Representation Context Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
LDK R Logics for Data and Knowledge Representation ClassL (part 3): Reasoning with an ABox 1.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
LDK R Logics for Data and Knowledge Representation Propositional Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
LDK R Logics for Data and Knowledge Representation Modal Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
LDK R Logics for Data and Knowledge Representation Propositional Logic: Reasoning First version by Alessandro Agostini and Fausto Giunchiglia Second version.
LDK R Logics for Data and Knowledge Representation Query languages Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
IB Computer Science – Logic
Reasoning about Knowledge 1 INF02511: Knowledge Engineering Reasoning about Knowledge (a very short introduction) Iyad Rahwan.
4.1 Proofs and Counterexamples. Even Odd Numbers Find a property that describes each of the following sets E={…, -4, -2, 0, 2, 4, 6, …} O={…, -3, -1,
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
MODAL LOGIC Mathematical Logic and Theorem Proving Pavithra Prabhakar.
LDK R Logics for Data and Knowledge Representation ClassL (Propositional Description Logic with Individuals) 1.
LDK R Logics for Data and Knowledge Representation First Order Logics (FOL) Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto.
Logics for Data and Knowledge Representation Exercises: ClassL Fausto Giunchiglia, Rui Zhang and Vincenzo Maltese.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
LDK R Logics for Data and Knowledge Representation Context Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
LDK R Logics for Data and Knowledge Representation Propositional Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Knowledge Representation and Reasoning
1 Lecture 3 The Languages of K, T, B and S4. 2 Last time we extended the language PC to the language S5 by adding two new symbols ‘□’ (for ‘It is necessary.
MA10209 – Week 3 Tutorial B3/B4, Andrew Kennedy. people.bath.ac.uk/aik22/ma10209 How to go about a proof  Step 1: Identify what you need to show  Sometimes.
Mathematical Logics Course introduction. Forehead  Lecturers: Fausto Giunchiglia, Vincenzo Maltese  Scheduling: Tuesday 8:30-10:30, room A107 Thursday.
LDK R Logics for Data and Knowledge Representation Modal Logic: exercises Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Logics for Data and Knowledge Representation
Modal, Dynamic and Temporal Logics
Proving Statements about Segments
Exercises: First Order Logics (FOL)
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Propositional Logic: exercises
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Mathematical Logics Course introduction 1.
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Presentation transcript:

LDK R Logics for Data and Knowledge Representation Modal Logic: exercises Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia, Rui Zhang and Vincenzo Maltese

Truth relation (true in a world)  Given a Kripke Model M =, a proposition P ∈ L ML and a possible world w ∈ W, we say that “w satisfies P in M” or that “P is satisfied by w in M” or “P is true in M via w”, in symbols: M, w ⊨ P in the following cases: 1. P atomicw ∈ I(P) 2. P =  QM, w ⊭ Q 3. P = Q  TM, w ⊨ Q and M, w ⊨ T 4. P = Q  TM, w ⊨ Q or M, w ⊨ T 5. P = Q  TM, w ⊭ Q or M, w ⊨ T 6. P = □ Q for every w’ ∈ W such that wRw’ then M, w’ ⊨ Q 7. P = ◊ Q for some w’ ∈ W such that wRw’ then M, w’ ⊨ Q NOTE: wRw’ can be read as “w’ is accessible from w via R” 2

Kinds of frames  Serial: for every w ∈ W, there exists w’ ∈ W s.t. wRw’  Reflexive: for every w ∈ W, wRw  Symmetric: for every w, w’ ∈ W, if wRw’ then w’Rw

Kinds of frames  Transitive: for every w, w’, w’’ ∈ W, if wRw’ and w’Rw’’ then wRw’’  Euclidian: for every w, w’, w’’ ∈ W, if wRw’ and wRw’’ then w’Rw’’

Semantics: Kripke Model  Given the Kripke model M = with: W = {1, 2}, R = {, }, I(A) = {1,2} and I(B) = {1} (a) Say whether the frame is serial, reflexive, symmetric, transitive or Euclidian. It is serial, transitive and euclidian. (b) Is M, 1 ⊨ ◊  B? Yes, because 2 is accessible from 1 and M, 2 ⊨  B (c) Prove that □ A is satisfiable in M By definition, it must be M, w ⊨ □ A for all w in W. It is satisfiable because M, 2 ⊨ A and for all worlds w in {1, 2}, 2 is accessible from w A, B A

Semantics: Kripke Model  Given the Kripke model M = with: W = {1, 2, 3}, R = {,,, }, I(A) = {1, 2} and I(B) = {2, 3} (a) Say whether the frame is serial, reflexive, symmetric, transitive or Euclidian. It is serial. (b) Is M, 1 ⊨ ◊(A  B)? By definition, there must be a world w accessible from 1 where A  B is true. Yes, because A  B is true in 2 and 2 is accessible from AA, BB

Semantics: Kripke Model  Given the Kripke model M = with: W = {1, 2, 3}, R = {,,, }, I(A) = {1, 2} and I(B) = {2, 3} (c) Is □ A satisfiable in M? By definition, it must be M, w ⊨ □ A for all worlds w in W. This means that for all worlds w there is a world w’ such that wRw’ and M, w’ ⊨ A. For w = 1 we have 1R3 and M, 3 ⊨  A. Therefore the response is NO AA, BB

Semantics: Kripke Model  Given the Kripke model M = with: W = {1, 2, 3}, R = {,,, } I(A) = {1, 2} and I(B) = {1, 3} (a) Say whether the frame is serial, reflexive, symmetric, transitive or Euclidian. It is serial (b) Is M, 1 ⊨ ◊  A? By definition, there must be a world w accessible from 1 where  A is true. Yes, because A is false in 3 and 3 is accessible from A, BAB

Semantics: Kripke Model  Given the Kripke model M = with: W = {1, 2, 3}, R = {,,, } I(A) = {1, 2} and I(B) = {1, 3} (c) Is ◊B satisfiable in M? We should have that M, w ⊨ ◊B for all worlds w. This means that for all worlds w there is at least a w’ such that wRw’ and M, w’ ⊨ B. However for w = 3 we have only 3R2 and B is false in 2. Therefore the response is NO A, BAB