Logical Agents and Propositional Logic in AI

undefined
Artificial Intelligence
Chapter 7: Logical Agents & Propositional Logic
 
Instructor: Zakariya Ahmed Oraibi
University of Basrah, Iraq
In which we design agents that can form representations of the
world, use a process of 
inference
 to derive new 
representations
about the world, and use these new representations to 
deduce
what to do.
What is 
Knowledge Base 
(
KB
)
 
Logical Agents Combine:
    - A Knowledge Base (KB): A list of facts that are known to the
      agent.
    - Current Percepts.
Motivation: To infer hidden aspects of the current state using 
Rules of Inference
 
  Thus, 
KB
 can be defined as: 
A set of sentences describing the world.
How to Represent 
KB
?
Logic
: 
It is a formal language to represent knowledge, which consists
of:
 
Which one is more challenging? And why?
How to Represent 
KB
?
 
Words with more than one meaning:
 
-
left
 my phone on the 
left
 side of the room.
-
The committee 
chair
 sat in the center 
chair
.
 
- 
She will 
park
 the car so we can walk in the 
park
.
 
 
Propositional Logic
The simplest and most abstract logic
 
Note
: letters (q, p, O, …) can be used to represent this logic
 
-
A 
proposition
: is a statement that can either be true or false; it
must be one or the other but not both.
   
 
     Example: “9 + 5” , “9 is not a prime number”
-
An 
atomic sentence 
is one whose truth or falsity does not depend
on any other proposition.
Syntax
Semantic
- A 
model
 specifies the true/ false status of each proposition symbol in the KB.
Semantic Continues..
Semantic Continues..
Entailment
- The truth of one sentence follows from the truth of another sentence.
 
Entailment: Inference
 
Entailment: Inference
 
 
Answer 2: We can use deduction theorem: 
if KB then a
Inference Rules.. 
NO TRUTH TABLE
 
 
I
t
 
i
s
 
a
 
f
a
s
t
e
r
 
w
a
y
 
t
o
 
i
m
p
l
e
m
e
n
t
 
t
h
e
 
i
n
f
e
r
e
n
c
e
 
p
r
o
c
e
s
s
 
b
y
 
u
s
i
n
g
 
a
 
p
r
o
o
f
p
r
o
c
e
d
u
r
e
 
t
h
a
t
 
u
s
e
s
 
s
o
u
n
d
 
r
u
l
e
s
 
o
f
 
i
n
f
e
r
e
n
c
e
 
t
o
 
d
e
d
u
c
e
 
(
i
.
e
.
,
 
d
e
r
i
v
e
)
 
n
e
w
s
e
n
t
e
n
c
e
s
 
t
h
a
t
 
a
r
e
 
t
r
u
e
 
i
n
 
a
l
l
 
c
a
s
e
s
 
w
h
e
r
e
 
t
h
e
 
p
r
e
m
i
s
e
s
 
a
r
e
 
t
r
u
e
.
 
G
i
v
e
n
 
t
h
e
 
s
e
n
t
e
n
c
e
s
 
i
n
 
K
B
,
 
c
o
n
s
t
r
u
c
t
 
a
 
p
r
o
o
f
 
t
h
a
t
 
a
 
g
i
v
e
n
 
c
o
n
c
l
u
s
i
o
n
s
e
n
t
e
n
c
e
 
c
a
n
 
b
e
 
d
e
r
i
v
e
d
 
f
r
o
m
 
K
B
 
b
y
 
a
p
p
l
y
i
n
g
 
a
 
s
e
q
u
e
n
c
e
 
o
f
 
s
o
u
n
d
i
n
f
e
r
e
n
c
e
s
 
u
s
i
n
g
 
e
i
t
h
e
r
 
s
e
n
t
e
n
c
e
s
 
i
n
 
K
B
 
o
r
 
s
e
n
t
e
n
c
e
s
 
d
e
r
i
v
e
d
 
e
a
r
l
i
e
r
 
i
n
 
t
h
e
p
r
o
o
f
,
 
u
n
t
i
l
 
t
h
e
 
c
o
n
c
l
u
s
i
o
n
 
s
e
n
t
e
n
c
e
 
i
s
 
d
e
r
i
v
e
d
.
 
T
h
i
s
 
s
t
e
p
-
b
y
-
s
t
e
p
,
 
l
o
c
a
l
 
p
r
o
o
f
 
p
r
o
c
e
s
s
 
a
l
s
o
 
r
e
l
i
e
s
 
o
n
 
t
h
e
 
m
o
n
o
t
o
n
i
c
i
t
y
p
r
o
p
e
r
t
y
.
 
T
h
a
t
 
i
s
,
 
a
d
d
i
n
g
 
a
 
n
e
w
 
s
e
n
t
e
n
c
e
 
t
o
 
K
B
 
d
o
e
s
 
n
o
t
 
a
f
f
e
c
t
 
w
h
a
t
 
c
a
n
 
b
e
e
n
t
a
i
l
e
d
 
f
r
o
m
 
t
h
e
 
o
r
i
g
i
n
a
l
 
K
B
 
a
n
d
 
d
o
e
s
 
n
o
t
 
i
n
v
a
l
i
d
a
t
e
 
o
l
d
 
s
e
n
t
e
n
c
e
s
.
Inference Rules.. 
MEMORIZE
 
p
Inference Rules.. 
MEMORIZE
 
 
Because of “
Implication Elimination
 
ꞀP     q
 
P            q        Can be rewritten as:
 
 
P
1
2
 
q
3
 
Using MP Rule
 
New Rule has been inferenced
Inference Rules.. 
MEMORIZE
 
p
Inference Rules.. 
MEMORIZE
 
 
Because of “
Implication Elimination
 
ꞀP     q
 
P            q        Can be rewritten as:
 
1
2
 
Ꞁ P
3
 
Ꞁ q
 
Using MT Rule
 
New Rule has been inferenced
Inference Rules.. 
MEMORIZE
 
p      r
Inference Rules.. 
MEMORIZE
 
Because of “
Implication Elimination
ꞀP     q
P            q        Can be rewritten as:
1
2
3
 
Using 
Syllogism 
Rule
Because of “
Implication Elimination
Ꞁq     r
q            r        Can be rewritten as:
 
Inference Rules.. Example
 
Let’s take the weather problem:
Prove the conclusion “is it raining” for
the “weather problem” given above by inference rules.
Inference Rules.. Example
 
Let’s take the weather problem:
Prove the conclusion “It is raining” for
the “weather problem” given above by inference rules.
Answer
:
1
2
3
4
5
6
 
And Introduction (1,4)
 
Modus Ponens (3,5)
 
Modus Ponens (1,2)
Disadvantages of Propositional Logic
 
 
-
Hard to identify "individuals." E.g., Mary, 3. we need a unique
symbol for each individual.
 
-
Can't directly talk about properties of individuals or relations
between individuals. E.g., tall(Bill).
 
-
Generalizations can't easily be represented. E.g., all triangles have
3 sides.
Thank You
 
Slide Note
Embed
Share

Designing logical agents involves forming representations of the world, using inference for deriving new insights, and deducing actions based on these representations. Knowledge Base (KB) is a crucial component, comprising known facts and current percepts to infer hidden states. Propositional logic, involving true/false statements, plays a central role, with syntax and semantics defining logical structures. Entailment and inference are key concepts for deriving conclusions in logical reasoning.

  • Logical Agents
  • Propositional Logic
  • Knowledge Base
  • AI
  • Inference

Uploaded on Oct 09, 2024 | 0 Views


Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

E N D

Presentation Transcript


  1. Artificial Intelligence Chapter 7: Logical Agents & Propositional Logic In which we design agents that can form representations of the world, use a process of inference to derive new representations about the world, and use these new representations to deduce what to do. Instructor: Zakariya Ahmed Oraibi University of Basrah, Iraq

  2. What is Knowledge Base (KB) Logical Agents Combine: - A Knowledge Base (KB): A list of facts that are known to the agent. - Current Percepts. Thus, KB can be defined as: A set of sentences describing the world. Motivation: To infer hidden aspects of the current state using Rules of Inference

  3. How to Represent KB? Logic: It is a formal language to represent knowledge, which consists of: Which one is more challenging? And why?

  4. How to Represent KB? Words with more than one meaning: - I left my phone on the left side of the room. - The committee chair sat in the center chair. - She will park the car so we can walk in the park.

  5. Propositional Logic The simplest and most abstract logic - A proposition: is a statement that can either be true or false; it must be one or the other but not both. Example: 9 + 5 , 9 is not a prime number - An atomic sentence is one whose truth or falsity does not depend on any other proposition. Note: letters (q, p, O, ) can be used to represent this logic

  6. Syntax

  7. Semantic - A model specifies the true/ false status of each proposition symbol in the KB.

  8. Semantic Continues..

  9. Semantic Continues..

  10. Entailment - The truth of one sentence follows from the truth of another sentence.

  11. Entailment: Inference

  12. Entailment: Inference Answer 2: We can use deduction theorem: if KB then a

  13. Inference Rules.. NO TRUTH TABLE It is a faster way to implement the inference process by using a proof procedure that uses sound rules of inference to deduce (i.e., derive) new sentences that are true in all cases where the premises are true. Given the sentences in KB, construct a proof that a given conclusion sentence can be derived from KB by applying a sequence of sound inferences using either sentences in KB or sentences derived earlier in the proof, until the conclusion sentence is derived. This step-by-step, local proof process also relies on the monotonicity property. That is, adding a new sentence to KB does not affect what can be entailed from the original KB and does not invalidate old sentences.

  14. Inference Rules.. MEMORIZE p

  15. Inference Rules.. MEMORIZE P q Can be rewritten as: Because of Implication Elimination P q 1 P q P q 2 Using MP Rule 3 New Rule has been inferenced

  16. Inference Rules.. MEMORIZE p

  17. Inference Rules.. MEMORIZE P q Can be rewritten as: 2 q Because of Implication Elimination P q P q 1 P 3 Using MT Rule New Rule has been inferenced

  18. Inference Rules.. MEMORIZE p r p r

  19. Inference Rules.. MEMORIZE p r P q Can be rewritten as: q r Can be rewritten as: Because of Implication Elimination Because of Implication Elimination P q q r P q 1 q r 2 Using Syllogism Rule p r 3 p r

  20. Inference Rules.. Example Let s take the weather problem: Prove the conclusion is it raining for the weather problem given above by inference rules.

  21. Inference Rules.. Example Let s take the weather problem: Answer: 1 2 3 4 Modus Ponens (1,2) 5 And Introduction (1,4) 6 Modus Ponens (3,5) Prove the conclusion It is raining for the weather problem given above by inference rules.

  22. Disadvantages of Propositional Logic - Hard to identify "individuals." E.g., Mary, 3. we need a unique symbol for each individual. - Can't directly talk about properties of individuals or relations between individuals. E.g., tall(Bill). - Generalizations can't easily be represented. E.g., all triangles have 3 sides.

  23. Thank You

More Related Content

giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#