Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and...
-
Upload
whitney-franklin -
Category
Documents
-
view
219 -
download
0
Transcript of Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and...
![Page 1: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/1.jpg)
Logical Agents
Chapter 7
![Page 2: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/2.jpg)
Outline
• Knowledge-based agents• Wumpus world• Logic in general - models and entailment• Propositional (Boolean) logic• Equivalence, validity, satisfiability• Inference rules and theorem proving
– forward chaining– backward chaining– resolution
![Page 3: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/3.jpg)
Knowledge bases
• Knowledge base = set of sentences in a formal language• Declarative approach to building an agent (or other system):
– Tell it what it needs to know
• Then it can Ask itself what to do - answers should follow from the KB
• Agents can be viewed at the knowledge leveli.e., what they know, regardless of how implemented
• Or at the implementation level– i.e., data structures in KB and algorithms that manipulate them
–•
•
![Page 4: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/4.jpg)
A simple knowledge-based agent
• The agent must be able to:
– Represent states, actions, etc.
– Incorporate new percepts
– Update internal representations of the world
– Deduce hidden properties of the world
– Deduce appropriate actions
![Page 5: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/5.jpg)
Wumpus World PEAS description
• Performance measure– gold +1000, death -1000
– -1 per step, -10 for using the arrow
• Environment– Squares adjacent to wumpus are smelly
– Squares adjacent to pit are breezy
– Glitter iff gold is in the same square
– Shooting kills wumpus if you are facing it
– Shooting uses up the only arrow
– Grabbing picks up gold if in same square
– Releasing drops the gold in same square
• Sensors: Stench, Breeze, Glitter, Bump, Scream• Actuators: Left turn, Right turn, Forward, Grab, Release, Shoot
![Page 6: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/6.jpg)
Wumpus world characterization
• Fully Observable No – only local perception• Deterministic Yes – outcomes exactly specified• Episodic No – sequential at the level of actions• Static Yes – Wumpus and Pits do not move• Discrete Yes• Single-agent? Yes – Wumpus is essentially a
natural feature
![Page 7: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/7.jpg)
Logic in general
• Logics are formal languages for representing information such that conclusions can be drawn
• Syntax defines the sentences in the language• Semantics define the "meaning" of sentences;
– i.e., define truth of a sentence in a world
• E.g., the language of arithmetic– x+2 ≥ y is a sentence; x2+y > {} is not a sentence– x+2 ≥ y is true iff the number x+2 is no less than the number y– x+2 ≥ y is true in a world where x = 7, y = 1– x+2 ≥ y is false in a world where x = 0, y = 6
![Page 8: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/8.jpg)
Entailment
• Entailment means that one thing follows from another:
KB ╞ α• Knowledge base KB entails sentence α if and
only if α is true in all worlds where KB is true
– E.g., the KB containing “the Giants won” and “the Reds won” entails “Either the Giants won or the Reds won”
– E.g., x+y = 4 entails 4 = x+y– Entailment is a relationship between sentences (i.e.,
syntax) that is based on semantics
•
![Page 9: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/9.jpg)
Models• Logicians typically think in terms of models, which are formally
structured worlds with respect to which truth can be evaluated
• We say m is a model of a sentence α if α is true in m
• M(α) is the set of all models of α
• Then KB ╞ α iff M(KB) M(α)
– E.g. KB = Giants won and Redswon α = Giants won
–
![Page 10: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/10.jpg)
Entailment in the wumpus world
Situation after detecting nothing in [1,1], moving right, breeze in [2,1]
Consider possible models for KB assuming only pits
3 Boolean choices 8 possible models
![Page 11: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/11.jpg)
Wumpus models
![Page 12: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/12.jpg)
Wumpus models
• KB = wumpus-world rules + observations
•
![Page 13: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/13.jpg)
Wumpus models
• KB = wumpus-world rules + observations• α1 = "[1,2] is safe", KB ╞ α1, proved by model checking
••
![Page 14: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/14.jpg)
Wumpus models
• KB = wumpus-world rules + observations
![Page 15: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/15.jpg)
Wumpus models
• KB = wumpus-world rules + observations• α2 = "[2,2] is safe", KB ╞ α2
•
![Page 16: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/16.jpg)
Inference
• KB ├i α = sentence α can be derived from KB by procedure (inference algorithm) i
• Soundness: i is sound if whenever KB ├i α, it is also true that KB╞ α (aka Truth Preserving)
• Completeness: i is complete if whenever KB╞ α, it is also true that KB ├i α
• Preview: we will define a logic (first-order logic) which is expressive enough to say almost anything of interest, and for which (in some cases) there exists a sound and complete inference procedure.
• That is, the procedure will answer any question whose answer follows from what is known by the KB.
![Page 17: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/17.jpg)
17
Propositional Logic
A proposition is
a declarative sentence that is either TRUE or FALSE (not both).
Examples:
•The Earth is flat•3 + 2 = 5• I am older than my mother •Tallahassee is the capital of Florida•5 + 3 = 9•Athens is the capital of Georgia
![Page 18: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/18.jpg)
18
Propositional Logic
A proposition is
a declarative sentence that is either TRUE or FALSE (not both).
Which of these are propositions?
• What time is it?• Christmas is celebrated on December 25th
• Tomorrow is my birthday• There are 12 inches in a foot• Ford manufactures the world’s best automobiles• x + y = 2• Grass is green
![Page 19: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/19.jpg)
19
Propositional Logic
Compound propositions : built up from simpler propositions using logical operators
Frequently corresponds with compound English sentences.
Example: Given
p: Jack is older than Jillq: Jill is female
We can build up
r: Jack is older than Jill and Jill is female (p q)
s: Jack is older than Jill or Jill is female (p q)
t: Jack is older than Jill and it is not the case that Jill is female
(p q)
![Page 20: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/20.jpg)
Propositional logic: Syntax
Let symbols S1, S2 represent propositions, also called sentences
If S is a proposition, S is a proposition (negation)
If S1 and S2 are propositions, S1 S2 is a proposition (conjunction)
If S1 and S2 are propositions, S1 S2 is a proposition (disjunction)
If S1 and S2 are propositions, S1 S2 is a proposition (implication) (might sometimes see )
If S1 and S2 are propositions, S1 S2 is a proposition (biconditional) (might sometimes see )
![Page 21: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/21.jpg)
21
Propositional Logic - negation
Let p be a proposition. The negation of p is written p and has meaning:
“It is not the case that p.”
Truth table for negation:p p
TF
FT
![Page 22: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/22.jpg)
22
Propositional Logic - conjunction
Conjunction operator “” (AND): corresponds to English “and.” is a binary operator in that it operates on two
propositions when creating compound proposition
Def. Let p and q be two arbitrary propositions, the conjunction of p and q, denoted
p q,
is true if both p and q are true, and false otherwise.
![Page 23: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/23.jpg)
23
Propositional Logic - conjunction
Conjunction operator
p q is true when p and q are both true.
Truth table for conjunction:
p q p q
TTFF
TFTF
TFFF
![Page 24: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/24.jpg)
24
Propositional Logic - disjunction
Disjunction operator (or): loosely corresponds to English “or.” binary operator
Def.: Let p and q be two arbitrary propositions, the disjunction of p and q, denoted
p qis false when both p and q are false, and true otherwise.
is also called inclusive or Observe that p q is true when p is true, or q is true,
or both p and q are true.
![Page 25: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/25.jpg)
25
Propositional Logic - disjunction
Disjunction operator
p q is true when p or q (or both) is true.
Truth table for conjunction:
p q p q
TTFF
TFTF
TTTF
![Page 26: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/26.jpg)
26
Propositional Logic - XOR
Exclusive Or operator (): corresponds to English “either…
or…” (exclusive form of or) binary operator
Def.: Let p and q be two arbitrary propositions, the exclusive or of p and q, denoted
p q is true when either p or q (but not both) is true.
![Page 27: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/27.jpg)
27
Propositional Logic - XORExclusive Or:
p q is true when p or q (not both) is true.
Truth table for exclusive or:
p qp q
TTFF
TFTF
FTTF
![Page 28: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/28.jpg)
28
Propositional Logic- ImplicationImplication operator ():
binary operator similar to the English usage of “if…then…”, “implies”, and
many other English phrases
Def.: Let p and q be two arbitrary propositions, the implication pq is false when p is true and q is false, and true otherwise.
p q is true when p is true and q is true, q is true, or p is false.
p q is false when p is true and q is false.
Example:
r : “The dog is barking.”s : “The dog is awake.”r s : “If the dog is barking then the dog is awake.”
![Page 29: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/29.jpg)
29
Propositional Logic- Implication
p q p q
TTFF
TFTF
Truth table for implication:
T
F
![Page 30: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/30.jpg)
30
Propositional Logic- Implication
p q p q
TTFF
TFTF
TFTT
If the temperature is below 10 F, then water freezes.
Truth table for implication:
![Page 31: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/31.jpg)
31
Propositional Logic- ImplicationSome terminology, for an implication p q:
Its converse is: q p.Its inverse is: ¬ p ¬ q.Its contrapositive is: ¬q ¬ p.
One of these has the same meaning (same truth table) as p q. Which one ?
![Page 32: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/32.jpg)
32
Propositional Logic- BiconditionalBiconditional operator ():
Binary operator Partly similar to the English usage of “If and only if
Def.: Let p and q be two arbitrary propositions.
The biconditional p q is true when q and p have the same truth values and false otherwise.
Example:
p : “The dog plays fetch.” q : “The dog is outside.”p q: “The plays fetch if and only if it is
outside.”
![Page 33: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/33.jpg)
33
Propositional Logic- Biconditional
Truth table for biconditional:
p q p qTTFF
TFTF
TFFT
![Page 34: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/34.jpg)
34
Nested PropositionsUse parentheses to group sub-expressions in a compound
proposition:
“I’m sick, and I’m going to the doctor or I’m staying home.” = p (q s)
(p q) s would mean something different
![Page 35: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/35.jpg)
35
Propositional Logic: Precedence
LogicalOperator
Precedence
1
2
3
4
5 Examples:Examples:
p p q r is equivalent to (( p) p) q) r
p p q r s is equivalent to p p (q (r s))
By convention…
![Page 36: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/36.jpg)
Propositional logic: SemanticsEach model specifies true/false for each proposition symbol
E.g. P1,2 P2,2 P3,1
false true falseWith these symbols, 8 possible models, can be enumerated automatically.Rules for evaluating truth with respect to a model m:
S is true iff S is false S1 S2 is true iff S1 is true and S2 is trueS1 S2 is true iff S1 is true or S2 is true (or both)S1 S2 is true iff S1 is false or S2 is true i.e., is false iff S1 is true and S2 is false (only case)S1 S2 is true iff S1S2 is true andS2S1 is true
Simple recursive process evaluates an arbitrary sentence, e.g.,P1,2 (P2,2 P3,1) = true (true false) = true true = true
•
![Page 37: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/37.jpg)
Truth tables for connectives
Not the preferred form of a Truth Table (right, this one is upside down)
![Page 38: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/38.jpg)
38
Propositional Logic
Proving the equivalence using truth tables
p q pqT T TT F FF T TF F T
q pTFTT
contrapositive p q
TTFT
inverse
q pTTFT
converse
![Page 39: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/39.jpg)
Wumpus world sentences
Let Pi,j be true if there is a pit in [i, j].
Let Bi,j be true if there is a breeze in [i, j]. P1,1
B1,1
B2,1
• "Pits cause breezes in adjacent squares"B1,1 (P1,2 P2,1)
B2,1 (P1,1 P2,2 P3,1)
![Page 40: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/40.jpg)
Truth tables for inference
Awk!
![Page 41: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/41.jpg)
Inference by enumeration
• Depth-first enumeration of all models is sound and complete
• For n symbols, time complexity is O(2n), space complexity is O(n)
•
![Page 42: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/42.jpg)
Logical equivalence• Two sentences are logically equivalent if they are true in
the same set of models. Also, α ≡ ß iff α╞ β and β╞ α
![Page 43: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/43.jpg)
43
Propositional Equivalences
A tautology is a proposition that is always true. Ex.: p p
A contradiction is a proposition that is always false. Ex.: p p
A contingency is a proposition that is neither a tautology nor a contradiction. Ex.: p p
FT
TF
p p pp
TT
FT
TF
p p pp
FF
FT
TF
p p pp
FT
![Page 44: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/44.jpg)
44
Propositional Logic: Logical Equivalence
If p and q are propositions, then p is logically equivalent to q if their truth tables are the same.
“p is equivalent to q.” is denoted by p q
p, q are logically equivalent if their biconditional p q is a tautology.
![Page 45: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/45.jpg)
45
Propositional Logic: Logical Equivalence
How do we prove that two compound propositions are logically equivalent ?
1. Construct the truth table of both compound propositions
2. Check if their truth-values are the same whenever the truth value of their propositions agree.
![Page 46: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/46.jpg)
46
Propositional Logic: Logical Equivalence
p p
F
T
T
F
F
T
ppP
The equivalence holds since these two columns are the same.
![Page 47: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/47.jpg)
47
Propositional Logic: Logical Equivalence
p q p q
![Page 48: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/48.jpg)
48
Propositional Logic: Logical Equivalence
Is p (q r) (p q) (p r) ?
![Page 49: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/49.jpg)
49
Propositional Logic: Logical Equivalences
• Identity p T p
p F p
• Domination
p T T p F F
• Idempotence pp p pp p
• Double negation
p p
![Page 50: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/50.jpg)
50
Propositional Logic: Logical Equivalences
• Commutativity: p q q p
p q q p
• Associativity:
(p q) r p ( q r )
(p q) r p ( q r )
![Page 51: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/51.jpg)
51
Propositional Logic: Logical Equivalences• Distributive:
p (q r) (p q) (p r)
p (q r) (p q) (p r)
• De Morgan’s:
(p q) p q (De Morgan’s I)
(p q) p q (De Morgan’s II)
![Page 52: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/52.jpg)
52
DeMorgan’s Identities
DeMorgan’s can be extended for simplification of negations of complex expressions
Conjunctional negation:
(p1 p2 … pn) (p1 p2 … pn)
Disjunctional negation:
(p1p2…pn) (p1p2…pn)
![Page 53: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/53.jpg)
53
Propositional Logic: Logical Equivalences
• Excluded Middle:
p p T
• Uniqueness:
p p F
• A useful LE involving :
p q p q
![Page 54: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/54.jpg)
54
Propositional Logic Use known logical equivalences to prove that two propositions are logically equivalent
Example:
( p q) p q
We will use the LE,
p p Double negation
(p q) p q (De Morgan’s II)
![Page 55: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/55.jpg)
55
Propositional Logic Applying logical equivalences to prove tautologies:
Is (p (p q)) q a tautology ?
![Page 56: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/56.jpg)
Validity and satisfiabilityA sentence is valid if it is true in all models, (remind you of something)
e.g., True, A A, A A, (A (A B)) BValidity is connected to inference via the Deduction Theorem:
KB ╞ α if and only if (KB α) is valid, i.e., (KB α) TrueA sentence is satisfiable if it is true in some model
e.g., A B, C
A sentence is unsatisfiable if it is true in no modelse.g., A A
Satisfiability is connected to inference via the following:KB ╞ α if and only if (KB α) is unsatisfiable (i.e., proof by contradiction)
–––
![Page 57: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/57.jpg)
Monotonicity
If KB ╞ α then KB ˄ β╞ α
If we add an additional known fact or derivable conclusion to the knowledge base, then the knowledge base still
entails any and all of its previous results. That is, there’s no way to override a previous conclusion, or allow for
exceptions.
This is a nice property of typical logical systems but it’s not really how humans do things. So, we need something
better like defeasible reasoning.
![Page 58: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/58.jpg)
Proof methods
• Proof methods divide into (roughly) two kinds:
– Application of inference rules• Legitimate (sound) generation of new sentences from old• Proof = a sequence of inference rule applications
Can use inference rules as operators in a standard search algorithm
• Typically require transformation of sentences into a normal form
– Model checking• truth table enumeration (always exponential in n)• improved backtracking, e.g., Davis--Putnam-Logemann-Loveland
(DPLL)• heuristic search in model space (sound but incomplete)
e.g., min-conflicts-like hill-climbing algorithms
•
![Page 59: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/59.jpg)
ResolutionConjunctive Normal Form (CNF)
conjunction of clauses (disjunctions of literals)E.g., (A B) (B C D)
• Resolution inference rule (for CNF):l1 … lk, m1 … mn
l1 … li-1 li+1 … lk m1 … mj-1 mj+1 ... mn
where li and mj are complementary literals. E.g., P1,3 P2,2, P2,2
P1,3
• Resolution is sound and complete for propositional logic
»•
![Page 60: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/60.jpg)
Resolution
Soundness of resolution inference rule:
(l1 … li-1 li+1 … lk) li
mj (m1 … mj-1 mj+1 ... mn)
(l1 … li-1 li+1 … lk) (m1 … mj-1 mj+1 ... mn)
![Page 61: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/61.jpg)
Conversion to CNF
B1,1 (P1,2 P2,1)1. Eliminate , replacing α β with (α β)(β α).2. Eliminate , replacing α β with α β.
(B1,1 P1,2 P2,1) ((P1,2 P2,1) B1,1)
3. Move inwards using de Morgan's rules and double-negation:(B1,1 P1,2 P2,1) ((P1,2 P2,1) B1,1)
4. Apply distributive law ( over ) and flatten:(B1,1 P1,2 P2,1) (P1,2 B1,1) (P2,1 B1,1)
–(B1,1 (P1,2 P2,1)) ((P1,2 P2,1)
B1,1)•
![Page 62: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/62.jpg)
Resolution algorithm
• Proof by contradiction, i.e., show KB α unsatisfiable
![Page 63: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/63.jpg)
Resolution example
KB = (B1,1 (P1,2 P2,1)) B1,1 α = P1,2
![Page 64: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/64.jpg)
Forward and backward chaining• Horn Form (restricted)
KB = conjunction of Horn clauses (just like prolog)– Horn clause =
• proposition symbol; or• (conjunction of symbols) symbol
– E.g., C (B A) (C D B)• Modus Ponens (for Horn Form): complete for Horn KBs
α1, … ,αn, α1 … αn ββ
• Can be used with forward chaining or backward chaining.• These algorithms are very natural and run in linear time
••
–
–
![Page 65: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/65.jpg)
Forward chaining
• Idea: fire any rule whose premises are satisfied in the KB,– add its conclusion to the KB, until query is found
![Page 66: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/66.jpg)
Forward chaining algorithm
• Forward chaining is sound and complete for Horn KB
![Page 67: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/67.jpg)
Forward chaining example
![Page 68: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/68.jpg)
Forward chaining example
![Page 69: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/69.jpg)
Forward chaining example
![Page 70: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/70.jpg)
Forward chaining example
![Page 71: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/71.jpg)
Forward chaining example
![Page 72: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/72.jpg)
Forward chaining example
![Page 73: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/73.jpg)
Forward chaining example
![Page 74: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/74.jpg)
Forward chaining example
![Page 75: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/75.jpg)
Proof of completeness
• FC derives every atomic sentence that is entailed by KB
1. FC reaches a fixed point where no new atomic sentences are derived
2. Consider the final state as a model m, assigning true/false to symbols
3. Every clause in the original KB is true in m a1 … ak b
4. Hence m is a model of KB5. If KB╞ q, q is true in every model of KB, including m
![Page 76: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/76.jpg)
Backward chaining
Idea: work backwards from the query q:to prove q by BC,
check if q is known already, orprove by BC all premises of some rule concluding q
Avoid loops: check if new subgoal is already on the goal stack
Avoid repeated work: check if new subgoal1. has already been proved true, or2. has already failed
•
![Page 77: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/77.jpg)
Backward chaining example
![Page 78: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/78.jpg)
Backward chaining example
![Page 79: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/79.jpg)
Backward chaining example
![Page 80: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/80.jpg)
Backward chaining example
![Page 81: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/81.jpg)
Backward chaining example
![Page 82: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/82.jpg)
Backward chaining example
![Page 83: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/83.jpg)
Backward chaining example
![Page 84: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/84.jpg)
Backward chaining example
![Page 85: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/85.jpg)
Backward chaining example
![Page 86: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/86.jpg)
Backward chaining example
![Page 87: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/87.jpg)
Forward vs. backward chaining
• FC is data-driven, automatic, unconscious processing,– e.g., object recognition, routine decisions
• May do lots of work that is irrelevant to the goal
• BC is goal-driven, appropriate for problem-solving,– e.g., Where are my keys? How do I get into a PhD program?
• Complexity of BC can be much less than linear in size of KB
![Page 88: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/88.jpg)
Efficient propositional inference
Two families of efficient algorithms for propositional inference:
Complete backtracking search algorithms• DPLL algorithm (Davis, Putnam, Logemann, Loveland)• Incomplete local search algorithms
– WalkSAT algorithm
•
![Page 89: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/89.jpg)
The DPLL algorithmDetermine if an input propositional logic sentence (in CNF) is
satisfiable.Improvements over truth table enumeration:
1. Early terminationA clause is true if any literal is true.A sentence is false if any clause is false.
2. Pure symbol heuristicPure symbol: always appears with the same "sign" in all clauses. e.g., In the three clauses (A B), (B C), (C A), A and B are pure, C is
impure. Make a pure symbol literal true.
3. Unit clause heuristicUnit clause: only one literal in the clauseThe only literal in a unit clause must be true.
•
![Page 90: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/90.jpg)
The DPLL algorithm
![Page 91: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/91.jpg)
The WalkSAT algorithm
• Incomplete, local search algorithm• Evaluation function: The min-conflict heuristic of
minimizing the number of unsatisfied clauses• Balance between greediness and randomness
![Page 92: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/92.jpg)
The WalkSAT algorithm
![Page 93: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/93.jpg)
Hard satisfiability problems
• Consider random 3-CNF sentences. e.g.,
(D B C) (B A C) (C B E) (E D B) (B E C)m = number of clauses
n = number of symbols– Hard problems seem to cluster near m/n = 4.3
(critical point)
•
![Page 94: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/94.jpg)
Hard satisfiability problems
![Page 95: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/95.jpg)
Hard satisfiability problems
• Median runtime for 100 satisfiable random 3-CNF sentences, n = 50
![Page 96: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/96.jpg)
Inference-based agents in the wumpus world
A wumpus-world agent using propositional logic:P1,1
W1,1
Bx,y (Px,y+1 Px,y-1 Px+1,y Px-1,y)
Sx,y (Wx,y+1 Wx,y-1 Wx+1,y Wx-1,y)
W1,1 W1,2 … W4,4
W1,1 W1,2
W1,1 W1,3 …
64 distinct proposition symbols, 155 sentences
•
•
![Page 97: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/97.jpg)
![Page 98: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/98.jpg)
• KB contains "physics" sentences for every single square
• For every time t and every location [x,y],
Lx,y FacingRightt Forwardt Lx+1,y
• Rapid proliferation of clauses
Expressiveness limitation of propositional logic
tt
![Page 99: Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,](https://reader036.fdocuments.in/reader036/viewer/2022062515/56649f425503460f94c613fd/html5/thumbnails/99.jpg)
Summary• Logical agents apply inference to a knowledge base to derive new
information and make decisions• Basic concepts of logic:
– syntax: formal structure of sentences– semantics: truth of sentences wrt models– entailment: necessary truth of one sentence given another– inference: deriving sentences from other sentences– soundness: derivations produce only entailed sentences– completeness: derivations can produce all entailed sentences
• Wumpus world requires the ability to represent partial and negated information, reason by cases, etc.
• Resolution is complete for propositional logicForward, backward chaining are linear-time, complete for Horn clauses
• Propositional logic lacks expressive power