Abstract
Forward chaining is an inference algorithm based on modus ponens which is widely used but unfortunately incomplete with respect to the usual boolean logic. A solution to this incompleteness is to compile the knowledge base so that forward chaining becomes complete for any base of facts. This compilation is called achievement and was so far restricted to propositional calculus. In this paper, we extend this compilation method to the predicate calculus. To our knowledge, this is the first exact knowledge compilation for first order logic.
Cite
CITATION STYLE
Roussel, O., & Mathieu, P. (1997). Exact knowledge compilation in predicate calculus: The partial achievement case. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1249, pp. 161–175). Springer Verlag. https://doi.org/10.1007/3-540-63104-6_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
