First-Order Logic
description
Transcript of First-Order Logic
![Page 1: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/1.jpg)
First-Order Logic
Chapter 8
![Page 2: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/2.jpg)
Problem of Propositional Logic Propositional logic has very limited expressive
power
– E.g., cannot say "pits cause breezes in adjacent squares“ except by writing one sentence for each square.
– We want to be able to say this in one single sentence:“for all squares and pits, pits cause breezes in adjacent squares.
– First order logic will provide this flexibility.
![Page 3: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/3.jpg)
First-order logic
• Propositional logic assumes the world contains facts that are true or false.
• First-order logic assumes the world contains
– Objects: people, houses, numbers, colors, baseball games, wars, …
– Relations between objects: red, round, prime, brother of, bigger than, part of, comes between, …
![Page 4: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/4.jpg)
Relations
• Some relations are properties: they state some fact about a single object:
Round(ball), Prime(7).• n-ary relations state facts about two or
more objects: Married(John,Mary), Largerthan(3,2).
• Some relations are functions: their value is another object: Plus(2,3), Father(Dan).
![Page 5: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/5.jpg)
Models for FOL: Example
![Page 6: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/6.jpg)
Atomic Sentences• Sentences in logic state facts that are true or false.
• Properties and n-ary relations do just that: LargerThan(2,3) (means 2>3) is false. Brother(Mary,Pete) is false.
• Note: Functions do not state facts and form no sentence: Brother(Pete) refers to the object John (his brother) and is neither true nor false.
• Brother(Pete,Brother(Pete)) is True.
Binary relation Function
![Page 7: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/7.jpg)
Complex Sentences• We make complex sentences with
connectives (just like in proposition logic).
( ( ), ) ( ( ))Brother Lef tLeg Richard J ohn Democrat Bush
binary relation
function property
objects
connectives
![Page 8: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/8.jpg)
Quantification
• Round(ball) is true or false because we give it a single argument (ball).
• We can be much more flexible if we allow variables which can take on values in a domain. e.g. reals x, all persons P, etc.
• To construct logical sentences we need a quantifier to make it true or false.
![Page 9: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/9.jpg)
Quantifier
• Is the following true or false?
• To make it true or false we use
5,x x R
and
2[( 2) ( 3)] ( )[( 1)] ( )
x x x x R falsex x x R false
For all real x, x>2 implies x>3. There exists some real x which square is minus 1.
![Page 10: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/10.jpg)
Nested Quantifiers• Combinations of universal and existential
quantification are possible:
( , ) ( , )( , ) ( , )( , ) ( , )( , ) ( , )
, { }
x yFather x y y x Father x yx yFather x y y x Father x yx y Father x y y x Father x yx yFather x y y x Father x yx y All people
Quiz :which is which: Everyone is the father of someone. Everyone has everyone as a father There is a person who has everyone as a father. There is a person who has a father There is a person who is the father of everyone. Everyone has a father.
Binary relation:“x is a father of y”.
![Page 11: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/11.jpg)
De Morgan’s Law for Quantifiers
( )( )( )( )
x P x Px P x Px P x Px P x P
( )( )
( )( )
P Q P QP Q P QP Q P QP Q P Q
De Morgan’s Rule Generalized De Morgan’s Rule
Rule is simple: if you bring a negation inside a disjunction or a conjunction,always switch between them (or and, and or).
• Equality symbol: Father(John)=Henry. This relates two objects.
![Page 12: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/12.jpg)
Common mistakes to avoid
• is the main connective with • is the main connective with
, ( ) ( ) { , , }, ( ) ( ), ( ) ( ), ( ) ( )
x King x Person x x Pete Mary tablespoonx King x Person xx King x Person xx King x Person x
All of these must be true!King(Pete) AND Person(Pete)King(Mary) AND Person(Mary)King(Tablespoon) AND Person(Tablespoon)One of these should be true!
if King(Pete) then Person(Pete)if King(Mary) then Person(Mary)If King(Tablespoon) then Person(Tablespoon)
too strong
too weak
![Page 13: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/13.jpg)
Using FOL
• We want to TELL things to the KB, e.g. TELL(KB, )
• We also want to ASK things to the KB, ASK(KB, )
• The KB should return the list of x’s for which Person(x) is true: {x/John,x/Richard,...}
, ( ) ( )x King x Person x
, ( )x Person x
![Page 14: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/14.jpg)
Examples
The kinship domain:• Brothers are siblings
x,y Brother(x,y) => Sibling(x,y)• One's mother is one's female parent
m,c Mother(c) = m (Female(m) Parent(m,c))• “Sibling” is symmetric
x,y Sibling(x,y) Sibling(y,x)
Some may be considered axioms, others as theorems which can be derived from the axioms.
![Page 15: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/15.jpg)
![Page 16: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/16.jpg)
![Page 17: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/17.jpg)
![Page 18: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/18.jpg)
![Page 19: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/19.jpg)
![Page 20: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/20.jpg)
![Page 21: First-Order Logic](https://reader035.fdocuments.in/reader035/viewer/2022062305/5681601e550346895dcf1e7c/html5/thumbnails/21.jpg)