Download Artificial Intelligence - Academic year 2016/2017

Document related concepts

Index of logic articles wikipedia , lookup

Nyaya wikipedia , lookup

Laws of Form wikipedia , lookup

Natural deduction wikipedia , lookup

Transcript
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.