Survey
* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project
Backward chaining For a given KB made up of Horn clauses, and a given atomic, non-negated sentence â, FC can be used to prove whether or not KB |= â. To this aim, one has to check whether â is present or not among the derived sentences. However, backward chaining (BC) is more effective to this goal. BC recursively applies MP âbackwardsâ. It exploits the fact that KB |= â, if and only if: I I either â Å KB (this terminates recursion) or KB contains some implication â1 , . . . , ân â â, and (recursively) KB |= â1 , . . . , KB |= ân The sentence â to be proven is also called query.