CS621: Artificial Intelligence

1. CS621: Artificial Intelligence Pushpak BhattacharyyaCSE Dept., IIT Bombay Lecture–10: Soundness of Propositional Calculus 12th August, 2010

2. Soundness, Completeness &Consistency Soundness Semantic World ---------- Valuation, Tautology Syntactic World ---------- Theorems, Proofs Completeness * *

3. Soundness • Provability Truth • Completeness • Truth Provability

4. Soundness:Correctness of the System • Proved entities are indeed true/valid • Completeness:Power of the System • True things are indeed provable

5. TRUE Expressions Outside Knowledge System Validation

6. Consistency The System should not be able to prove both P and ~P, i.e., should not be able to derive F

7. Examine the relation between Soundness & Consistency Soundness Consistency

8. If a System is inconsistent, i.e., can derive F , it can prove any expression to be a theorem. Because F P is a theorem

9. InconsistencyUnsoundness To show that FP is a theorem Observe that F, PF ⊢ F By D.T. F ⊢ (PF)F; A3 ⊢ P i.e. ⊢ FP Thus, inconsistency implies unsoundness

10. UnsoundnessInconsistency • Suppose we make the Hilbert System of propositional calculus unsound by introducing (A /\ B) as an axiom • Now AND can be written as • (A(BF ))F • If we assign F to A, we have • (F (BF )) F • But (F (BF )) is an axiom (A1) • Hence F is derived

11. Inconsistency is a Serious issue. Informal Statement of Godel Theorem: If a sufficiently powerful system is complete it is inconsistent. Sufficiently powerful: Can capture at least Peano Arithmetic

12. Introduce Semantics in Propositional logic Valuation Function V Definition of V V(F ) = F Where F is called ‘false’ and is one of the two symbols (T, F) Syntactic ‘false Semantic ‘false’

13. V(F) = F V(AB) is defined through what is called the truth table V(A) V(B) V(AB) T F F T T T F F T F T T

14. Tautology An expression ‘E’ is a tautology if V(E) = T for all valuations of constituent propositions Each ‘valuation’ is called a ‘model’.

15. To see that (FP) is a tautology two models V(P) = T V(P) = F V(FP) = T for both

16. FP is a theorem FP is a tautology Soundness Completeness

17. If a system is Sound & Complete, it does not matter how you “Prove” or “show the validity” Take the Syntactic Path or the Semantic Path

18. Syntax vs. Semantics issue Refers to FORM VS. CONTENT Tea (Content) Form

19. Form & Content Godel, Escher, Bach By D. Hofstadter painter musician logician

20. Problem (P Q)(P Q) Semantic Proof A B P Q P Q P Q AB T F F T T T T T T T F F F F T F T F T T

21. To show syntactically (P Q) (P Q) i.e. [(P (Q F )) F ] [(P F ) Q]

22. If we can establish (P (Q F )) F , (P F ), Q F ⊢ F This is shown as Q F hypothesis (Q F ) (P (Q F)) A1

23. QF; hypothesis (QF)(P(QF)); A1 P(QF); MP F; MP Thus we have a proof of the line we started with

24. Soundness Proof Hilbert Formalization of Propositional Calculus is sound. “Whatever is provable is valid”

25. Statement Given A1, A2, … ,An|- B V(B) is ‘T’ for all Vs for which V(Ai) = T

26. Proof Case 1 B is an axiom V(B) = T by actual observation Statement is correct

27. Case 2 B is one of Ais if V(Ai) = T, so is V(B) statement is correct

28. Case 3 B is the result of MP on Ei & Ej Ejis Ei B Suppose V(B) = F Then either V(Ei) = F or V(Ej) = F . . . Ei . . . Ej . . . B

29. i.e. Ei/Ej is result of MP of two expressions coming before them Thus we progressively deal with shorter and shorter proof body. Ultimately we hit an axiom/hypothesis. Hence V(B) = T Soundness proved

30. A puzzle(Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus

31. Tourist in a country of truth-sayers and liers • Facts and Rules: In a certain country, people either always speak the truth or always lie. A tourist T comes to a junction in the country and finds an inhabitant S of the country standing there. One of the roads at the junction leads to the capital of the country and the other does not. S can be asked only yes/no questions. • Question: What single yes/no question can T ask of S, so that the direction of the capital is revealed?

32. Diagrammatic representation Capital S (either always says the truth Or always lies) T (tourist)

33. Deciding the Propositions: a very difficult step- needs human intelligence • P: Left road leads to capital • Q: S always speaks the truth

34. Meta Question: What question should the tourist ask • The form of the question • Very difficult: needs human intelligence • The tourist should ask • Is R true? • The answer is “yes” if and only if the left road leads to the capital • The structure of R to be found as a function of P and Q

35. A more mechanical part: use of truth table

36. Get form of R: quite mechanical • From the truth table • R is of the form (P x-nor Q) or (P ≡ Q)

37. Get R in English/Hindi/Hebrew… • Natural Language Generation: non-trivial • The question the tourist will ask is • Is it true that the left road leads to the capital if and only if you speak the truth? • Exercise: A more well known form of this question asked by the tourist uses the X-OR operator instead of the X-Nor. What changes do you have to incorporate to the solution, to get that answer?