Abstract
Forward chaining is an algorithm that is particularly simple, and therefore used in many inference systems. It computes the facts that are the consequences of a set of facts and rules. Unfortunately, this algorithm is not complete with respect to negation.
To solve this problem, it is possible, in the context of propositional calculus, to automatically add the rules needed to make forward chaining complete. This transformation is a logical compilation of knowledge bases.
This article presents a new method, based on a cycle search in a graph associated to the set of rules to compile, which allows a precise identification of what is needed for completeness.
This work is supported by the Conseil Régional Nord-Pas-de-Calais and the CNRS as part of the GANYMEDE II project
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Berge, Graphes et hypergraphes, Dunod, Paris, 1973
Chin-Liang Chang and Richard Char-Tung Lee, Symbolic logic and mechanical theorem proving, Academic Press, 1973
Kave Eshghi, A Tractable Class of Abduction Problems in Proceedings of the 30th International Joint Conference of Artificial Intelligence, pp 3–8, 1993
Kenneth D. Forbus and Johan de Kleer, Building Problem Solvers, MIT Press, 1993
Robert Kowalski, A Proof Procedure Using Connection Graphs, Journal of the Association for Computing Machinery, vol. 22, no. 4, pp 572–595, 1975
Donald W. Loveland, Automated Theorem Proving: A logical Basis, North Holland Publishing Company, Amsterdam, 1978
Ph. Mathieu, L'utilisation de la logique trivaluée dans les systèmes experts, PhD Thesis, Université de Lille 1, France, 1991
P. Mathieu and J.P. Delahaye, The logical compilation of knowledge bases, in Proc. of JELIA'90, Amsterdam 1990, LNAI, vol. 478, pp 386–398, Springer-Verlag ed., 1990
P. Mathieu and J.P. Delahaye, A kind of logical compilation for knowledge bases, Theoretical Computer Science 131, 1994, pp 197–218
P. Mathieu and J.P. Delahaye, A Kind of Achievement by Parts Method, in Proc. of LPAR'94, Kiev 1994, LNAI, vol. 822, pp 320–322, Springer-Verlag ed., 1994
Olivier Roussel and Philippe Mathieu, Evaluation des méthodes d'achèvement par parties, in the proceedings of JFPL'95, Dijon 1995, pp 175–189, Teknea ed., 1995
Olivier Roussel and Philippe Mathieu, L'achèvement par cycles des bases de connaissances, Internal Publication IT-287, LIFL, France
Alvaro del Val, Tractable Databases: How to Make Propositional Unit Resolution Complete through Compilation, in the proceedings of KR'94, Bonn 1994, pp 551–561.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roussel, O., Mathieu, P. (1996). A new method for knowledge compilation: The achievement by cycle search. In: McRobbie, M.A., Slaney, J.K. (eds) Automated Deduction — Cade-13. CADE 1996. Lecture Notes in Computer Science, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61511-3_109
Download citation
DOI: https://doi.org/10.1007/3-540-61511-3_109
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61511-8
Online ISBN: 978-3-540-68687-3
eBook Packages: Springer Book Archive