Automated Mathematical Induction
29%
off

Automated Mathematical Induction

Edited by 

Free delivery worldwide

Available. Dispatched from the UK in 4 business days
When will my order arrive?

Description

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.
show more

Product details

  • Hardback | 222 pages
  • 154.9 x 236.2 x 20.3mm | 453.6g
  • Dordrecht, Netherlands
  • English
  • Reprinted from JOURNAL OF AUTOMATED REASONING 16:1-2, 1996, 1996
  • VI, 222 p.
  • 0792340108
  • 9780792340102

Table of contents

Preface. Induction Using Term Orders; F. Bronsard, et al. New Uses of Linear Arithmetic in Automated Theorem Proving by Induction; D. Kapur, M. Subramaniam. Productive Use of Failure in Inductive Proof; A. Ireland, A. Bundy. Middle-Out Reasoning for Synthesis and Induction; I. Kraan, et al. A Calculus for and Termination of Rippling; D.A. Basin, T. Walsh. Interaction with the Boyer-Moore Theorem Prover. A Tutorial Study Using the Arithmetic-Geometric Mean Theorem; M. Kaufmann, P. Pecchiari.
show more