A kind of logical compilation for knowledge bases

AbstractThe forward chaining algorithm is perhaps the best-known algorithm in expert systems. However, it is not complete because it cannot compute the two-valued consequence literals of a propositional 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 much time. We propose a compilation system for knowledge bases, which 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. We also use this compilation in a wide propositional calculus and solve the “or” problem in rule conclusion. We present several methods with their benefits to make this compilation and we give properties on knowledge bases to avoid this compilation. Finally, we give a theorem which defines incremental compilation