Skip to main content
Article thumbnail
Location of Repository

A recursion planning analysis of inductive completion

By R. Barnett, Saarbruecken (Germany)) D. (Max-Planck-Institut fuer Informatik Basin, J. (Edinburgh Univ. (United Kingdom). Dept. of Artificial Intelligence) Hesketh and Saarbruecken (Germany) Max-Planck-Institut fuer Informatik

Abstract

We use the AI proof planning techniques of recursion analysis and rippling as tools to analyze so called inductionless induction proof techniques. Recursion analysis chooses induction schemas and variables and rippling controls rewriting in explicit induction proofs. They provide a basis for explaining the success and failure of inductionless induction both in deduction of critical pairs and in their simplification. Furthermore, these explicit induction techniques motivate and provide insight into advancements in inductive completion algorithms and suggest directions for further improvements. Our study includes an experimental comparison of Clam, an explicit induction theorem prover, with an implementation of Huet and Hullot's inductionless induction. (orig.)SIGLEAvailable from TIB Hannover: RR 1912(92-230)+a / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Forschung und Technologie (BMFT), Bonn (Germany)DEGerman

Topics: 09H - Computer software, programming, 06D - Bionics, AUTOMATED DEDUCTION: M, THEOREM PROVING
Year: 1992
OAI identifier:
Provided by: OpenGrey Repository
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10068/15... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.