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 ...
Read More
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.
Read Less
Add this copy of Automated Mathematical Induction to cart. $18.50, new condition, Sold by Scholars Attic rated 4.0 out of 5 stars, ships from Lake Barrington, IL, UNITED STATES, published 1996 by Springer.
Edition:
Reprinted from Journal of Auto and 96 edition
Publisher:
Springer
Published:
1996
Language:
English
Alibris ID:
11339253959
Shipping Options:
Standard Shipping: $4.99
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New book (shrink wrapped NEW)! ! -No international shipping available. Sewn binding. Cloth over boards. 224 p. Contains: Illustrations. Audience: General/trade.
Add this copy of Automated Mathematical Induction to cart. $45.87, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1996 by Springer.
Add this copy of Automated Mathematical Induction to cart. $103.32, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1996 by Springer.
Add this copy of Automated Mathematical Induction to cart. $132.45, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 1996 by Springer.
