cs621: artificial intelligencecs621-2011/lectures... · (zohar manna, mathematical theory of...
TRANSCRIPT
![Page 1: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/1.jpg)
CS621: Artificial Intelligence
Pushpak BhattacharyyaCSE Dept., IIT Bombay
Lecture–10: Soundness of Propositional Calculus
12th August, 2010
![Page 2: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/2.jpg)
Soundness, Completeness &Consistency
Soundness
Syntactic World
----------Theorems,
Proofs
SemanticWorld
----------Valuation,Tautology
Soundness
Completeness
* *
![Page 3: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/3.jpg)
� Soundness
� Provability Truth� Provability Truth
� Completeness
� Truth Provability
![Page 4: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/4.jpg)
� Soundness: Correctness of the System
� Proved entities are indeed true/valid
� Completeness: Power of the System
� True things are indeed provable
![Page 5: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/5.jpg)
TRUE Expression
s
System
OutsideKnowledge
Validation
![Page 6: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/6.jpg)
Consistency
The System should not be able to
prove both P and ~P, i.e., should not be prove both P and ~P, i.e., should not be
able to derive
F
![Page 7: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/7.jpg)
Examine the relation between
SoundnessSoundness
&
Consistency
Soundness Consistency
![Page 8: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/8.jpg)
If a System is inconsistent, i.e., can derive
F , it can prove any expression to be aF , it can prove any expression to be a
theorem. Because
F � P is a theorem
![Page 9: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/9.jpg)
Inconsistency�UnsoundnessTo 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
![Page 10: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/10.jpg)
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� 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
![Page 11: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/11.jpg)
Inconsistency is a Serious issue.
Informal Statement of Godel Theorem:Informal Statement of Godel Theorem:
If a sufficiently powerful system is complete it is inconsistent.
Sufficiently powerful: Can capture at least Peano Arithmetic
![Page 12: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/12.jpg)
Introduce Semantics in Propositional logic
Valuation Function V
Definition of V Syntactic ‘falseDefinition of V
V(F ) = F
Where F is called ‘false’ and is one of the two symbols (T, F)
Semantic ‘false’
![Page 13: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/13.jpg)
V(F ) = F
V(A�B) is defined through what is called the truth tabletruth table
V(A) V(B) V(A�B)
T F FT T TF F TF T T
![Page 14: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/14.jpg)
Tautology
An expression ‘E’ is a tautology if
V(E) = TV(E) = T
for all valuations of constituent propositions
Each ‘valuation’ is called a ‘model’.
![Page 15: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/15.jpg)
To see that
(F�P) is a tautology
two modelsV(P) = TV(P) = F
V(F�P) = T for both
![Page 16: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/16.jpg)
F�P is a theorem
Soundness Completeness
F�P is a tautology
![Page 17: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/17.jpg)
If a system is Sound & Complete, it does not
matter how you “Prove” or “show the validity”matter how you “Prove” or “show the validity”
Take the Syntactic Path or the Semantic Path
![Page 18: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/18.jpg)
Syntax vs. Semantics issue
Refers to
FORM VS. CONTENTFORM VS. CONTENT
Tea
(Content)Form
![Page 19: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/19.jpg)
Form & Content
logician
paintermusician
Godel, Escher, Bach
By D. Hofstadter
logician
![Page 20: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/20.jpg)
Problem
(P Q)�(P Q)
Semantic ProofSemantic ProofA 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
![Page 21: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/21.jpg)
To show syntactically
(P Q) (P Q)
i.e.
[(P (Q F )) F ]
[(P F ) Q]
![Page 22: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/22.jpg)
If we can establish
(P (Q F )) F ,
⊢
(P (Q F )) F ,
(P F ), Q F ⊢ F
This is shown as
Q F hypothesis
(Q F ) (P (Q F)) A1
![Page 23: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/23.jpg)
Q�F; hypothesis
(Q�F)�(P�(Q�F)); A1
P�(Q�F); MPP�(Q�F); MP
F; MP
Thus we have a proof of the line we started with
![Page 24: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/24.jpg)
Soundness Proof
Hilbert Formalization of Propositional
Calculus is sound.
“Whatever is provable is valid”
![Page 25: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/25.jpg)
Statement
GivenGiven
A1, A2, … ,An |- B
V(B) is ‘T’ for all Vs for which V(Ai) = T
![Page 26: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/26.jpg)
Proof
Case 1 B is an axiomCase 1 B is an axiom
V(B) = T by actual observation
Statement is correct
![Page 27: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/27.jpg)
Case 2 B is one of Ais
if V(A ) = T, so is V(B)if V(Ai) = T, so is V(B)
statement is correct
![Page 28: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/28.jpg)
Case 3 B is the result of MP on Ei & Ej
Ej is Ei B.
.Ej is Ei B
Suppose V(B) = F
Then either V(Ei) = F or V(Ej) = F
.
.
Ei
.
.
.
Ej
.
.
.
B
![Page 29: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/29.jpg)
i.e. Ei/Ej is result of MP of two expressions coming before them
Thus we progressively deal with shorter and shorter proof body. shorter proof body.
Ultimately we hit an axiom/hypothesis.
Hence V(B) = T
Soundness proved
![Page 30: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/30.jpg)
A puzzle(Zohar Manna, Mathematical Theory of Computation, 1974)
From Propositional Calculus
![Page 31: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/31.jpg)
Tourist in a country of truth-sayers and liers
� Facts and Rules: In a certain country, people either always speak the truth or alwayslie. 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 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?
![Page 32: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/32.jpg)
Diagrammatic representation
Capital
S (either always says the truthOr always lies)
T (tourist)
![Page 33: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/33.jpg)
Deciding the Propositions: a very difficult step- needs human intelligence
� P: Left road leads to capital
� Q: S always speaks the truth
![Page 34: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/34.jpg)
Meta Question: What question should the tourist ask
� The form of the question
� Very difficult: needs human intelligence
� The tourist should ask� 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
![Page 35: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/35.jpg)
A more mechanical part: use of truth table
P Q S’s Answer
R
T T Yes TT T Yes T
T F Yes F
F T No F
F F No T
![Page 36: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/36.jpg)
Get form of R: quite mechanical
� From the truth table
� R is of the form (P x-nor Q) or (P ≡ Q)
![Page 37: CS621: Artificial Intelligencecs621-2011/lectures... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of truth-sayers and](https://reader034.vdocument.in/reader034/viewer/2022050401/5f7f69b69d3a945b7a6c01bc/html5/thumbnails/37.jpg)
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 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?