Select Page

Forward Chaining is the process which works on the basis of available data to make certain decisions. Forward chaining is the process of chaining data in the forward direction. In forward chaining, we start with the available data and use inference rules to extract data until the goal is not reached. Forward chaining is the concept of data and decision. From the available data, expand until a decision is not made.

In artificial intelligence, we have two different methods to use forward chaining.

• Forward Chaining in Propositional Logic
• Forward Chaining in Predicate Logic/(FOPL)

We will discuss both one by one

### Forward Chaining in Propositional Logic

In propositional logic, forward chaining starts its journey from the given knowledge base. If all the premises of the implication are known, then its conclusion will be added to the set of known facts.

We use the below forward chaining algorithm to perform the forward chaining.

Conclusions drawn from the above algorithm:

• Forward Chaining is sound as every inference is necessarily an application of Modus Ponen.
• Forward Chaining is complete as all atomic sentences will be derived from it.

Let’s see an example:

1. If D barks and D eats bone, then D is a dog.
2. If V is cold and V is sweet, then V is ice-cream.
3. If D is a dog, then D is black.
4. If V is ice-cream, then it is Vanilla.

Derive forward chaining using the given known facts to prove Tomy is black.

• Tomy barks.
• Tomy eats bone.

Solution: Given Tomy barks.

From (1), it is clear:

If Tomy barks and Tomy eats bone, then Tomy is a dog.

From (3), it is clear:

If Tomy is a dog, then Tomy is black.

Hence, it is proved that Tomy is black.

Note: There is an advantage of forward chaining that is, we can draw new inference from the given facts.

### Forward Chaining in Predicate Logic/ FOPL

Forward Chaining in Predicate Logic is different from forward chaining in Propositional Logic. In FOPL, forward chaining is efficiently implemented on first-order clauses. First-order clauses are the disjunction of literals of which exactly one is positive.

For example, Crow(x) ? Thrust(x)?Water(x).

Crow(x).

Thrust(x).

Therefore, a definite clause is either atomic or an implication whose predecessor is a conjunction of positive literals. As a result, it results in a single positive literal.

The forward chaining algorithm used in FOPL is:

Conclusions drawn:

• Forward Chaining in FOPL is sound as each inference is an application of Generalized Modus Ponen.
• It is complete as it answers each query.

Let’s see an example of Forward Chaining in FOPL

Consider the below axioms:

1. Gita loves all types of clothes.
2. Suits are clothes.
3. Jackets are clothes.
4. Anything any wear and isn’t bad is clothes.
5. Sita wears skirt and is good.
6. Renu wears anything Sita wears.

Apply backward chaining and prove that Gita loves Kurtis.

Solution: Convert the given axioms into FOPL as:

1. x: clothes(x)?loves(Gita, x).
2. Suits(x)?Clothes(x).
3. Jackets(x)?Clothes(x).
5. wears(Sita,skirt) ? ¬good(Sita)
6. wears(Sita,x)?wears(Renu,x)

To prove: Gita loves Kurtis.

FOPL: loves(Gita, Kurtis).

On applying forward chaining in the below graph:

Thus, it is proved that Gita loves Kurtis.