Automated Mathematical Induction / Edition 1

by Hantao Zhang

Overview

It has been shown how the common structure that defines a family of proofs can be expressed as a proof plan [5]. This common structure can be exploited in the search for particular proofs. A proof plan has two complementary components: a proof method and a proof tactic. By prescribing the structure of a proof at the level of primitive inferences, a tactic [11] provides the guarantee part of the proof. In contrast, a method provides a more declarative explanation of the proof by means of preconditions. Each method has associated effects. The execution of the effects simulates the application of the corresponding tactic. Theorem proving in the proof planning framework is a two-phase process: 1. Tactic construction is by a process of method composition: Given a goal, an applicable method is selected. The applicability of a method is determined by evaluating the method's preconditions. The method effects are then used to calculate subgoals. This process is applied recursively until no more subgoals remain. Because of the one-to-one correspondence between methods and tactics, the output from this process is a composite tactic tailored to the given goal. 2. Tactic execution generates a proof in the object-level logic. Note that no search is involved in the execution of the tactic. All the search is taken care of during the planning process. The real benefits of having separate planning and execution phases become appar­ ent when a proof attempt fails.

Product Details

ISBN-13:	9780792340102
Publisher:	Springer Netherlands
Publication date:	05/31/1996
Edition description:	Reprinted from JOURNAL OF AUTOMATED REASONING 16:1-2, 1996, 1996
Pages:	222
Product dimensions:	6.14(w) x 9.21(h) x 0.02(d)

Table of Contents

Induction Using Term Orders.- New Uses of Linear Arithmetic in Automated Theorem Proving by Induction.- Productive Use of Failure in Inductive Proof.- Middle-Out Reasoning for Synthesis and Induction.- A Calculus for and Termination of Rippling.- Interaction with the Boyer—Moore Theorem Prover: A Tutorial Study Using the Arithmetic—Geometric Mean Theorem.

Editorial Reviews

Presents a tutorial on the Boyer-Moore theorem prover, the first capable of proofs by mathematical induction. Five additional articles present novel ideas that could be used to build even more powerful theorem provers. They discuss using term orders, linear arithmetic, failure, and middle-out reasoning; and a calculus for a termination of rippling. Reprinted from Journal of Automated Reasoning vol. 16, nos. 1-2 (1996). No index. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews