Propositional Logic: exercises

Slides:



Advertisements
Similar presentations
Logic Concepts Lecture Module 11.
Advertisements

LDK R Logics for Data and Knowledge Representation Modal Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
LDK R Logics for Data and Knowledge Representation Context Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Logics for Data and Knowledge Representation Propositional Logic: Reasoning Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto.
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,
Logical Agents Logic Propositional Logic Summary
LDK R Logics for Data and Knowledge Representation Propositional Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Logics for Data and Knowledge Representation Exercises: DL.
Fallacies The proposition [(p  q)  q]  p is not a tautology, because it is false when p is false and q is true. This type of incorrect reasoning is.
LDK R Logics for Data and Knowledge Representation Modal Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
LDK R Logics for Data and Knowledge Representation PL of Classes.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
LDK R Logics for Data and Knowledge Representation Propositional Logic: Reasoning First version by Alessandro Agostini and Fausto Giunchiglia Second version.
Theorem Proving Semantic Tableaux CIS548 November 15, 2006.
CS6133 Software Specification and Verification
Logics for Data and Knowledge Representation
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.
LDK R Logics for Data and Knowledge Representation ClassL (part 2): Reasoning with a TBox 1.
Nikolaj Bjørner Microsoft Research DTU Winter course January 2 nd 2012 Organized by Flemming Nielson & Hanne Riis Nielson.
Overview I. Whither modal semantics? II. A. Modal syntax.
LDK R Logics for Data and Knowledge Representation Propositional Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
Logics for Data and Knowledge Representation Exercises: DL.
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,
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 ClassL (part 1): syntax and semantics.
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
Propositional Logic (a.k.a. Sentential Logic)
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Propositional Logic: exercises
Logics for Data and Knowledge Representation
Exercises: First Order Logics (FOL)
Logics for Data and Knowledge Representation
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
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.
CIS341 Artificial Intelligence
Logics for Data and Knowledge Representation
Elementary Metamathematics
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Formal Methods in software development
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
Formal Methods in software development
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:

Propositional Logic: exercises Mathematical Logic - 2015 Propositional Logic: exercises Fausto Giunchiglia and Mattia Fumagalli (ref. Chiara Ghidini slides “PL Formalization” and Enzo Maltese sleides “PL Exercises”)

Expansion Rules of Propositional Tableau (P ⟷ Q) = ((P  Q)  (Q  P))

Tableaux: exercise 1 Is the the following formula satisfiable? ((P  Q)  P) (P  Q) P P P Q X

Tableaux: Exercise 2 Is the following formula valid? (and satisifiable?) ((P  Q)  P) (P  Q) P P Q X

Tableaux: Exercise 3 Is the following formula satisifable? ((P  Q)  (P  Q  R)  (P  R)) (P  Q)  (P  Q  R) (P  R) (P  Q) (P  Q  R) P R P Q X (P  Q) R X P Q X X

Tableaux: Exercise 4 Is the following argumentation valid? P  Q, P  Q ⊨ P P  Q P  Q P P P Q X P Q X X

Tableaux: Exercise 5 Check the model for the following formula: (P  Q  P  Q) (P  Q) (P  Q) P Q P Q P Q X X I(P) = True; I(Q) = False I(P) = False; I(Q) = True

Tableaux: Exercise 6 Is the following argumentation valid? P, (P  Q) ⊨ P ⟷ Q P P  Q (P ⟷ Q) P Q X P Q Q P X X

Reduction in CNF

Convert a formula in CNF ¬(¬p  q)  (r  ¬s) ¬(¬p  q)  (¬r  ¬s) (¬¬p  ¬q)  (¬r  ¬s) (p  ¬q)  (¬r  ¬s) NNF (p  ¬r  ¬s)  (¬q  ¬r  ¬s) (C  ¬A)  ¬(B  ¬A) (¬C  ¬A)  ¬(B  ¬A) (¬C  ¬A)  (¬B  ¬¬A) (¬C  ¬A)  (¬B  ¬A)

Convert a formula in CNF SYNTAX :: MODELING A PROBLEM :: SEMANTICS :: LOGICAL IMPLICATION :: REASONING :: SOME NICE PROBLEMS (A  C)  (C  ¬A) ¬(A  C)  (C  ¬A) ¬(A  C)  (¬C  ¬A) ¬A  ¬C  ¬C  ¬A ¬A  ¬ C ((A → B) → A) → A (( A  B)  A)  A ((A  B)  A)  A ((A  A)  (A  B))  A A  (A  B)  A (A  B) A  B