cs621: artificial intelligencepb/cs621-2010/cs621-lect9-deduction... · (zohar manna, mathematical...
TRANSCRIPT
![Page 1: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/1.jpg)
CS621: Artificial Intelligence
Pushpak BhattacharyyaCSE Dept., IIT Bombay
Lecture–9: (a) Deduction theorem; (b) Puzzle Solving using Propositional
Calculus
5th August, 2010
![Page 2: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/2.jpg)
Hilbert's formalization of propositional calculus1. Elements are propositions: Capital letters
2. Operator is only one : � (called implies)
3. Special symbolF (called 'false')
4. Two other symbols :'(' and ')'
5. Well formed formula is constructed according to the grammar
WFF� P|F|WFF�WFFWFF� P|F|WFF�WFF
6. Inference rule : only one
Given A�B and
A
write B
known as MODUS PONENS
![Page 3: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/3.jpg)
7. Axioms : Starting structuresA1:
A2:
A3
This formal system defines the propositional calculus
))(( ABA →→
)))()(())((( CABACBA →→→→→→
)))((( AFFA →→→
![Page 4: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/4.jpg)
Notion of proof1. Sequence of well formed formulae
2. Start with a set of hypotheses
3. The expression to be proved should be the last line in the
sequence
4. Each intermediate expression is either one of the hypotheses
or one of the axioms or the result of modus ponens
5. An expression which is proved only from the axioms and
inference rules is called a THEOREM within the system
![Page 5: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/5.jpg)
Example of proof
From P and and prove R
H1: P
H2:
H3:
i) P H1
QP →
QP →
RQ →
RQ →
ii) H2
iii) Q MP, (i), (ii)
iv) H3
v) R MP, (iii), (iv)
QP →
RQ →
![Page 6: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/6.jpg)
Prove that is a THEOREM
i) A1 : P for A and B
ii) A1: P for A and for B
iii)
A2: with P for A, for B and P for C
iv) MP, (ii), (iii)
)( PP →
))(( PPPP →→→
)( PPP →→
))]())((()))(([( PPPPPPPPP →→→→→→→→
)( PP →
))()(( PPPPP →→→→
)( PP →
v) MP, (i), (iv))( PP →
![Page 7: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/7.jpg)
Shorthand1. is written as and called 'NOT P'
2. is written as and called
'P ORQ’
3. is written as and called
'P AND Q'
¬ P FP →
))(( QFP →→ )( QP∨
)))((( FFQP →→→ )( QP∧
'P AND Q'
Exercise: (Challenge)
- Prove that ))(( AA ¬¬→
![Page 8: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/8.jpg)
A very useful theorem (Actually a meta theorem, called deduction theorem)StatementIfA1, A2, A3 ............. An ├ BthenA1, A2, A3, ...............An-1├
├ is read as 'derives'
BAn →
Given
A1A2A3....
AnB Picture 1
A1A2A3....
An-1
Picture 2BAn →
![Page 9: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/9.jpg)
Use of Deduction TheoremProve
i.e.,
├ F (M.P)
A├ (D.T)
))(( AA ¬¬→
))(( FFAA →→→
FAA →,
FFA →→ )(
├ (D.T)
Very difficult to prove from first principles, i.e., using axioms and inference rules only
))(( FFAA →→→
![Page 10: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/10.jpg)
Prove
i.e.
├ F
├ (D.T)
├ Q (M.P with A3)
)( QPP ∨→
))(( QFPP →→→
FQFPP →→ ,,
FPP →, FFQ →→ )(
├ Q (M.P with A3)
P├
├
QFP →→ )(
))(( QFPP →→→
![Page 11: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/11.jpg)
More proofs
)()(.1 QPQP ∨→∧
))(()(.3
)()(.2
)()(.1
QPQQP
PQQP
QPQP
→→¬→→¬→¬→→
∨→∧
![Page 12: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/12.jpg)
Proof Sketch of the Deduction Theorem
To show that
If If
A1, A2, A3,… An |- B
Then
A1, A2, A3,… An-1 |- An �B
![Page 13: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/13.jpg)
Case-1: B is an axiom
One is allowed to write
A1, A2, A3,… An-1 |- B
|- B�(A �B)|- B�(An�B)
|- (An�B); mp-rule
![Page 14: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/14.jpg)
Case-2: B is An
An�An is a theorem (already proved)
One is allowed to write
A , A , A ,… A |- (A �A )A1, A2, A3,… An-1 |- (An�An)
i.e. |- (An�B)
![Page 15: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/15.jpg)
Case-3: B is Ai
where (i <>n)
Since Ai is one of the hypotheses
One is allowed to write
A , A , A ,… A |- BA1, A2, A3,… An-1 |- B
|- B�(An�B)
|- (An�B); mp-rule
![Page 16: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/16.jpg)
Case-4: B is result of MP
Suppose
B comes from applying MP on
E and EEi and Ej
Where, Ei and Ej come before B in
A1, A2, A3,… An |- B
![Page 17: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/17.jpg)
B is result of MP (contd)
If it can be shown that
A1, A2, A3,… An-1 |- An �Ei
andand
A1, A2, A3,… An-1 |- (An �(Ei�B))
Then by applying MP twice
A1, A2, A3,… An-1 |- An �B
![Page 18: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/18.jpg)
B is result of MP (contd)
This involves showing that
If
A , A , A ,… A |- EA1, A2, A3,… An |- Ei
Then
A1, A2, A3,… An-1 |- An �Ei
(similarly for An�Ej)
![Page 19: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/19.jpg)
B is result of MP (contd)
Adopting a case by case analysis as before,
We come to shorter and shorter length We come to shorter and shorter length proof segments eating into the body of
A1, A2, A3,… An |- B
Which is finite. This process has to terminate. QED
![Page 20: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/20.jpg)
Important to note
� Deduction Theorem is a meta-theorem (statement about the system)
� P�P is a theorem (statement belonging to the system)� P�P is a theorem (statement
belonging to the system)
� The distinction is crucial in AI
� Self reference, diagonalization
� Foundation of Halting Theorem, Godel Theorem etc.
![Page 21: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/21.jpg)
Example of ‘of-about’
confusion
� “This statement is false”
� Truth of falsity cannot be decided
![Page 22: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/22.jpg)
A puzzle(Zohar Manna, Mathematical Theory of Computation, 1974)
From Propositional Calculus
![Page 23: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/23.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 24: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/24.jpg)
Diagrammatic representation
Capital
S (either always says the truth
Or always lies)
T (tourist)
![Page 25: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/25.jpg)
Deciding the Propositions: a very difficult step- needs human intelligence
� P: Left road leads to capital
� Q: S always speaks the truth
![Page 26: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/26.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 27: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/27.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 28: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/28.jpg)
Get form of R: quite mechanical
� From the truth table
� R is of the form (P x-nor Q) or (P ≡ Q)
![Page 29: CS621: Artificial Intelligencepb/cs621-2010/cs621-lect9-deduction... · (Zohar Manna, Mathematical Theory of Computation, 1974) From Propositional Calculus. Tourist in a country of](https://reader034.vdocuments.us/reader034/viewer/2022043002/5f7f6aacb049df79be396ede/html5/thumbnails/29.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?