A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
A kind of logical compilation for knowledge bases
1994
Theoretical Computer Science
Mathieu, Ph. and J.-P. Delahaye, A kind of logical compilation for knowledge bases, Theoretical Computer Science 131 (1994) 197-218. The 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
doi:10.1016/0304-3975(94)90095-7
fatcat:5wcolosadngbreuwcl26eafrki