Chapter 5 Representing Knowledge Using Rules
Chapter 5 Representing Knowledge Using Rules
Prepared By:
Subject : AI
Asst. Prof. Twinkal Panchal
Code : 2180703 (CSE Department, ACET)
Procedural and Declarative Knowledge
1. Procedural Knowledge
• The Procedural knowledge is a type of knowledge where the
essential control information that is required to use the
information is integrated in the knowledge itself.
• It also used with an interpreter to employ the knowledge which
follows the instructions given in the knowledge.
2. Declarative Knowledge
• A Declarative knowledge is where only knowledge is
described but not the use to which the knowledge is employed
is not provided.
• So, in order to use this declarative knowledge, we need to add
it with a program that indicates what is to be done to the
knowledge and how it is to be done.
Difference the Procedural and Declarative
Knowledge
PROCEDURAL KNOWLEDGE DECLARATIVE KNOWLEDGE
It is also known as Interpretive It is also known as Descriptive
knowledge. knowledge.
Procedural Knowledge means how a While Declarative Knowledge means
particular thing can be accomplished basic knowledge about something.
Procedural Knowledge is generally not Declarative Knowledge is more
used means it is not more popular. popular.
Procedural Knowledge can’t be easily Declarative Knowledge can be easily
communicate. communicate
Procedural Knowledge is generally Declarative Knowledge is data
process oriented in nature oriented in nature.
In Procedural Knowledge debugging In Declarative Knowledge debugging
and validation is not easy. and validation is easy.
Forward Reasoning
• The solution of a problem generally includes the initial data
and facts in order to arrive at the solution. These unknown
facts and information is used to deduce the result
1. In the first step, the system is given one or more than one
constraints.
2. Then the rules are searched in the knowledge base for each
constraint. The rules that fulfill the condition are selected(i.e.,
IF part).
3. Now each rule is able to produce new conditions from the
conclusion of the invoked one. As a result, THEN part is
again included in the existing one.
4. The added conditions are processed again by repeating step 2.
The process will end if there is no new conditions exist.
Backward Reasoning
1. Firstly, the goal state and the rules are selected where the goal
state reside in the THEN part as the conclusion.
2. From the IF part of the selected rule the sub goals are made to
be satisfied for the goal state to be true.
3. Set initial conditions important to satisfy all the sub goals.
4. Verify whether the provided initial state matches with the
established states. If it fulfills the condition then the goal is
the solution otherwise other goal state is selected.
Difference between backward chaining and
forward chaining
Forward Chaining Backward Chaining
It starts from known facts and It starts from the goal and works
applies inference rule to extract backward through inference
more data unit it reaches to the rules to find the required facts
goal. that support the goal.
It is a bottom-up approach It is a top-down approach
It is known as data-driven It is known as goal-driven
inference technique as we reach technique as we start from the
to the goal using the available goal and divide into sub-goal to
data. extract the facts.
It applies a breadth-first search It applies a depth-first search
strategy. strategy.
It tests for all the available rules It tests only for few required
rules.
It is suitable for the planning, It is suitable for diagnostic,
monitoring, control, and prescription, and debugging
interpretation application. application.
It can generate an infinite It generates a finite number of
number of possible conclusions. possible conclusions.
It operates in the forward It operates in the backward
direction. direction.