Intelligence Artificial

Unit IV Search and Constraint Satisfaction

Powerpoint Templates Page 1

Introduction
The constraint satisfaction problem is a special type of problems that satisfy some additional properties. Restrictions may involve one or more variables simultaneously. Sometimes these problems should make a check to detect forward unresolved states. Many times it is appropriate to analyze the variable narrower, ie assign a value to the variable that is involved in as many restrictions
Powerpoint Templates Page 2

Problems and State Spaces

A problem is defined by: - State initial set of operators, predicate goal path cost function - Solution - Way of the initial state-a state that satisfies the goal predicate

State Space -The set of all states reachable from the initial state by any sequence of operators
Powerpoint Templates Page 3

Powerpoint Templates

Page 4

Deterministic state space and no - Deterministic

A system is deterministic if, for a given state, at least one rule applies to it and only one way. Example: AFD

Powerpoint Templates

Page 5

Deterministic state space and no - Deterministic

A system is deterministic if not, more than one rule applies to any particular state of the system, or if a rule applies to a particular state of the system in more than one way.

Powerpoint Templates

Page 6

Systematic Search
Depending on the method of expansion of a state space and consequently the order of the states visited search problems are named different:

- Search Targets in width - Goals-depth search - Optimal search

Powerpoint Templates

Page 7

Search Targets in width

This approach involves traversing a tree depth rather than width. width algorithm starts by examining all nodes in a level (sometimes called strand one) below the root node.

Powerpoint Templates

Page 8

Goals-depth search
The most widely used algorithm is the search for deep targets. It is so called because it follows every way to its greater depth before moving to the next track.

Powerpoint Templates

Page 9

Goals-depth search
Assuming you start from the left and right work, finding deep targets for all roads involves working under the tree path to the left until a leaf node is reached. If this is a goal state, the search is completed and reported as successful. If the leaf node is not the target state, the search goes back and up to the next

Powerpoint Templates

Page 10

Optimal Search
The heuristic search usually works for two different types of problems: -Forward reasoning -Backward reasoning

Powerpoint Templates

Page 11

Optimal Search
In a forward reasoning problem, we move toward the goal of state from a predefined initial state while a backward reasoning problem, we move from an initial state to a final state goal.

Powerpoint Templates

Page 12

Optimal Search
while a backward reasoning problem, we move from an initial state to a final state goal.

Powerpoint Templates

Page 13

Constraint satisfaction
The constraint satisfaction is assigning values to a set of variables to satisfy given constraints. In Constraint Satisfaction Problems (PSR), the states and the goal test following a standard representation, structured and very simple. Definition: network restrictions P = (X, D, C) X = {X1, X2,. . ., Xn} variables D = {D1, D2,. . ., Dn} domains C = {C1, C2,. . ., Ce} restrictions
Powerpoint Templates Page 14

Troubleshooting Game
We define problem solving as the process starting from some initial data and using a set of selected procedures, is able to determine the set of steps or elements that lead us to what we will call an optimal solution or semioptimal problem planning, discovering a winning strategy game, prove a theorem, recognize.

Powerpoint Templates

Page 15

Troubleshooting Game
One big advantage that gives us the use of games is that through them you can easily measure the success or failure, so we can see if the techniques and algorithms used are optimal.

Powerpoint Templates

Page 16

Tanks you very much!!!

Powerpoint Templates

Page 17