Scribd
Upload
20 views

Lecture11 - Representation Reasoning and Logic

This document provides an overview of artificial intelligence concepts related to knowledge representation and reasoning. It discusses knowledge bases which contain representations of facts about the world expressed using a knowledge representation language. It also describes how a knowledge-based agent can use an inference engine to query a knowledge base and deduce new facts using logical reasoning. The document outlines different types of logic used for knowledge representation and introduces concepts like propositional logic, truth tables, and inference rules.

Uploaded by

meer barzan
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
20 views

Lecture11 - Representation Reasoning and Logic

This document provides an overview of artificial intelligence concepts related to knowledge representation and reasoning. It discusses knowledge bases which contain representations of facts about the world expressed using a knowledge representation language. It also describes how a knowledge-based agent can use an inference engine to query a knowledge base and deduce new facts using logical reasoning. The document outlines different types of logic used for knowledge representation and introduces concepts like propositional logic, truth tables, and inference rules.

Uploaded by

meer barzan
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 19

CPE–415 Artificial Intelligence

Representation,
Reasoning and Logic
Knowledge and reasoning
• Knowledge representation
• Logic and representation
• Propositional (Boolean) logic
• Normal forms
• Inference in propositional logic
Knowledge Base and Sentence
• Knowledge base is a set of representation of
facts about the world.
• Each individual representation is called a
sentence
• The sentences are expressed in a language
called a knowledge representation language
Knowledge-Based Agent
• Agent that uses prior or acquired knowledge
to achieve its goals
– Can make more efficient decisions
Domain independent algorithms – Can make informed decisions
• Knowledge Base (KB): contains a set of
representations of facts about the Agent’s
environment
ASK Inference engine
• Each representation is called a sentence
Knowledge Base • Use some knowledge representation
TELL
language, to TELL it what to know e.g.,
(temperature 72F)
• ASK agent to query what to do
Domain specific content • Agent can use inference to deduce new facts
from TELLed facts
Generic knowledge-based agent

1. TELL KB what was perceived


Uses a KRL(knowledge representation logic) to insert new sentences,
representations of facts, into KB

2. ASK KB what to do.


Uses logical reasoning to examine actions and select best.
Logic in general
Types of logic
Truth depends on Interpretation

Representation 1 World
A

B
ON(A,B) T
ON(A,B) F

ON(A,B) F A

ON(A,B) T B
Entailment

Generated new sentences are necessarily true, given


that the old sentences are true.
Models
Inference
(Inference procedure that generates only entailed
sentence)

(Find proof for any entailed sentence)


Basic symbols
• Expressions only evaluate to either “true” or “false.”

• P “P is true”
• ¬P “P is false” negation
• PVQ “either P is true or Q is true or both” disjunction
• P^Q “both P and Q are true” conjunction
• P => Q “if P is true, the Q is true” implication
• PQ “P and Q are either both true or both false” equivalence
Propositional logic: syntax
Propositional logic: semantics
Truth tables
• Truth value: whether a statement is true or false.
• Truth table: complete list of truth values for a statement given all
possible values of the individual atomic expressions.

Example:

P Q PVQ
T T T
T F T
F T T
F F F
Truth tables for basic connectives

P Q ¬P ¬Q P V Q P ^ Q P=>Q PQ

T T F F T T T T
T F F T T F F F
F T T F T F T F
F F T T F F T T
Propositional logic: basic manipulation
rules

• ¬(¬A) = A Double negation

• ¬(A ^ B) = (¬A) V (¬B) Negated “and”


• ¬(A V B) = (¬A) ^ (¬B) Negated “or”

• A ^ (B V C) = (A ^ B) V (A ^ C) Distributivity of ^ on V
• A => B = (¬A) V B by definition
• ¬(A => B) = A ^ (¬B) using negated or
• A  B = (A => B) ^ (B => A) by definition
• ¬(A  B) = (A ^ (¬B))V(B ^ (¬A)) using negated and & or
• …
Propositional inference:
enumeration method
Enumeration: Solution

You might also like