Forward chaining

Forward chaining (or forward reasoning) is one of the two main methods of reasoning when using an inference engine and can be described logically as repeated application of modus ponens. Forward chaining is a popular implementation strategy for expert systems, business and production rule systems. The opposite of forward chaining is backward chaining. Forward chaining starts with the available data and uses inference rules to extract more data (from an end user, for example) until a goal is reached. An inference engine using forward chaining searches the inference rules until it finds one where the antecedent (If clause) is known to be true. When such a rule is found, the engine can conclude, or infer, the consequent (Then clause), resulting in the addition of new information to its data. Inference engines will iterate through this process until a goal is reached. Suppose that the goal is to conclude the color of a pet named Fritz, given that he croaks and eats flies, and that the rule base contains the following four rules: If X croaks and X eats flies - Then X is a frog If X chirps and X sings - Then X is a canary If X is a frog - Then X is green If X is a canary - Then X is blue Let us illustrate forward chaining by following the pattern of a computer as it evaluates the rules. Assume the following facts: Fritz croaks Fritz eats flies With forward reasoning, the inference engine can derive that Fritz is green in a series of steps:

Since the base facts indicate that "Fritz croaks" and "Fritz eats flies", the antecedent of rule #1 is satisfied by substituting Fritz for X, and the inference engine concludes: Fritz is a frog
The antecedent of rule #3 is then satisfied by substituting Fritz for X, and the inference engine concludes: Fritz is green The name "forward chaining" comes from the fact that the inference engine starts with the data and reasons its way to the answer, as opposed to backward chaining, which works the other way around. In the derivation, the rules are used in the opposite order as compared to backward chaining.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (11)

Related courses (1)

Related lectures (9)

CS-330: Artificial intelligence

Introduction aux techniques de l'Intelligence Artificielle, complémentée par des exercices de programmation qui montrent les algorithmes et des exemples de leur application à des problèmes pratiques.

Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal. It is used in automated theorem provers, inference engines, proof assistants, and other artificial intelligence applications. In game theory, researchers apply it to (simpler) subgames to find a solution to the game, in a process called backward induction. In chess, it is called retrograde analysis, and it is used to generate table bases for chess endgames for computer chess.

In the field of artificial intelligence, an inference engine is a component of the system that applies logical rules to the knowledge base to deduce new information. The first inference engines were components of expert systems. The typical expert system consisted of a knowledge base and an inference engine. The knowledge base stored facts about the world. The inference engine applies logical rules to the knowledge base and deduced new knowledge. This process would iterate as each new fact in the knowledge base could trigger additional rules in the inference engine.

Expert Systems: Backward Chaining CS-330: Artificial intelligence

Explores expert systems, backward chaining, and uncertainty through fuzzy logic in practical applications.

Brain region atlases: Evolution MOOC: Selected chapters form winterschool on multi-scale brain

Explores the evolution of brain region atlases through connectivity-based parcellation and cluster formation criteria.

Inference Engines: Resolution and Horn Clauses CS-330: Artificial intelligence

Covers inference engines based on resolution, Horn clauses, filtering, and unification in artificial intelligence.