Definition of Backward chaining

FOLDOC
backward chaining
<algorithm> An algorithm for proving a goal by recursively breaking it down into sub-goals and trying to prove these until facts are reached. Facts are goals with no sub-goals which are therefore always true. Backward training is the program execution mechanism used by most logic programming language like Prolog.
Opposite: forward chaining.
(2004-01-26)

Search Dictionary:
Search Web Search Dictionary



Backward chaining definition was found in categories: Language, Idioms & Slang(1)  Encyclopedia(1)  

Backward chaining Definition from Language, Idioms & Slang Dictionaries & Glossaries

hEnglish - advanced version
backward chaining

backward chaining
an algorithm for proving a goal by recursively braking it down into sub-goals and trying to prove these until facts are reached. facts are goals with no sub-goals which are therefore always true. backward training is the program execution mechanism used by most logic programming language like prolog.



Backward chaining Definition from Encyclopedia Dictionaries & Glossaries

Wikipedia English - The Free Encyclopedia
Backward chaining
Backward chaining is one of the two main methods of reasoning when using inference rules. The other is forward chaining.

Backward chaining starts with a list of goals (or a hypothesis) and works backwards from the consequent to the antecedent to see if there is data available that will support any of these consequents. An inference engine using backward chaining would search the inference rules until it finds one which has a consequent (Then clause) that matches a desired goal. If the antecedent (If clause) of that rule is not known to be true, then it is added to the list of goals (in order for your goal to be confirmed you must also provide data that confirms this new rule).


See more at Wikipedia.org...