a short introduction to propositional logic and first...
TRANSCRIPT
![Page 1: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/1.jpg)
slide 1
A Short Introduction toPropositional Logic
andFirst-Order Logic
Xiaojin [email protected]
Computer Sciences DepartmentUniversity of Wisconsin, Madison
[Based on slides from Louis Oliphant and Andrew Moore]
![Page 2: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/2.jpg)
slide 2
Logic• If the rules of the world are presented formally, then a
decision maker can use logical reasoning to make rational decisions.
• Several types of logic:§ propositional logic (Boolean logic) § first order logic (first order predicate calculus)
• A logic includes:§ syntax: what is a correctly formed sentence§ semantics: what is the meaning of a sentence§ Inference procedure (reasoning, entailment): what
sentence logically follows given knowledge
![Page 3: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/3.jpg)
slide 3
Propositional logic syntax
Sentence ®�AtomicSentence | ComplexSentenceAtomicSentence ®�True | False | SymbolSymbol ®�P | Q | R | . . .ComplexSentence ®�¬Sentence| ( Sentence Ù Sentence ) | ( Sentence Ú Sentence ) | ( Sentence Þ Sentence ) | ( Sentence Û Sentence ) BNF (Backus-Naur Form) grammar in propositional logic
((¬P Ú ((True Ù R)ÛQ)) Þ S) well formed(¬(P Ú Q) Ù Þ S) not well formed
![Page 4: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/4.jpg)
slide 4
((¬P Ú ((True Ù R)ÛQ)) Þ S)
Means True
Means “Not”Means “Or” -- disjunction
Means “And” -- conjunction
Means “iff” -- biconditional
Means “if-then” implication
() control the order of operations
Propositional symbols must be specified
Propositional logic syntax
![Page 5: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/5.jpg)
slide 5
Propositional logic syntax• Precedence (from highest to lowest):
¬, Ù, Ú, Þ, Û
• If the order is clear, you can leave off parenthesis.
¬P Ú True Ù RÛQ Þ S okP Þ Q Þ S not ok
![Page 6: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/6.jpg)
slide 6
Semantics• An interpretation is a complete True / False assignment to
propositional symbols§ Example symbols: P means “It is hot”, Q means “It is
humid”, R means “It is raining”§ There are 8 interpretations (TTT, ..., FFF)
• The semantics (meaning) of a sentence is the set of interpretations in which the sentence evaluates to True.
• Example: the semantics of the sentence PÚQ is the set of 6 interpretations§ P=True, Q=True, R=True or False§ P=True, Q=False, R=True or False§ P=False, Q=True, R=True or False
• A model of a set of sentences is an interpretation in which all the sentences are true.
![Page 7: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/7.jpg)
slide 7
Evaluating a sentence under an interpretation• Calculated using the meaning of connectives,
recursively.
• Pay attention to Þ§ “5 is even implies 6 is odd” is True!§ If P is False, regardless of Q, PÞQ is True§ No causality needed: “5 is odd implies the Sun is a
star” is True.
![Page 8: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/8.jpg)
slide 8
Semantics example¬P Ú Q Ù R Þ Q
![Page 9: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/9.jpg)
slide 9
Semantics example¬P Ú Q Ù R Þ Q
P Q R ~P Q^R ~PvQ^R ~PvQ^R->Q0 0 0 1 0 1 00 0 1 1 0 1 00 1 0 1 0 1 10 1 1 1 1 1 11 0 0 0 0 0 11 0 1 0 0 0 11 1 0 0 0 0 11 1 1 0 1 1 1
Satisfiable: the sentence is true under some interpretations
Deciding satisfiability of a sentence is NP-complete
![Page 10: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/10.jpg)
slide 10
Semantics example(P Ù R Þ Q) Ù P Ù R Ù ¬ Q
![Page 11: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/11.jpg)
slide 11
Semantics example(P Ù R Þ Q) Ù P Ù R Ù ¬ Q
Unsatisfiable: the sentence is false under all interpretations.
P Q R ~Q R^~Q P^R^~Q P^R P^R->Q final0 0 0 1 0 0 0 1 00 0 1 1 1 0 0 1 00 1 0 0 0 0 0 1 00 1 1 0 0 0 0 1 01 0 0 1 0 0 0 1 01 0 1 1 1 1 1 0 01 1 0 0 0 0 0 1 01 1 1 0 0 0 1 1 0
![Page 12: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/12.jpg)
slide 12
Semantics example(P Þ Q) Ú P Ù ¬ Q
![Page 13: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/13.jpg)
slide 13
Semantics example(P Þ Q) Ú P Ù ¬ Q
Tautology: the sentence is true under all interpretations
P Q R ~Q P->Q P^~Q (P->Q)vP^~Q0 0 0 1 1 0 10 0 1 1 1 0 10 1 0 0 1 0 10 1 1 0 1 0 11 0 0 1 0 1 11 0 1 1 0 1 11 1 0 0 1 0 11 1 1 0 1 0 1
![Page 14: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/14.jpg)
slide 14
Knowledge base• A knowledge base KB is a set of sentences.
Example KB:§ TomGivingLecture Û (TodayIsTuesday Ú
TodayIsThursday) § ¬ TomGivingLecture
• It is equivalent to a single long sentence: the conjunction of all sentences§ ( TomGivingLecture Û (TodayIsTuesday Ú
TodayIsThursday) ) Ù ¬ TomGivingLecture• The model of a KB is the interpretations in which all
sentences in the KB are true.
![Page 15: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/15.jpg)
slide 15
All interpretations
Entailment• Entailment is the relation of a sentence b logically
follows from other sentences a (i.e. the KB).a |= b
• a |= b if and only if, in every interpretation in which ais true, b is also true
a is true
b is true
![Page 16: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/16.jpg)
slide 16
Logical equivalences
You can use these equivalences to modify sentences.
![Page 17: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/17.jpg)
slide 17
Resolution• Resolution: a single inference rule
§ Sound: only derives entailed sentences§ Complete: can derive any entailed sentence
• Resolution is only refutation complete: if KB |= b, then KB Ù ¬ b |- empty. It cannot derive empty |- (P Ú ¬P)
§ But the sentences need to be preprocessed into a special form
§ But all sentences can be converted into this form
![Page 18: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/18.jpg)
slide 18
Conjunctive Normal Form (CNF) (¬B1,1 Ú P1,2 Ú P2,1) Ù (¬P1,2 Ú B1,1) Ù (¬P2,1 Ú B1,1)
– Replace all Û using biconditional elimination– Replace all Þ using implication elimination– Move all negations inward using
-double-negation elimination-de Morgan's rule
– Apply distributivity of Ú over Ù
![Page 19: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/19.jpg)
slide 19
Convert example sentence into CNFB1,1 Û (P1,2 Ú P2,1) starting sentence(B1,1 Þ (P1,2 Ú P2,1)) Ù ((P1,2 Ú P2,1) Þ B1,1 )
biconditional elimination(¬B1,1 Ú P1,2 Ú P2,1) Ù (¬(P1,2 Ú P2,1) Ú B1,1 )
implication elimination(¬B1,1 Ú P1,2 Ú P2,1) Ù ((¬P1,2 Ù ¬P2,1) Ú B1,1 )
move negations inward(¬B1,1 Ú P1,2 Ú P2,1) Ù (¬P1,2 Ú B1,1) Ù (¬P2,1 Ú B1,1)
distribute Ú over Ù
![Page 20: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/20.jpg)
slide 20
Resolution steps• Given KB and b (query) • Add ¬ b to KB, show this leads to empty (False.
Proof by contradiction) • Everything needs to be in CNF• Example KB:
§ B1,1 Û (P1,2 Ú P2,1) § ¬B1,1
• Example query: ¬P1,2
![Page 21: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/21.jpg)
slide 21
Resolution preprocessing• Add ¬ b to KB, convert to CNF:
a1: (¬B1,1 Ú P1,2 Ú P2,1) a2: (¬P1,2 Ú B1,1) a3: (¬P2,1 Ú B1,1) b: ¬B1,1
c: P1,2
• Want to reach goal: empty
![Page 22: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/22.jpg)
slide 22
Resolution• Take any two clauses where one contains some
symbol, and the other contains its complement (negative)
PÚQÚR ¬QÚSÚT• Merge (resolve) them, throw away the symbol and its
complementPÚRÚSÚT
• If two clauses resolve and there’s no symbol left, you have reached empty (False). KB |= b
• If no new clauses can be added, KB does not entail b
![Page 23: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/23.jpg)
slide 23
Resolution examplea1: (¬B1,1 Ú P1,2 Ú P2,1) a2: (¬P1,2 Ú B1,1) a3: (¬P2,1 Ú B1,1) b: ¬B1,1
c: P1,2
![Page 24: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/24.jpg)
slide 24
Resolution examplea1: (¬B1,1 Ú P1,2 Ú P2,1) a2: (¬P1,2 Ú B1,1) a3: (¬P2,1 Ú B1,1) b: ¬B1,1
c: P1,2
Step 1: resolve a2, c: B1,1
Step 2: resolve above and b: empty
![Page 25: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/25.jpg)
slide 25
Efficiency of the resolution algorithm• Run time can be exponential in the worst case
§ Often much faster• Factoring: if a new clause contains duplicates of the
same symbol, delete the duplicatesPÚRÚPÚT è PÚRÚT
• If a clause contains a symbol and its complement, the clause is a tautology and useless, it can be thrown awaya1: (¬B1,1 Ú P1,2 Ú P2,1) a2: (¬P1,2 Ú B1,1) è P1,2 Ú P2,1 Ú ¬P1,2 (tautology, throw away)
![Page 26: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/26.jpg)
slide 26
Problems with propositional logic• Consider the game “minesweeper” on a 10x10 field
with only one landmine.
• How do you express the knowledge, with propositional logic, that the squares adjacent to the landmine will display the number 1?
![Page 27: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/27.jpg)
slide 27
Problems with propositional logic• Consider the game “minesweeper” on a 10x10 field
with only one landmine.
• How do you express the knowledge, with propositional logic, that the squares adjacent to the landmine will display the number 1?
• Intuitively with a rule like landmine(x,y) Þ number1(neighbors(x,y))
but propositional logic cannot do this…
![Page 28: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/28.jpg)
slide 28
Problems with propositional logic• Propositional logic has to say, e.g. for cell (3,4):
§ Landmine_3_4 Þ number1_2_3§ Landmine_3_4 Þ number1_2_4§ Landmine_3_4 Þ number1_2_5§ Landmine_3_4 Þ number1_3_3§ Landmine_3_4 Þ number1_3_5§ Landmine_3_4 Þ number1_4_3§ Landmine_3_4 Þ number1_4_4§ Landmine_3_4 Þ number1_4_5
§ And similarly for each of Landmine_1_1, Landmine_1_2, Landmine_1_3, …, Landmine_10_10!
• Difficult to express large domains concisely• Don’t have objects and relations• First Order Logic is a powerful upgrade
![Page 29: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/29.jpg)
slide 29
Ontological commitment• Logics are characterized by what they consider to be
‘primitives’
Logic Primitives Available KnowledgePropositional facts true/false/unknown
First-Order facts, objects, relations true/false/unknownTemporal facts, objects, relations,
timestrue/false/unknown
Probability Theory facts degree of belief 0…1
Fuzzy degree of truth degree of belief 0…1
![Page 30: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/30.jpg)
slide 30
First Order Logic syntax• Term: an object in the world
§ Constant: Jerry, 2, Madison, Green, …§ Variables: x, y, a, b, c, …§ Function(term1, …, termn)
• Sqrt(9), Distance(Madison, Chicago)• Maps one or more objects to another object• Can refer to an unnamed object: LeftLeg(John)• Represents a user defined functional relation
• A ground term is a term without variables.
![Page 31: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/31.jpg)
slide 31
FOL syntax• Atom: smallest T/F expression
§ Predicate(term1, …, termn)• Teacher(Jerry, you), Bigger(sqrt(2), x)• Convention: read “Jerry (is)Teacher(of) you”• Maps one or more objects to a truth value• Represents a user defined relation
§ term1 = term2• Radius(Earth)=6400km, 1=2• Represents the equality relation when two terms refer to
the same object
![Page 32: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/32.jpg)
slide 32
FOL syntax• Sentence: T/F expression
§ Atom§ Complex sentence using connectives: Ù Ú ¬ Þ Û
• Spouse(Jerry, Jing) Þ Spouse(Jing, Jerry)• Less(11,22) Ù Less(22,33)
§ Complex sentence using quantifiers ", $
• Sentences are evaluated under an interpretation§ Which objects are referred to by constant symbols§ Which objects are referred to by function symbols§ What subsets defines the predicates
![Page 33: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/33.jpg)
slide 33
FOL quantifiers• Universal quantifier: "• Sentence is true for all values of x in the domain of
variable x.
• Main connective typically is Þ§ Forms if-then rules§ “all humans are mammals”
"x human(x)Þ mammal(x)
§ Means if x is a human, then x is a mammal
![Page 34: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/34.jpg)
slide 34
FOL quantifiers"x human(x)Þ mammal(x)
• It’s a big AND: Equivalent to the conjunction of all the instantiations of variable x:
(human(Jerry)Þ mammal(Jerry)) Ù(human(Jing)Þ mammal(Jing)) Ù
(human(laptop) Þ mammal(laptop)) Ù …
• Common mistake is to use Ù as main connective"x human(x) Ù mammal(x)
• This means everything is human and a mammal!(human(Jerry) Ù mammal(Jerry)) Ù
(human(Jing) Ù mammal(Jing)) Ù(human(laptop) Ù mammal(laptop)) Ù …
![Page 35: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/35.jpg)
slide 35
FOL quantifiers• Existential quantifier: $• Sentence is true for some value of x in the domain of
variable x.
• Main connective typically is Ù§ “some humans are male”
$x human(x) Ù male(x)
§ Means there is an x who is a human and is a male
![Page 36: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/36.jpg)
slide 36
FOL quantifiers$x human(x) Ù male(x)
• It’s a big OR: Equivalent to the disjunction of all the instantiations of variable x:
(human(Jerry) Ù male(Jerry)) Ú(human(Jing) Ù male(Jing)) Ú
(human(laptop) Ù male(laptop)) Ú …
• Common mistake is to use Þ as main connective§ “Some pig can fly”
$x pig(x) Þ fly(x) (wrong)
![Page 37: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/37.jpg)
slide 37
FOL quantifiers$x human(x) Ù male(x)
• It’s a big OR: Equivalent to the disjunction of all the instantiations of variable x:
(human(Jerry) Ù male(Jerry)) Ú(human(Jing) Ù male(Jing)) Ú
(human(laptop) Ù male(laptop)) Ú …
• Common mistake is to use Þ as main connective§ “Some pig can fly”
$x pig(x) Þ fly(x) (wrong)
• This is true if there is something not a pig!(pig(Jerry)Þ fly(Jerry)) Ú(pig(laptop) Þ fly(laptop)) Ú …
![Page 38: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/38.jpg)
slide 38
FOL quantifiers• Properties of quantifiers:
§ "x "y is the same as "y "x§ $x $y is the same as $y $x
• Example:§ "x "y likes(x,y)
Everyone likes everyone.§ "y "x likes(x,y)
Everyone is liked by everyone.
![Page 39: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/39.jpg)
slide 39
FOL quantifiers• Properties of quantifiers:
§ "x $y is not the same as $y "x§ $x "y is not the same as "y $x
• Example:§ "x $y likes(x,y)
Everyone likes someone (can be different).§ $y "x likes(x,y)
There is someone who is liked by everyone.
![Page 40: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/40.jpg)
slide 40
FOL quantifiers• Properties of quantifiers:
§ "x P(x)when negated becomes $x ¬P(x)§ $x P(x)when negated becomes "x ¬P(x)
• Example:§ "x sleep(x)
Everybody sleeps.§ $x ¬sleep(x)
Somebody does not sleep.
![Page 41: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/41.jpg)
slide 41
FOL quantifiers• Properties of quantifiers:
§ "x P(x)is the same as ¬$x ¬P(x)§ $x P(x)is the same as ¬"x ¬P(x)
• Example:§ "x sleep(x)
Everybody sleeps.§ ¬$x ¬sleep(x)
There does not exist someone who does not sleep.
![Page 42: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/42.jpg)
slide 42© JKR/POTTERMORE LTD. ™ WARNER BROS.
Professor Snape’s Puzzle
Danger lies before you, while safety lies behind,Two of us will help you, whichever you would find,One among us seven will let you move ahead,Another will transport the drinker back instead,Two among our number hold only nettle-wine,Three of us are killers, waiting hidden in lineChoose, unless you wish to stay here forevermoreTo help you in your choice, we give you these clues four:First, however slyly the poison tries to hideYou will always find some on nettle wine's left sideSecond, different are those who stand at either endBut if you would move onward, neither is your friend;Third as you see clearly, all are different sizeNeither dwarf nor giant hold death in their insides;Fourth, the second left and the second on the rightAre twins once you taste them, though different at first sight.
![Page 43: A Short Introduction to Propositional Logic and First ...pages.cs.wisc.edu/~jerryzhu/cs540/handouts/logic.pdf · Logic • If the rules of the world are presented formally, then a](https://reader033.vdocuments.net/reader033/viewer/2022052519/605c73ef499d4e050d45f392/html5/thumbnails/43.jpg)
slide 43
1. $x A(x)Ù ("y A(y)Þ x=y)2. $x B(x)Ù ("y B(y)Þ x=y)3. $x$y W(x)Ù W(y)Ù ¬(x=y)Ù("z W(z)Þ z=xÚz=y)4. "x ¬(A(x)ÚB(x)ÚW(x)) Þ P(x)5. "x"y W(x)Ù L(y,x) Þ P(y)6. ¬(P(b1) Ù P(b7))7. ¬(W(b1) Ù W(b7))8. ¬ A(b1)9. ¬ A(b7)10.¬ P(b3)11.¬ P(b6)12.(P(b2) Ù P(b6)) Ú (W(b2) Ù W(b6))