19-PredCalcResolution

19-PredCalcResolutio - Discussion#19 Resolution with Predicate Calculus Discussion#19 Chapter 11 Section 3 1/17 Topics Horn Clauses Dropping

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

View Full Document Right Arrow Icon
Discussion #19 Chapter 11, Section 3 1/17 Discussion #19 Resolution with Predicate Calculus
Background image of page 1

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

View Full DocumentRight Arrow Icon
Discussion #19 Chapter 11, Section 3 2/17 Topics Horn Clauses Dropping Quantifiers Unification Resolution
Background image of page 2
Discussion #19 Chapter 11, Section 3 3/17 Horn Clause For resolution, the premises are in CNF. CNF: (… …) (… …) (… …) Each (… …) is a clause. A horn clause is a disjunction of literals that contains at most one positive (non-negative) literal. Horn clause: P ¬ Q ¬ R Horn clause: P Horn clause: ¬ P Not a horn clause: P Q ¬ R too many positive literals Note that, in general, a horn clause is an implication with a conjunction of all positive literals on the lhs and one positive (non- negated) literal on the rhs. Horn clause: P ¬ Q ¬ R ¬ Q ¬ R P ¬ (Q R) P (Q R) P Degenerate cases: Horn clause: P F P ¬ T P T P Horn clause: ¬ P ¬ P F P F Horn clause: ¬ P 1 ¬ P 2 ¬ P n ¬ (P 1 P 2 P n ) F P 1 P 2 P n F Not a horn clause: P Q ¬ R ¬ R P Q R (P Q)
Background image of page 3

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

View Full DocumentRight Arrow Icon
Discussion #19 Chapter 11, Section 3 4/17 Horn Clauses Appear in 3 Forms 1. One positive literal and one or more negative literals. e.g. P ¬ Q ¬ R (Q R) P These are the Datalog rules. 2. One positive literal and no negative literals. i.e. P T P “We see P by itself as being true.” These are the Datalog facts. 3. No positive literal. ¬ P P F or ¬ P 1 ¬ P 2 ¬ P n P 1 P 2 P n F “When the consequent is false, we wonder what’s going on.” These are the Datalog queries either one query or several.
Background image of page 4
Discussion #19 Chapter 11, Section 3 5/17 Horn Clauses with Variables and Quantifiers For horn clauses in Datalog, we put all clauses in Prenex Normal Form. Further, to be a valid horn clause, all variables must be universally quantified. Sample horn clauses with variables and quantifiers:
Background image of page 5

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

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

This note was uploaded on 03/02/2012 for the course C S 236 taught by Professor Michaelgoodrich during the Winter '12 term at BYU.

Page1 / 17

19-PredCalcResolutio - Discussion#19 Resolution with Predicate Calculus Discussion#19 Chapter 11 Section 3 1/17 Topics Horn Clauses Dropping

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

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