Intelligent Backtracking in Plan-Based Deduction

@article{Matwin1985IntelligentBI,
  title={Intelligent Backtracking in Plan-Based Deduction},
  author={Stan Matwin and Tomasz Pietrzykowski},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={1985},
  volume={PAMI-7},
  pages={682-692}
}
This paper develops a method of mechanical deduction based on a graphical representation of the structure of proofs. Attempts to find a refutation(s) are recorded in the form of plans, corresponding to portions of an AND/OR graph search space and representing a purely deductive structure of derivation. This method can be applied to any initial base (set of nonnecessarily Horn clauses). Unlike the exhaustive (blind) backtracking which treats all the goals deduced in the course of a proof as… CONTINUE READING
6 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Automated Thleoreto Proiving

  • W. Bibel
  • Brunswick, Germany: Vieweg-Verlag,
  • 1982

" exponential improvemiient ot exhaustive backtracking : A strategy tor plan - based deduction , " in Lectuort Notes oii Coo 7 ipult

  • S. Matwin Pictrzykowski
  • 1980

soibolic Logic antid Mechanical Thcoroin Proving

  • C. L. Chang, S R.T. Lee
  • New York: Academic,
  • 1973

Exponential improvemiient oi ) exhMiS - tive backtracking : data structure and implemnentation , " in 1 cc titrc Notes oni Cotmnput

  • T. Pietrzykowski Matwin
  • 1970

Similar Papers

Loading similar papers…