# How is forward chaining complete?

Can anyone explain why forward chaining is complete? The AIMA proof went over my head. I understood the working of the algorithm and how we finally have an inferred set of all atomic sentences in the KB and the additional sentences inferred but I don't see why this should prove all entailed sentences.

From AIMA:

It is easy to see that forward chaining is sound: every inference is essentially an application of Modus Ponens. Forward chaining is also complete: every entailed atomic sentence will be derived. The easiest way to see this is to consider the final state of the inferred table (after the algorithm reaches a fixed point where no new inferences are possible). The table contains true for each symbol inferred during the process, and false for all other symbols. We ◮ can view the table as a logical model; moreover, every definite clause in the original KB is true in this model. To see this, assume the opposite, namely that some clause a1 ∧... ∧ ak ⇒ b is false in the model. Then a1 ∧ ... ∧ak must be true in the model and b must be false in the model. But this contradicts our assumption that the algorithm has reached a fixed point, because we would now be licensed to add b to the KB. We can conclude, therefore, that the set of atomic sentences inferred at the fixed point defines a model of the original KB. Furthermore, any atomic sentence q that is entailed by the KB must be true in all its models and in this model in particular. Hence, every entailed atomic sentence q must be inferred by the algorithm.