Implementation Strategies for Plan-Based Deduction

  • Kenneth Forsythe
  • Stanislaw Matwin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 170)


This paper discusses some results of experimentation with a plan-based deduction system. The system incorporates an efficient intelligent backtracking strategy. During implementation, several important questions concerning different strategies to control the deduction process arose. These questions are answered in the paper, with special emphasis on the problem of generating redundant solutions.


Goal Statement Open Goal Deduction System Order Number Resolution Process 
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. [Bibel 83]
    Bibel, W. “Matings in Matrices”, Communications of ACM, vol 26, No 26, pp. 844–852, 1983.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [Bruynooghe 83]
    Bruynooghe, M., “Deduction Revision by Intelligent Backtracking”, Universidade Nova de Lisboa, Research Report, July 1983.Google Scholar
  3. [Chang and Slagle 79]
    Chang, C.L. and Slagle, J.R., “Using Rewriting Rules for Connection Graphs to Prove Theroms”, Artificial Intelligence, Vol. 12, pp. 159–180, 1979.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [Clocksin and Mellish 82]
    Clocksin, W.F. and Mellish, C.S., “Programming in Prolog”, Springer Verlag, 1982.Google Scholar
  5. [Forsythe & Matwin 83]
    Forsythe, K and Matwin, S., “Copying of Multi-level Structures in a PASCAL Environment”, submitted to Software — Practice and Experience, 1983.Google Scholar
  6. [Kowalski 75]
    Kowalski, R., “A Proof Procedure Using Connection Graphs”, Journal of ACM, vol 22, No 4, pp. 572–595, 1975.MathSciNetCrossRefzbMATHGoogle Scholar
  7. [Matwin & Pietrzykowski 83]
    Matwin, S and Pietrzykowski, T., “Intelligent Backtracking in Plan-Based Deduction”, submitted to IEEE Trans. on Pattern Analysis and Machine Intelligence.Google Scholar
  8. [Pereira & Porto 80]
    Pereira, L.M., and Porto, A., “Selective Backtracking for Logic Programs”, Procs. of CADE-5, pp. 306–317.Google Scholar
  9. [Pietrzykowski & Matwin 82]
    Pietrzykowski, T. and Matwin, S., “Exponential Improvement of Exhaustive Backtracking: A Strategy for Plan-Based Deduction”, Procs. of CADE-6, pp. 223–239.Google Scholar
  10. [Sickle 76]
    Sickle, S. “A Search Technique for Clause Interconnectivity Graphs”, IEEE Trans. on Computers, Vol 25, No 8, pp. 823–835, 1976.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Kenneth Forsythe
    • 1
  • Stanislaw Matwin
    • 1
  1. 1.Dept. of Computer ScienceUniversity of OttawaOttawa

Personalised recommendations