1. Logic- Meaning & Logical Reasoning Neil Heffernan (Slides from Andrew Moore at CMU) See Chapter 6 of Russell and Norvig

4. Goal: Make Logical Decesions Adjancent squares (not diagonal) to wumps are stenchy Next to pit are breezes Agents don’t know where they are- they will percive a bump if they try to walk into a wall. Shoot wumpus with one arrow in straight line Die if move into room with wumpus Goal- get in and get out with gold in as few as moves as possible.

9. Truth Tables PQ ? True FalseTrue FalseTrue False

10. Truth Tables PQ ? True False TrueFalse True False True

11. Truth Tables PQ ? True False TrueFalse

12. Truth Tables PQ P => Q True ? False? True? False ? True False True If P is true that I am claim that Q is true, otherwise I am making no claim

13. Truth Tables PQ P Q True ? False? True? False ? True False True

14. Valid Sentences (Tautologies) A sentence is valid if it is true in all possible worlds P or not P true P v Q is not valid for it is only true is the worlds where wither P or Q is true.

15. Satisfiable A sentence is satisfiable only if there is some interpretion that makes it true. P True False is not satisfiable P and not P is not satisifaible

16. PQR TTT TTF TFT TFF FTT FTF FFT FFF

17. P v Q  (Q  R) PQRP v Q QRQRP v Q  (Q  R) TTTTTT TTFTFF TFTTFF TFFTTT FTTTTT FTFTFF FFTFFT FFFFTT

18. Draw a venn Diagram representing satisfiable sentences, valid sentences and unstatisfiable sentence.

24. Answer Your knowledge base has many sentences about that relates P, Q, R, S and T like –P v Q  (S v T) –~P v S –etc You want to know if some arbiraty statement like (R  Q) v T You contruct and implication statement like –(Knowledgebase and’ed togheter) => ((R  Q) v T) –Premise => conclusion

25. …. (an inference proceudre is complete if you can find a proof for any sentence entitled in the knowledge base) This truth table method of inference is Complete- because it is always possible to enemeurate out all of the 2^n rows for any proof invovling n propositional symbols

28. How do you show that these inference rules are sound (that they don’t cause you to entail things that are not in your knoweldge base)

29. Prove that the four rules are sound

35. Our agent needs to be able to act Can we ask the knowledge base what action we should take?

36. No- But we can encode things not to do like “Don’t go forward if the wumpus is in front of you” A(1,1) ^ East(A) ^ W(2,1) => ~Forward How many rules do we need for this?

38. Practice Is this valid? Prove it or show counter example –P^(Q V R)  (P ^ Q) v (P ^ R)