In forward reasoning, reasoning proceeds forward, beginning with factor, chaining through rules and finally establishing the goal.
Forward
and Backward Reasoning
•
In forward reasoning, reasoning proceeds forward,
beginning with factor, chaining through rules and finally establishing the
goal.
• When the left side of a sequence of rules is instantiated first and the rules are executed from left to right the process is called forward chaining/reasoning. This is also known as data-driven search, since, input data are used to guide the direction of the inference process. For example, one can chain forward to show that when a student is encouraged, is healthy, and has goals, the student will succeed.
ENCOURAGED
(student) → MOTIVATED (students)
MOTIVATED
(student) and HEALTHY (student) → WORKHARD (student)
WORKHARD
(student) and HASGOALS (student) → EXCELL (student)
EXCELL
(student) → SUCCEED (student)
•
On the other hand, when the right side of the rule is
instantiated first, the left-hand conditions become subgoals. These subgoals
may in turn cause sub-subgoals to be established, and so on until facts are
found to match the lowest subgoal conditions. When this form of inference takes
place, it is said that backward chaining is performed. This form of inference
is also known as goal-driven inference since an initial goal establishes the
backward direction of the inferring.
For
example, in MYCIN the initial goal in a consultation is "Does the patient
have a certain disease?" This causes subgoals to be established such as
"are certain bacteria present in the patient?" Determining if certain
bacteria are present may require such things as tests on cultures taken from
the patient. This process of setting up subgoals to confirm a goal continues
until all the subgoals are eventually satisfied or fail. If satisfied, the
backward chain is established thereby confirming the main goal.
•
Some systems use both forward and backward
chaining/reasoning, depending on the type of problem and the information
available. Likewise rules may be tested or exhaustively or selectively,
depending on the control structure.
Solved
Example
Example
7.5.1 Consider an incandescent bulb
manufacturing unit. Here machines M1, M2 and M3
make 30 %, 30 % and 40% of the total bulbs of their, output, let's assume that
2 %, 3 % and 4 % are defective. A bulb is drawn at random and is found
defective. What is the probability that the bulb is made by machine M1
or M2 or M3.
Solution:
•
Let E1, E2 and E3 be
the events that a bulb selected at random is made by machine M1, M2
and M3.
• Let Q denote that it is defective.
Prob (E1) = 0.3
Prob (E2) = 0.3 and Prob (E3) = 0.4 (given data),
These
represent the prior probabilities.
•
Probability of drawing a defective bulb made by M1
= Prob (Q/E1) = 0.02
•
Probability of drawing a defective bulb made by M2
= Prob (Q/E2) = 0.03
•
Probability of drawing a defective bulb made by M3
= Prob (Q/E3) = 0.04
•These values are the posterior probabilities
Therefore,
Prob
(E1/Q) = Prob (E1/) * Prob (Q/E1)/ Σ3i=1
Prob (Ei) * Prob (Q/Ei)
= 0.3*
0.02/ (0.03* 0.2) + (0.03* 0.3) + (0.04 * 0.4)
=
0.1935
Similarly,
Prob
(E2/Q) = 0.3* 0.03/ (0.03* 0.2) + (0.03* 0.3) + (0.04* 0.4)
=
0.2903
Prob
(E3/Q) = (1-(Prob(E1/Q) + Prob(E2/Q)))
=
(1-((0.1935) (0.2903)))
Artificial Intelligence and Machine Learning: Unit II: Probabilistic Reasoning : Tag: : Probabilistic Reasoning - Artificial Intelligence and Machine Learning - Forward and Backward Reasoning
Artificial Intelligence and Machine Learning
CS3491 4th Semester CSE/ECE Dept | 2021 Regulation | 4th Semester CSE/ECE Dept 2021 Regulation