Forward Chaining and backward chaining in

AI
In artificial intelligence, forward and backward chaining is one of the important topics, but
before understanding forward and backward chaining lets first understand that from where these
two terms came.

Inference engine:
The inference engine is the component of the intelligent system in artificial intelligence, which
applies logical rules to the knowledge base to infer new information from known facts. The first
inference engine was part of the expert system. Inference engine commonly proceeds in two
modes, which are:

1. Forward chaining
2. Backward chaining

Horn Clause and Definite clause:

Horn clause and definite clause are the forms of sentences, which enables knowledge base to use
a more restricted and efficient inference algorithm. Logical inference algorithms use forward and
backward chaining approaches, which require KB in the form of the first-order definite clause

Definite clause: A clause which is a disjunction of literals with exactly one positive literal is
known as a definite clause or strict horn clause.

Horn clause: A clause which is a disjunction of literals with at most one positive literal is
known as horn clause. Hence all the definite clauses are horn clauses.

Example: (¬ p V ¬ q V k). It has only one positive literal k.

It is equivalent to p ∧ q → k.

Inference with Horn clauses can be done through the forward chaining and
backward chaining algorithms, which we explain next. Both of these algorithms
are very natural, in that the inference steps are obvious and easy to follow for
humans.

A. Forward Chaining
Forward chaining is also known as a forward deduction or forward reasoning method when using an
inference engine. Forward chaining is a form of reasoning which start with atomic sentences in the
knowledge base and applies inference rules (Modus Ponens) in the forward direction to extract more
data until a goal is reached

The Forward-chaining algorithm starts from known facts, triggers all rules whose premises are
satisfied, and add their conclusion to the known facts. This process repeats until the problem is
solved.

Properties of Forward-Chaining:

 It is a down-up approach, as it moves from bottom to top.

 It is a process of making a conclusion based on known facts or data, by starting from the
initial state and reaches the goal state.
 Forward-chaining approach is also called as data-driven as we reach to the goal using
available data.
 Forward -chaining approach is commonly used in the expert system, such as CLIPS,
business, and production rule systems.

Example:

"As per the law, it is a crime for an American to sell weapons to hostile nations. Country A,
an enemy of America, has some missiles, and all the missiles were sold to it by Robert, who
is an American citizen."

Prove that "Robert is criminal."

To solve the above problem, first, we will convert all the above facts into first-order definite
clauses, and then we will use a forward-chaining algorithm to reach the goal.

Facts Conversion into FOL:

 It is a crime for an American to sell weapons to hostile nations. (Let's say p, q, and r are
variables)
American (p) ∧ weapon(q) ∧ sells (p, q, r) ∧ hostile(r) → Criminal(p)       ...(1)
 Country A has some missiles. ?p Owns(A, p) ∧ Missile(p). It can be written in two definite
clauses by using Existential Instantiation, introducing new Constant T1.
Owns(A, T1)             ......(2)
Missile(T1)             .......(3)
 All of the missiles were sold to country A by Robert.
?p Missiles(p) ∧ Owns (A, p) → Sells (Robert, p, A)       ......(4)
 Missiles are weapons.
Missile(p) → Weapons (p)             .......(5)
 Enemy of America is known as hostile.
Enemy(p, America) →Hostile(p)             ........(6)
 Country A is an enemy of America.
Enemy (A, America)             .........(7)
  Robert is American
American(Robert).             ..........(8)

Forward chaining proof:

Step-1:

In the first step we will start with the known facts and will choose the sentences which do not
have implications, such as: American(Robert), Enemy(A, America), Owns(A, T1), and
Missile(T1). All these facts will be represented as below.

Forward chaining proof:

Step-1:

In the first step we will start with the known facts and will choose the sentences which do not
have implications, such as: American(Robert), Enemy(A, America), Owns(A, T1), and
Missile(T1). All these facts will be represented as below.
Step-3:

At step-3, as we can check Rule-(1) is satisfied with the substitution {p/Robert, q/T1, r/A}, so
we can add Criminal(Robert) which infers all the available facts. And hence we reached our
goal statement.

B. Backward Chaining:
Backward-chaining is also known as a backward deduction or backward reasoning method when
using an inference engine. A backward chaining algorithm is a form of reasoning, which starts
with the goal and works backward, chaining through rules to find known facts that support the
goal.

Properties of backward chaining:

  It is known as a top-down approach.
 Backward-chaining is based on modus ponens inference rule.
 In backward chaining, the goal is broken into sub-goal or sub-goals to prove
the facts true.
 It is called a goal-driven approach, as a list of goals decides which rules are
selected and used.
 Backward -chaining algorithm is used in game theory, automated theorem
proving tools, inference engines, proof assistants, and various AI
applications.
 The backward-chaining method mostly used a depth-first search strategy
for proof.

Example:

In backward-chaining, we will use the same above example, and will

rewrite all the rules.
Backward-chaining is also known as a backward deduction or backward reasoning method when
using an inference engine. A backward chaining algorithm is a form of reasoning, which starts
with the goal and works backward, chaining through rules to find known facts that support the
goal.

Properties of backward chaining:

 It is known as a top-down approach.

 Backward-chaining is based on modus ponens inference rule.
 In backward chaining, the goal is broken into sub-goal or sub-goals to prove the facts true.
 It is called a goal-driven approach, as a list of goals decides which rules are selected and used.
 Backward -chaining algorithm is used in game theory, automated theorem proving tools,
inference engines, proof assistants, and various AI applications.
 The backward-chaining method mostly used a depth-first search strategy for proof.

Example:

In backward-chaining, we will use the same above example, and will rewrite all the rules.

 American (p) ∧ weapon(q) ∧ sells (p, q, r) ∧ hostile(r) → Criminal(p) ...(1)

Owns(A, T1)                 ........(2)
 Missile(T1)
 ?p Missiles(p) ∧ Owns (A, p) → Sells (Robert, p, A)           ......(4)
 Missile(p) → Weapons (p)                 .......(5)
 Enemy(p, America) →Hostile(p)                 ........(6)
 Enemy (A, America)                 .........(7)
 American(Robert).                 ..........(8)

Backward-Chaining proof:
 In Backward chaining, we will start with our goal predicate, which is Criminal(Robert),
and then infer further rules.
 Step-1:
 At the first step, we will take the goal fact. And from the goal fact, we will infer other
facts, and at last, we will prove those facts true. So our goal fact is "Robert is Criminal,"
so following is the predicate of it.


 Step-2:
 At the second step, we will infer other facts form goal fact which satisfies the rules. So as
we can see in Rule-1, the goal predicate Criminal (Robert) is present with substitution
{Robert/P}. So we will add all the conjunctive facts below the first level and will replace
p with Robert.
 Here we can see American (Robert) is a fact, so it is proved here.


 Step-3:t At step-3, we will extract further fact Missile(q) which infer from Weapon(q), as
it satisfies Rule-(5). Weapon (q) is also true with the substitution of a constant T1 at q.

 Step-4:
 At step-4, we can infer facts Missile(T1) and Owns(A, T1) form Sells(Robert, T1, r)
which satisfies the Rule- 4, with the substitution of A in place of r. So these two
statements are proved here.

 Step-5:
 At step-5, we can infer the fact Enemy(A, America) from Hostile(A) which satisfies
Rule- 6. And hence all the statements are proved true using backward chaining.
Difference between backward chaining and forward chaining

Following is the difference between the forward chaining and backward chaining:

 Forward chaining as the name suggests, start from the known facts and move forward by
applying inference rules to extract more data, and it continues until it reaches to the goal,
whereas backward chaining starts from the goal, move backward by using inference rules to
determine the facts that satisfy the goal.
 Forward chaining is called a data-driven inference technique, whereas backward chaining is
called a goal-driven inference technique.
 Forward chaining is known as the down-up approach, whereas backward chaining is known as a
top-down approach.
 Forward chaining uses breadth-first search strategy, whereas backward chaining uses depth-
first search strategy.
 Forward and backward chaining both applies Modus ponens inference rule.
 Forward chaining can be used for tasks such as planning, design process monitoring, diagnosis,
and classification, whereas backward chaining can be used for classification and diagnosis
tasks.
 Forward chaining can be like an exhaustive search, whereas backward chaining tries to avoid the
unnecessary path of reasoning.
 In forward-chaining there can be various ASK questions from the knowledge base, whereas in
backward chaining there can be fewer ASK questions.
 Forward chaining is slow as it checks for all the rules, whereas backward chaining is fast as it
checks few required rules only.
 S. Forward Chaining Backward Chaining
No.
Forward chaining starts from known facts and Backward chaining starts from the goal and works
1. applies inference rule to extract more data backward through inference rules to find the
unit it reaches to the goal. required facts that support the goal.

2. It is a bottom-up approach It is a top-down approach

Forward chaining is known as data-driven Backward chaining is known as goal-driven

3. inference technique as we reach to the goal technique as we start from the goal and divide into
using the available data. sub-goal to extract the facts.

Forward chaining reasoning applies a breadth- Backward chaining reasoning applies a depth-first
4.
first search strategy. search strategy.

Forward chaining tests for all the available Backward chaining only tests for few required
5.
rules rules.

Forward chaining is suitable for the planning,

Backward chaining is suitable for diagnostic,
6. monitoring, control, and interpretation
prescription, and debugging application.
application.

Forward chaining can generate an infinite Backward chaining generates a finite number of
7.
number of possible conclusions. possible conclusions.

8. It operates in the forward direction. It operates in the backward direction.

Backward chaining is only aimed for the required

9. Forward chaining is aimed for any conclusion.
data.