SLIDE 1
Logical Structures in Natural Language: Exercises Propositional Logic (In class on Wed. 12th)
Universit` a di Trento
1 Formalization problems
1.1 Colouring problem
Given the graph:
- Italy is connected to Austria
- Austria is connected to Hungary
Find a coloring function C : V → {black, white} such that no two adjacent countries have the same color. Solution Vertex axioms: (the dual are redundant) [Uniqueness constraint] (¬WI ↔ BI) (¬WH ↔ BH) (¬WA ↔ BA) Edge axioms: (the dual are redundant) [Explicit Constraints] (BI ↔ ¬BA) ∧ (WI ↔ ¬WA) (BH ↔ ¬BA) ∧ (WH ↔ ¬WA) In this way you are implicitly stating that Italy is adjacent to A and A is adjacent to Hungary. And you get a simpler tableaux.
2 To be done at home and to be checked in class on Thu 13rd
2.1 Boxes
Formalise the following puzzle in propositional logic, find the solution using first truth tables and then a tableaux procedure and build a counterexample if the argument is not valid. Three boxes are presented to you. One contains gold, the other two are empty. Each box has imprinted on it a clue as to its contents; the clues are (Box 1) “The gold is not here”, (Box 2) “The gold is not here”, and (Box 3) “The gold is in Box 2”. Only one message is true; the other two are
- false. Which box has the gold?