Summary: Forward chaining cannot compute the two-valued consequence literals of a knowledge base (i.e. set of rules) with negations. If the user wants to compute them, he must use a particular algorithm which often takes a lot of time. We propose a compilation system of knowledge bases what we call logical compilation, which allows us to compute the two-valued consequence literals of a knowledge base (i.e. set of rules) using a forward chaining on the compiled base with any extensional knowledge base (i.e. set of basic facts added to knowledge base). Then we present several methods with their benefits to make this compilation. Finally we use this compilation in a wide propositional calculus and solve the ‘or’ problem in rule conclusion.
For the entire collection see [Zbl 0768.00012].