Synopsis
It has been shown how the common structure that defines a family of proofs can be expressed as a proof plan [5]. 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.
"synopsis" may belong to another edition of this title.
Product Description
Two decades ago, Boyer and Moore built one of the first automated theorem provers that was capable of proofs by mathematical induction. Today, the Boyer-Moore theorem prover remains the most successful in the field. For a long time, the research on automated mathematical induction was confined to very few people. In recent years, as more people realize the importance of automated inductive reasoning to the use of formal methods of software and hardware development, more automated inductive proof systems have been built. Three years ago, the interested researchers in the field formed two consortia on automated inductive reasoning - the MInd consortium in Europe and the IndUS consortium in the United States. The two consortia organized three joint workshops in 1992-1995. There will be another one in 1996. Following the suggestions of Alan Bundy and Deepak Kapur, this book documents advances in the understanding of the field and in the power of the theorem provers that can be built. In the first of six papers, the reader is provided with a tutorial study of the Boyer-Moore theorem prover. The other five papers present novel ideas that could be used to build theorem provers more powerful than the Boyer-Moore prover.
"About this title" may belong to another edition of this title.
Search results for Automated Mathematical Induction
Stock Image
Automated Mathematical Induction
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9789401072502_new
Buy New
£ 96.15
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Automated Mathematical Induction
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. v + 222. Seller Inventory # 2648029536
Stock Image
Automated Mathematical Induction
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. v + 222. Seller Inventory # 44785855
Buy New
£ 125.75
£ 6.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
Automated Mathematical Induction
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. reprint edition. 224 pages. 9.50x6.40x0.60 inches. In Stock. Seller Inventory # x-9401072507
Buy New
£ 125.26
£ 10 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Automated Mathematical Induction
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. v + 222. Seller Inventory # 1848029546
Seller Image
Automated Mathematical Induction
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. 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 . Seller Inventory # 5833853
Buy New
£ 110.60
£ 42.42 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Automated Mathematical Induction
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware - 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. Seller Inventory # 9789401072502