Date post: | 05-Apr-2018 |
Category: |
Documents |
Upload: | nilam-kumar |
View: | 215 times |
Download: | 0 times |
of 25
7/31/2019 Basic Comp 2
1/25
JSS/LEC006/ITT/R000/V001/DT 240704 1 /41
Artificial IntelligenceLecture 2
7/31/2019 Basic Comp 2
2/25
JSS/LEC006/ITT/R000/V001/DT 240704 2 /41Next End
Problem Solving ,Search and Control
Strategies
General problem solving
Production System Control Strategies
Exhaustive Search
7/31/2019 Basic Comp 2
3/25
JSS/LEC006/ITT/R000/V001/DT 240704 3 /41
To solve a particular problem,we need to do: Define the problem precisely.
Analyze the problem.
Isolate and represent the task knowledgethat is necessary to solve the problem.
Choose the best problem solving technique(s)and apply it
General problem solving
NextPrevious
7/31/2019 Basic Comp 2
4/25
JSS/LEC006/ITT/R000/V001/DT 240704 4 /41
Production System
NextPrevious
Definition
It provides the structure to AI
programs in a way that facilitatesdescribing and performing the searchprocess.
7/31/2019 Basic Comp 2
5/25
JSS/LEC006/ITT/R000/V001/DT 240704 5 /41NextPrevious
A Production System consists of : A set of rule
A global database A control strategy
A rule applier
Production Systems
7/31/2019 Basic Comp 2
6/25
JSS/LEC006/ITT/R000/V001/DT 240704 6 /41NextPrevious
The process of solving the problem canbe modeled as a production system
Production System
7/31/2019 Basic Comp 2
7/25
JSS/LEC006/ITT/R000/V001/DT 240704 7 /41NextPrevious
The categories of the productionsystems:-
Monotonic Production System
Nonmonotonic Production System
Partially Commutative Production System
Commutative Production System
The production system
7/31/2019 Basic Comp 2
8/25
JSS/LEC006/ITT/R000/V001/DT 240704 8 /41NextPrevious
To solve a problem it is necessary totake a decision that which rule toapply next during the process of
searching for a solution to a problem
Control Strategies
7/31/2019 Basic Comp 2
9/25
JSS/LEC006/ITT/R000/V001/DT 240704 9 /41NextPrevious
Control Strategies
The first requirement of a good controlstrategy is that it cause motion
The second requirement of a good control
strategy is that it be systematic
7/31/2019 Basic Comp 2
10/25
JSS/LEC006/ITT/R000/V001/DT 240704 10 /41NextPrevious
control strategies
some basic elements:
Assertions(facts):Each a predicate calculus sentence with no
variables and no connectives other than not.
example
A ball is on a blockA pyramid is above the ball.
7/31/2019 Basic Comp 2
11/25
JSS/LEC006/ITT/R000/V001/DT 240704 11 /41NextPrevious
Goal:
Either a sentence with no variables and noconnectives, in which case the goal is to prove thatit is true (inferrable from the facts and the rules),
or an existentially qualified sentence whose variablesare to be assigned values (if possible) given thefacts and the rules.
Example of Goals
Is the pyramid above the block?What's above the block?
Control Strategies
7/31/2019 Basic Comp 2
12/25
JSS/LEC006/ITT/R000/V001/DT 240704 12 /41NextPrevious
control strategies
RulesEach a universally qualified implication with a
conjunction of sentences as antecedent and a singlesentence as consequent.
example of rules:
If something is on something, it's alsoabove it.
If a is above b, b is below a.
If b is above c and a is above b, then a isabove
7/31/2019 Basic Comp 2
13/25
JSS/LEC006/ITT/R000/V001/DT 240704 13 /41NextPrevious
inference engine
A rule-based system requires some kind of programto manipulate the rules - for example to decide
which ones are ready to fire. (i.e. which oneshave conditions that match the contents ofworking memory). The program that does this iscalled an inference engine, because in many rule-
based systems, the task of the system is toinfer something, e.g. a diagnosis, from the datausing the rules.
control strategies
http://www.cse.unsw.edu.au/~billw/aidict.htmlhttp://www.cse.unsw.edu.au/~billw/aidict.htmlhttp://www.cse.unsw.edu.au/~billw/aidict.htmlhttp://www.cse.unsw.edu.au/~billw/aidict.html7/31/2019 Basic Comp 2
14/25
JSS/LEC006/ITT/R000/V001/DT 240704 14 /41NextPrevious
forward chaining-An inference engineusing forward chaining searches the inferencerules until it finds one where the If clause isknown to be true. We use the data to decide
which rules can fire, then we fire one ofthose rules, which may add to the data inworking memory and then we repeat thisprocess until we establish a conclusion.
control strategies
http://en.wikipedia.org/wiki/Inference_enginehttp://www.cse.unsw.edu.au/~billw/aidict.htmlhttp://www.cse.unsw.edu.au/~billw/aidict.htmlhttp://www.cse.unsw.edu.au/~billw/aidict.htmlhttp://en.wikipedia.org/wiki/Inference_engine7/31/2019 Basic Comp 2
15/25
JSS/LEC006/ITT/R000/V001/DT 240704 15 /41
control strategies
Backward Chaining-An inference engine usingbackward chaining would search the inferencerules until it finds one which has a Then
clause that matches a desired goal. Inbackward chaining, we work back frompossible conclusions of the system to theevidence, using the rules backwards. Thus
backward chaining behaves in a goal-drivenmanner.
NextPrevious
7/31/2019 Basic Comp 2
16/25
JSS/LEC006/ITT/R000/V001/DT 240704 16 /41
Exhaustive Searches
Exhaustive Searches
Depth first search
Breadth first search
NextPrevious
7/31/2019 Basic Comp 2
17/25
JSS/LEC006/ITT/R000/V001/DT 240704 17 /41
exhaustive searches
Breadth first search:A complete breadth first search traversesevery node of the tree or graph, startingfrom the root node or starting node, first
processing, checking, or inspecting theroot/starting node. In future we'll just say it"processes" the node. Next it processes theneighbours of the root/starting node (in some
order), and then the neighbours of theneighbours, and so on, until all the nodeshave been processed.
NextPrevious
7/31/2019 Basic Comp 2
18/25
JSS/LEC006/ITT/R000/V001/DT 240704 18 /41
exhaustive searchesFor the tree shown below, the order of visiting for a
breadth first search would be: A B C D E F G H I J
A
B C
D E F G
H I J
NextPrevious
7/31/2019 Basic Comp 2
19/25
JSS/LEC006/ITT/R000/V001/DT 240704 19 /41
Exhaustive Searches
Depth First Search:
algorithm:
to depthFirstSearch a tree with root R
if tree is empty
then % we're finished
else
let N1, N2, ..., Nk be the neighbours of R
depthFirstSearch the subtree with root N1depthFirstSearch the subtree with rootN2
...
depthFirstSearch the subtree with root NkNextPrevious
7/31/2019 Basic Comp 2
20/25
JSS/LEC006/ITT/R000/V001/DT 240704 20 /41
Exhaustive Searches
For the tree shown below, the order of first visiting for adepth first search would be: A B D H E C F I G J
A
B C
D E F G
H I J
NextPrevious
7/31/2019 Basic Comp 2
21/25
JSS/LEC006/ITT/R000/V001/DT 240704 21 /41
Exhaustive Searches
Advantages of depth first search-
-> It requires less memory
-> It may find a solution withoutexamining much of the search space at all.
NextPrevious
7/31/2019 Basic Comp 2
22/25
JSS/LEC006/ITT/R000/V001/DT 240704 22 /41
Exhaustive searches
Next EndPrevious
Advantages of breadth first searches:-> It will not get trapped exploring blind
alley.
-> if there is a solution ,then it guaranteed
to find it.
7/31/2019 Basic Comp 2
23/25
JSS/LEC006/ITT/R000/V001/DT 240704 23 /41
Uses of Multimedia
Multimedia in BusinessMultimedia Databases
Creating powerful database that can store and
distribute digital media as text. This powerfuldatabases enable us to access any type ofmedia from the desktop
Next EndPrevious
(Click Here)
http://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.pps7/31/2019 Basic Comp 2
24/25
JSS/LEC006/ITT/R000/V001/DT 240704 24 /41
References
Books:-
Artificial intelligence by
Elaine Rich and Kevin Knightsites:-
http://www.cse.unsw.edu.au/~billw/aidict.html#depthfirst
Continue EndPrevious
http://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.ppshttp://../My%20Documents/lamib/Database.pps7/31/2019 Basic Comp 2
25/25
End of This Session
QuitPrevious