CSE 412: Artificial Intelligence

Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1of 34

Summer 2016

CSE 412:
Artificial Intelligence
Topic – 5: Logical Agents
Contents:



Architecture of a
Simple Intelligent Agent

Environment Agent

Sensors Model of World Prior Knowledge


(being updated) about the World

Reasoning &
Decisions Making

Effectors List of
Goals/Utility
Possible Actions

2
Knowledge Based Agent

 Knowledge base:
– A knowledge base (abbreviated KB or kb) is a special
kind of database for knowledge management.
– A knowledge base is an information repository that
provides a means for information to be collected,
organized, shared, searched and utilized.
– The part of an expert system that contains the facts
and rules needed to solve problems.
– A collection of facts and rules for problem solving.

3
Knowledge Based Agent

 The agent must be able to:


– represent states, actions, etc.
– incorporate new percepts
– update internal representation of world
– deduce hidden properties of world
– deduce appropriate actions
 One of the core problems in developing an
intelligent agent is knowledge representation:
– how to represent knowledge
– how to reason using that knowledge

4
Knowledge Bases (KB)

 A knowledge base:
– contains the domain-specific content for an agent
– is a set of representations of facts about the world
 is a set of sentences in a formal language

 Building the KB:


– learning: agent discovers what it knows
– telling: agent is given what it knows (declarative)

5
Knowledge Bases (KB)

 Main actions of intelligent agent:


– TELL information to KB in the form of percept
– ASK KB what to do in the form of action

 Answers should follow from KB.


Agent should not make things up!

 An inference engine is composed of domain-


independent algorithms that are used to
determine what follows from the knowledge
base.
6
Knowledge Bases (KB)

 View of agent (levels of abstraction):


– knowledge level:
what the agent knows at a high level
– logic level:
level of sentence encoding
– implementation level:
level that runs on the architecture,
detail of data structures and algorithms.

7
Algorithm

8
General Logic

 The agent internally represents its


world/environment in its knowledge base.
 Sentences are representations in some language.
 Facts are claims about the world that are true/false.
The Sky is blue.
Sentences
The sun is shining
representation in agent
world/environment
Facts

9
General Logic

 Sentences represent facts in the world.


 Meaning connects sentences to their facts.
 A sentence is true if what it represents is
actually the case in the current state of world.
Sentences Time flies.
representation in agent Meaning / Interpretation
world/environment
Facts

10
General Logic

 Proper reasoning ensures that conclusions


inferred from the KB are consistent with reality.
That means they represent new facts that actually follow
from the original facts (represented by sentences in the
KB).
infer
Knowledge Conclusions
repr.
world
follows
Facts New Facts

11
General Logic

 Computers don't know the meaning.


 A mechanical inference procedure is needed that derives
conclusions without needing to know the meaning of the
sentences.

entails
infer
Knowledge
Sentences Conclusions
New Sentences
repr.
world
follows
Facts New Facts

12
Entailment

 KB ╞ α
Knowledge base KB entails sentence α
if and only if α is true in all worlds where KB is true

13
Entailment

 KB ╞ α
Knowledge base KB entails sentence α
if and only if α is true in all worlds where KB is true
 For example:
KB: "sky is blue" = true, "sun is shining" = true
entails α: "sky is blue and sun is shining" = true
– α represents a true fact
as long as facts represented in KB are true
– if the sky was actually cloudy then KB isn't the true world state

then α wouldn't represent a true fact


 Entailment requires sentences in KB to be true.
14
Logical Inference

 Inference procedure can:


– generate new sentences α entailed by KB
– determine whether or not a given sentence α
is entailed by KB (i.e. prove α)

15
General Logic

 Logics are formal languages for representing


information from which conclusions can be drawn.

16
General Logic

 Logics are characterized by


what they commit to as "primitives".
Logic What Exists in World Knowledge States
Propositional facts true/false/unknown
First-Order facts, objects, relations true/false/unknown
Temporal facts, objects, true/false/unknown
relations, times
Probability Theory facts degree of belief 0..1
Fuzzy degree of truth degree of belief 0..1

17
Propositional Logic (PL) Basics

 propositions: assertions about an aspect of a world


that can be assigned either a true or false value
– e.g. SkyIsCloudy, JimIsHappy
– True, False are propositions meaning true and false

18
Logical Connectives of PL

 S negation (not)


 S1S2 conjunction (and)
S1 and S2 are conjuncts
 S1S2 disjunction (or)
S1 and S2 are disjuncts
 S1S2 implication/conditional (if-then)
S1 is the antecedent/premise
S2 is the consequent/conclusion
 S1S2 equivalence/biconditional (if and only if)

19
Syntax of PL

 Models specify truth value for each proposition:


e.g. S1= true, S2= false
 Rules for evaluating truth with respect to model m
S is true iff S is false
S1S2 is true iff S1 is true and S2 is true
S1S2 is true iff S1 is true or S2 is true
S1S2 is true iff S1 is true or S2 is true
is true iff S1 is false or S2 is true
is false iff S1 is true and S2 is false
S1S2 is true iff S1S2 is true and S2S1 is true
 Operator Precedence: (highest)      (lowest)

20
Truth Tables

A B C
false false false
false false true Given n symbols,
false true false 2n possible combinations of
false true true truth value assignments.
true false false
true false true here each row is an interpretation
true true false
true true true

21
Implication Truth Table

A B AB B A
false false true true
false true true true
true false false false
True true true true

AB is equivalent to B A

22
Validity

A B C A A
false false false true
false false true true A sentence is valid
false true false true if it's true in all interpretations:
false true true true P1 P1 P1P1 (tautologies)
true false false true
true false true true (i.e. its entire column is true)
true true false true
true true true true

23
Satisfiability

A B C A B
false false false true
false false true true A sentence is satisfiable
false true false false if it's true in some interpretations:
false true true false P1 P2 P2P1
true false false true
true false true true (i.e. its column is true and false)
true true false true
true true true true

24
25
Unsatisfiability

A B C C C
false false false false
false false true false A sentence is unsatisfiable
false true false false if it's true in no interpretations:
false true true false P1 P1 (inconsistent/contradiction)
true false false false
true false true false (i.e. its entire column is false)
true true false false
true true true false

26
27
Inference Proof Methods

 Model Checking:
– truth table enumeration
sound and complete for propositional logic
– heuristic search in model space
sound but incomplete
 Application of Syntactic Operations
(i.e. Inference Rules):
– sound generation of new sentences from old
– could use inference rules as operators for search

28
Inference by Enumeration

LET: KB = AC, B C α = AB


DOES: KB ╞ α ?

A B C RECALL: The computer


false false false doesn't know the meaning
false false true
of the proposition symbols.
false true false
false true true
So all logically distinct cases
true false false
must be checked to prove that
true false true
true true false
a sentence can be derived
true true true from a KB.
29
Inference by Enumeration

LET: KB = AC, B C α = AB


DOES: KB ╞ α ?

A B C AC B C KB
false false false false true false Rows where all of
false false true true false false sentences in KB
false true false false true false are true are the
false true true true true true
models of KB
true false false true true true
true false true true false false
true true false true true true
true true true true true true
30
Inference by Enumeration

LET: KB = AC, B C α = AB


DOES: KB ╞ α ? YES!
A B C AC B C KB AB KBα α is entailed by KB,
false false false false true false false true if all models of KB
false false true true false false false true
are models of α,
false true false false true false true true
i.e. all rows where
false true true true true true true true
true false false true true true true true
KB is true, α is true
true false true true false false true true In other words:
true true false true true true true true KB α is valid.
true true true true true true true true
31
IF value of KB is “true” and its corresponding α (alpha) is also TRUE
then all results (last column) are TRUE… If KB value is true but
32 corresponding α is false (even if one case) then All results are FALSE
IF value of KB is “true” and its corresponding α (alpha) is also TRUE
then all results (last column) are TRUE. If KB value is true but
33 corresponding α is false (even if one case) then All results are FALSE
Inference by Enumeration

 Though complete for PL, the proofs using this


enumeration grow exponentially in length as the
number of symbols increases.

 There must be a better way.


 Natural deduction is an inference procedure
that uses sound inference rules to derive new
sentences from the KB and any previously
derived sentences until the conclusion sentence
is derived.
34

You might also like