A new method for knowledge compilation: The achievement by cycle search

  • Olivier Roussel
  • Philippe Mathieu
Session 7A
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1104)


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.


knowledge compilation expert systems resolution 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ber73]
    C. Berge, Graphes et hypergraphes, Dunod, Paris, 1973Google Scholar
  2. [CL73]
    Chin-Liang Chang and Richard Char-Tung Lee, Symbolic logic and mechanical theorem proving, Academic Press, 1973Google Scholar
  3. [Esh93]
    Kave Eshghi, A Tractable Class of Abduction Problems in Proceedings of the 30th International Joint Conference of Artificial Intelligence, pp 3–8, 1993Google Scholar
  4. [FdK93]
    Kenneth D. Forbus and Johan de Kleer, Building Problem Solvers, MIT Press, 1993Google Scholar
  5. [Kow75]
    Robert Kowalski, A Proof Procedure Using Connection Graphs, Journal of the Association for Computing Machinery, vol. 22, no. 4, pp 572–595, 1975Google Scholar
  6. [Lov78]
    Donald W. Loveland, Automated Theorem Proving: A logical Basis, North Holland Publishing Company, Amsterdam, 1978Google Scholar
  7. [Mat91]
    Ph. Mathieu, L'utilisation de la logique trivaluée dans les systèmes experts, PhD Thesis, Université de Lille 1, France, 1991Google Scholar
  8. [MD90]
    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., 1990Google Scholar
  9. [MD94a]
    P. Mathieu and J.P. Delahaye, A kind of logical compilation for knowledge bases, Theoretical Computer Science 131, 1994, pp 197–218CrossRefGoogle Scholar
  10. [MD94b]
    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., 1994Google Scholar
  11. [RM95]
    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., 1995Google Scholar
  12. [RM96]
    Olivier Roussel and Philippe Mathieu, L'achèvement par cycles des bases de connaissances, Internal Publication IT-287, LIFL, FranceGoogle Scholar
  13. [Val94]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Olivier Roussel
    • 1
  • Philippe Mathieu
    • 1
  1. 1.CNRS URA 369, USTL bât. M3LIFLVilleneuve d'Ascq CedexFrance

Personalised recommendations