Resolution_Part_1

Resolution_Part_1 - • To prove G we need to show is...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Resolution and Refutation York University Department of Computer Science and Engineering York University- CSE 3401- V. Movahedi 1 04_Resolution
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Overview Propositional Logic Resolution Refutation Predicate Logic Substitution Unification Resolution Refutation Search space [ref.: Nilsson- Chap.3] [Prof. Zbigniew Stachniak’s class notes] York University- CSE 3401 2 04_Resolution
Background image of page 2
Theorems from Logic [from Mathematical Logic, George Tourlakis] Modus Ponens Cut Rule Transitivity of Proof by Contradiction York University- CSE 3401 3 04_Resolution
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Resolution in Logic By A. Robinson (1965) Example: Prove We need to show that the following set is inconsistent: York University- CSE 3401 4 04_Resolution
Background image of page 4
Resolution in Logic Programming Program P (facts and rules in clause form) Goal G negated and added to program P
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: • To prove G, we need to show is inconsistent York University- CSE 3401 5 } { G P q; t :- p. , p:- s. Parent clauses q; t :- s. Resolvent Resolving upon p, being on different sides of :- Complementary literals 04_Resolution Example (1) • Program P={q:-. , p:-q.} • Query :-p. – This is already the negated form of our goal! York University- CSE 3401 6 q:-. p:- q. :-p. :-q. :- empty clause, inconsistency therefore p is satisfiable true 04_Resolution Refutation • When resolution is used to prove inconsistency, it is also called refutation. (refute=disprove) • The above binary tree, showing resolution and resulting in the empty clause, is called a refutation tree. • NOTE: To avoid potential mistakes, DO NOT RESOLVE UPON MORE THAN ONE LITERAL SIMULTANEOUSLY. York University- CSE 3401 7 04_Resolution...
View Full Document

This note was uploaded on 02/14/2012 for the course CSE 3401 taught by Professor Movahedi during the Fall '11 term at York University.

Page1 / 7

Resolution_Part_1 - • To prove G we need to show is...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online