Sie sind auf Seite 1von 25

Artificial Intelligence Lecture 2

JSS/LEC006/ITT/R000/V001/DT 240704

/41

Problem Solving ,Search and Control Strategies


General problem solving Production System

Control Strategies
Exhaustive Search

Next
JSS/LEC006/ITT/R000/V001/DT 240704

End

/41

General problem solving


To solve a particular problem,we need to do: Define the problem precisely. Analyze the problem. Isolate and represent the task knowledge that is necessary to solve the problem. Choose the best problem solving technique(s) and apply it

Previous
JSS/LEC006/ITT/R000/V001/DT 240704

Next
3 /41

Production System

Definition
It provides the structure to AI programs in a way that facilitates describing and performing the search process.

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

/41

Production Systems
A Production System consists of :

A set of rule
A global database

A control strategy
A rule applier

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

/41

Production System
The process of solving the problem can be modeled as a production system

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

/41

The production system


The categories systems:Monotonic

of

the

production

Production System

Nonmonotonic Partially

Production System

Commutative Production System

Commutative

Production System
Previous Next

JSS/LEC006/ITT/R000/V001/DT 240704

/41

Control Strategies
To solve a problem it is necessary to take a decision that which rule to apply next during the process of searching for a solution to a problem

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

/41

Control Strategies
The first requirement of a strategy is that it cause motion The second requirement of a strategy is that it be systematic good good control control

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

/41

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 block A pyramid is above the ball.

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

10

/41

Control Strategies
Goal:

Either a sentence with no variables and no connectives, in which case the goal is to prove that it is true (inferrable from the facts and the rules), or an existentially qualified sentence whose variables are to be assigned values (if possible) given the facts and the rules.
Example of Goals

Is the pyramid above the block? What's above the block?

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

11

/41

control strategies

Rules
Each a universally qualified implication with a conjunction of sentences as antecedent and a single sentence as consequent. example of rules:

If something is on something, it's also above it. If a is above b, b is below a.


above

If b is above c and a is above b, then a is

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

12

/41

control strategies
inference engine
A rule-based system requires some kind of program to manipulate the rules - for example to decide which ones are ready to fire. (i.e. which ones have conditions that match the contents of working memory). The program that does this is called an inference engine, because in many rulebased systems, the task of the system is to infer something, e.g. a diagnosis, from the data using the rules.

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

13

/41

control strategies
forward chaining-An inference engine
using forward chaining searches the inference rules until it finds one where the If clause is known to be true. We use the data to decide which rules can fire, then we fire one of those rules, which may add to the data in working memory and then we repeat this process until we establish a conclusion.

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

14

/41

control strategies
Backward Chaining-An inference engine using
backward chaining would search the inference rules until it finds one which has a Then clause that matches a desired goal. In backward chaining, we work back from possible conclusions of the system to the evidence, using the rules backwards. Thus backward chaining behaves in a goal-driven manner.

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

15

/41

Exhaustive Searches
Exhaustive Searches

Depth first search Breadth first search

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

16

/41

exhaustive searches
Breadth first search: A complete breadth first search traverses every node of the tree or graph, starting from the root node or starting node, first processing, checking, or inspecting the root/starting node. In future we'll just say it "processes" the node. Next it processes the neighbours of the root/starting node (in some order), and then the neighbours of the neighbours, and so on, until all the nodes have been processed.
Previous Next

JSS/LEC006/ITT/R000/V001/DT 240704

17

/41

exhaustive searches
For 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 D H E F I C G J

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

18

/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 N1 depthFirstSearch the subtree with root ... depthFirstSearch the subtree with root Nk
JSS/LEC006/ITT/R000/V001/DT 240704

N2

Previous

Next

19

/41

Exhaustive Searches
For the tree shown below, the order of first visiting for a depth first search would be: A B D H E C F I G J

A
B D H E F I C G J

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

20

/41

Exhaustive Searches
Advantages of depth first search-> It requires less memory -> It may find a solution without examining much of the search space at all.

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

21

/41

Exhaustive searches
Advantages of breadth first searches: -> It will not get trapped exploring blind alley. -> if there is a solution ,then it guaranteed

to find it.

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

End

22

/41

Uses of Multimedia
Multimedia

in Business

Multimedia Databases

Creating powerful database that can store and distribute digital media as text. This powerful databases enable us to access any type of media from the desktop

(Click Here)

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Next

End

23

/41

References
Books:Artificial intelligence by
Elaine Rich and Kevin Knight

sites:http://www.cse.unsw.edu.au/~billw/aidict.html#dep thfirst

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Continue

End

24

/41

End of This Session

JSS/LEC006/ITT/R000/V001/DT 240704

Previous

Quit

25

/41

Das könnte Ihnen auch gefallen