Efficiency considerations on goal-directed forward chaining for logic programs

  • Wolfram Burgard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 533)


This paper presents a linear resolution strategy (GDFC-resolution) for definite logic programs in which goal-directed forward chaining is used to find refutations. GDFC-resolution focuses on relevant facts and rules by means of query independent link clauses. One problem is, that the number of link clauses may be infinite if the program contains recursive rules defined over recursive data structures. We present an approach to generate a more general but finite set of link clauses. We show that GDFC-resolution is sound and complete for definite programs. We discuss the efficiency of GDFC-resolution comparing it with SLD-resolution and present some experimental results.


Logic Program Definite Program Input Clause Success Branch Relevant Clause 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Burgard, W. Generating a Data Structure for Goal-Directed Forward Chaining in Logic Programming. Tech. Rept. 331, Department of Computer Science, University of Dortmund, 1989.Google Scholar
  2. 2.
    Burgard, W. Goal-Directed Forward Chaining: A Linear Resolution Strategy. Tech. Rept. 360, Department of Computer Science, University of Dortmund, 1990.Google Scholar
  3. 3.
    Burgard, W. and Heusch, P. Complexity Results on Generating Link Clauses for Goal-Directed Forward Chaining in Logic Programming. In Proceedings of the Second PROTOS Workshop, Sils Maria, Switzerland, Appelrath, H.J., Cremers, A.B., and Herzog, O., 1990.Google Scholar
  4. 4.
    Chang, C.L. and Lee, R.C.T. Symbolic Logic and Mechanical Theorem Proving, Academic Press(1973).Google Scholar
  5. 5.
    Garey, M.R. and Johnson, D.S. Computers and Intractability: A Guide to NP-Completeness, W. H. Freeman and Company, San Francisco(1979).Google Scholar
  6. 6.
    Heidelbach, M. Special Problems with Forward-Chaining Logic Programs, Diploma thesis, In German, University of Dortmund, 1990.Google Scholar
  7. 7.
    Lassez, J.L., Maher, M.J., and Mariott, K. Unification Revisited. In Deductive Databases and Logic Programming. Morgan Kaufmann Publishers, Inc., Los Altos, California, pp. 587–626, 1987.Google Scholar
  8. 8.
    Lloyd, J.W. Foundations of Logic Programming, Second, Extended Edition, Springer Verlag(1987).Google Scholar
  9. 9.
    Lozinskii, E.L. Evaluating Queries in Deductive Databases by Generating. In IJCAI 85 Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Aravind, J., Morgan Kaufmann Publishers, Inc., Los Altos, California, 1985.Google Scholar
  10. 10.
    Magura, N. An Experimental Study to Estimate the Efficiency of Goal-Directed Forward Chaining, Diploma thesis, In German, University of Dortmund, 1991.Google Scholar
  11. 11.
    Matsumo, Y., Tanaka, H., Hirakawa, H., Miyoshi, H., and Yasukawa, H. BUP: A Bottom-Up Parser Embedded in Prolog. New Generation Computing 1, 2 (1983), 145–158.Google Scholar
  12. 12.
    Plümer, L. Termination Proofs for Logic Programs, Springer Verlag, Lecture Notes in Artificial Intelligence, 446(1990).Google Scholar
  13. 13.
    Rosen, B.K. Robust Linear Algorithms for Cutsets. Journal of Algorithms 3(1982).Google Scholar
  14. 14.
    Speckenmeyer, E. On Feedback Problems in Digraphs. In Proceedings of the Fifteenth Workshop on Graphs, Rolduc, Netherlands, Springer Verlag, 1989.Google Scholar
  15. 15.
    Yamamoto, A. and Tanaka, H. Translating Production Rules into a Forward Reasoning Prolog Program. New Generation Computing 4(1986), 97–105.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Wolfram Burgard
    • 1
  1. 1.Institut für Informatik IIIUniversität BonnBonn

Personalised recommendations