The document describes predicate logic and provides examples of converting statements to clause form and using resolution to prove statements. Key points include:
- Conversion to clause form involves eliminating implications and existentials, standardizing variables, and converting to disjunctive normal form.
- Resolution can be used to prove statements by resolving clauses and deriving the empty clause, indicating a contradiction.
- Herbrand's theorem states resolution is complete over ground instances of clauses.
- Issues with resolution include the exponential search space and need for heuristics to guide the search.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd
The document describes predicate logic and provides examples of converting statements to clause form and using resolution to prove statements. Key points include:
- Conversion to clause form involves eliminating implications and existentials, standardizing variables, and converting to disjunctive normal form.
- Resolution can be used to prove statements by resolving clauses and deriving the empty clause, indicating a contradiction.
- Herbrand's theorem states resolution is complete over ground instances of clauses.
- Issues with resolution include the exponential search space and need for heuristics to guide the search.
The document describes predicate logic and provides examples of converting statements to clause form and using resolution to prove statements. Key points include:
- Conversion to clause form involves eliminating implications and existentials, standardizing variables, and converting to disjunctive normal form.
- Resolution can be used to prove statements by resolving clauses and deriving the empty clause, indicating a contradiction.
- Herbrand's theorem states resolution is complete over ground instances of clauses.
- Issues with resolution include the exponential search space and need for heuristics to guide the search.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd
The document describes predicate logic and provides examples of converting statements to clause form and using resolution to prove statements. Key points include:
- Conversion to clause form involves eliminating implications and existentials, standardizing variables, and converting to disjunctive normal form.
- Resolution can be used to prove statements by resolving clauses and deriving the empty clause, indicating a contradiction.
- Herbrand's theorem states resolution is complete over ground instances of clauses.
- Issues with resolution include the exponential search space and need for heuristics to guide the search.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd
Download as ppt, pdf, or txt
You are on page 1/ 16
Predicate Logic
1. 2.
3. 4. 5. 6. 7.
8. 9.
Marcus was a man. man(Marcus) Marcus was a Pompeian. Pompeian(Marcus) All Pompeians were Romans. x: Pompeian(x)Roman(x) Caesar was a ruler. ruler(Caesar) All Romans were either loyal to Caesar or hated him. x: Roman(x) loyalto(x, Caesar) V hate(x,Caesar) Everyone is loyal to someone. x: y: loyalto(x,y) People only try to assassinate rulers they aren't loyal to. x:y:person(x) ruler(y) tryassassinate(x,y) loyalto(x,y) Marcus tried to assassinate Caesar. tryassassinate(Marcus, Caesar) All men are people. x: man(x) person(x)
Conversion to Clause Form
Problem: x: [Roman(x) know(x,Marcus)] [hate(x,Caesar) V (y:z: hate(y,z) thinkcrazy(x,y))]
Solution:
Flatten Separate out quantifiers
Conjunctive Normal Form: Roman(x) v know(x,Marcus) v
hate(x,Caesar) v hate(y,z) v thinkcrazy(x,z)
Clause Form
Conjunctive normal form No instances of
Algorithm: Convert to Clause Form
1. 2.
3. 4. 5. 6. 7. 8. 9.
Eliminate , using: a b= a v b. Reduce the scope of each to a single term, using: ( p) = p deMorgan's laws: (a b) = a V b (a V b) = a b x P(x) = x P(x) x P(x) = x P(x) Standardize variables. Move all quantifiers to the left of the formula without changing their relative order. Eliminate existential quantifiers by inserting Skolem functions. Drop the prefix. Convert the expression into a conjunction of disjuncts, using associativity and distributivity. Create a separate clause for each conjunct. Standardize apart the variables in the set of clauses generated in step 8, using the fact that: (x: P(x) Q(x)) = x: P(x) x: Q(x)
Skolem Functions in FOL
Objective
Want all variables universally quantified Notational variant of FOL w/o existentials Retain implicitly full FOL expressiveness
Skolems Theorem Every existentially quantified variable can be replaced by a unique Skolem function whose arguments are all the universally quantified variables on which the existential depends, without changing FOL.
Examples
Everybody likes something (x) (y) [Person(x) & Likes(x,y)] (x) [Person(x) & Likes(x, S1(x))] Where S1(x) = that which x likes Every philosopher writes at least one book (x) (y)[Philosopher(x) & Book(y)) => Write(x,y)] (x)[(Philosopher(x) & Book(S2(x))) => Write(x,S2(x))]
Eliminate x: [Roman(x) know(x, Marcus)] V [hate(x,Caesar) V (y: z: hate(y,z) V thinkcrazy(x,y))]
Reduce scope of . x: [ Roman(x) V know(x, Marcus)] V [hate(x,Caesar) V (y: z: hate(y,z) V thinkcrazy(x,y))]
Standardize variables:
x: P(x) V x: Q(x) converts to x: P(x) V y: Q(y)
Move quantifiers. x: y: z: [Roman(x) V know(x,
Marcus)] V [hate(x,Caesar) V (hate(y,z) V thinkcrazy(x,y))]
Examples of Conversion to Clause Form
Eliminate existential quantifiers.
y: President(y) will be converted to President(S1) x: y: father-of(y,x) will be converted to x: father-of(S2(x),x))
Drop the prefix.
[ Roman(x) know(x,Marcus)] V [hate(x, Caesar) V ( hate(y,z) V thinkcrazy(x,y))]
Convert to a conjunction of disjuncts.
Roman(x) V know(x,Marcus) V hate(x,Caesar) V hate(y,z) V thinkcrazy(x,y)
The Basis of Resolution and Herbrand's Theorem
Given: winter V summer winter V cold
We can conclude: summer v cold Herbrand's Theorem: To show that a set of clauses S is unsatisfiable, it is necessary to consider only interpretations over a particular set, called the Herbrand universe of S. A set of clauses S is unsatisfiable if and only if a finite subset of ground instances (in which all bound variables have had a value substituted for them) of S is unsatsifable.
Algorithm: Propositional Resolution
1. 2. 3.
Convert all the propositions of F to clause form. Negate P and convert the result to clause form. Add it to the set of clauses obtained in step 1. Repeat until either a contradiction is found or no progress can be made: a) Select two clauses. Call these the parent clauses. b) Resolve them together. The resolvent will be the disjunction of all of the literals of both of the parent clauses with the following exception: If there are any pairs of literals L and L such that one of the parent clauses contains L
and the other contains L, then select one such pair and eliminate both L and L from the resolvent. c) If the resolvent is the empty clause, then a contradiction has been found. If it is not, then add it to the set of clauses available to the procedure.
A Few Facts in Propositional Logic
Given Axioms P (P Q) R (S V T) Q
Clause Form P P V Q V R S V Q
(1) (2) (3)
T V Q T T
(4) (5)
Resolution in Propositional Logic
P V Q V R R
P V Q
T V Q
Algorithm: Resolution 1. 2. 3.
Convert all the propositions of F to clause form. Negate P and convert the result to clause form. Add it to the set of clauses obtained in 1. Repeat until either a contradiction is found, no progress can be made, or a predetermined amount of effort has been expended. a) Select two clauses. Call these the parent clauses. b) Resolve them together. The resolvent will be the disjunction of all the literals of both parent clauses with appropriate substitutions performed and with the following exception: If there is one pair of literals T1 and T2 such that one of the parent clauses contains T1 and the other contains T2 and if T1 and T2 are unifiable, then neither T1 nor T2 should appear in the resolvent. If there is more than one pair of complementary literals, only one pair should be omitted from the resolvent. c) If the resolvent is the empty clause, then a contradiction has been found. If it is not, then add it to the set of clauses available to the procedure.
A Resolution Proof Axioms in clause form: 1. man(Marcus) 2. Pompeian(Marcus) 3. Pompeian(x1) v Roman(x1) 4. Ruler(Caesar) 5. Roman(x2) v loyalto(x2, Caesar) v hate(x2, Caesar) 6. loyalto(x3, f1(x3)) 7. man(x4) v ruler(y1) v tryassassinate(x4, y1) v loyalto (x4, y1) 8. tryassassinate(Marcus, Caesar)
Axioms in clause form: 1. man(Marcus) 2. Pompeian(Marcus) 3. Born(Marcus, 40) 4. man(x1) V mortal(x1) 5. Pompeian(x2) V died(x2,79) 6. erupted(volcano, 79) 7. mortal(x3) V born(x3, t1) V gt(t2t1, 150) V dead(x3, t2) 8. Now=2002 9. alive(x4, t3) V dead (x4, t3) 10. dead(x5, t4) V alive (x5, t4) 11. died (x6, t5) V gt(x6, t5) V dead(x6, t6) Prove: alive(Marcus, now)
Issues with Resolution
Requires full formal representation in FOL (for conversion to clause form) Resolution defines a search space (which clauses will be resolved against which others define the operators in the space) search method required Worst case: resolution is exponential in the number of clauses to resolve. Actual: exponential in average resolvable set (= branching factor) Can we define heuristics to guide search for BestFS, or A* or B*? (Not in the general case)
