Using rippling for equational reasoning

  • Dieter Hutter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1137)


This paper presents techniques to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the field of inductive theorem proving we use annotated terms to represent syntactical differences of formulas. Based on these annotations and on hierarchies of function symbols we define different abstractions of formulas which are used for planning of proofs. Rippling techniques are used to refine single planning steps, e.g. the application of a bridge lemma, on a next planning level.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BS88]
    K. Hans Bläsius and J.H. Siekmann. Partial unification for graph based equational reasoning. In 9th CADE, Springer, LNCS, 1988Google Scholar
  2. [BSvH+93]
    A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62, pp. 185–253, 1993.Google Scholar
  3. [BvHS91]
    A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Journal of Automated Reasoning, 7, 1991.Google Scholar
  4. [BW93]
    D. Basin and T. Walsh. Difference unification. In 13th IJCAI, Morgan Kaufmann, 1993.Google Scholar
  5. [BW95]
    D. Basin and T. Walsh. A Calculus for and Termination of Rippling. To appear in the Journal of Automated Reasoning, 1995.Google Scholar
  6. [CH94]
    J. Cleve and D. Hutter. A methodology for equational reasoning. In Hawaii International Conference on System Sciences 27, Eds: Jay F. Nunamaker, jr. and Ralph H. Sprague, jr., IEEE Computer Society Press, 1994Google Scholar
  7. [Dig85]
    V.J. Digricoli. The management of heuristic search in boolean experiments with RUE resolution. In 9th IJCAI, pp. 1154–1161, Los Angeles, California, 1985.Google Scholar
  8. [GOBS69]
    J. Guard, and F. Oglesby, and J. Bennett, and L. Settle. Semi-automated mathematics. In Journal of the ACM, pp. 49–62, Vol. 16, 1969Google Scholar
  9. [Hut]
    D. Hutter. Colouring terms to control equational reasoning. Journal of Automated Reasoning, forthcomingGoogle Scholar
  10. [Hut90]
    D. Hutter. Guiding inductive proofs. In M.E. Stickel, editor, 10th CADE, Springer, LNAI 449, 1990Google Scholar
  11. [HS96]
    D. Hutter, and C. Sengler INKA — The Next Generation In J. Slaney, M.McRobbie, editor, 13th CADE, Springer, LNAI, 1996Google Scholar
  12. [Mor69]
    J. Morris. E-resolution: an extension of resolution to include the equality relation. In IJCAI-69, 1969.Google Scholar
  13. [NSS63]
    A. Newell, J.C. Shaw, and H.A. Simon. The logic theory machine. In Feigenbaum and Feldman, editors, Computers and Thought, pp. 61–79. McGraw-Hill, 1963.Google Scholar
  14. [VSE96]
    D. Hutter, B. Langenstein, C. Sengler, J. Siekmann, W. Stephan, A. Wolpers Deduction in the Verification Support Environment. In FME-96, Oxford, Springer, LNCS, 1996Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Dieter Hutter
    • 1
  1. 1.German Research Center for Artificial Intelligence (DFKI GmbH)SaarbrückenGermany

Personalised recommendations