Automated Mathematical Induction PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Automated Mathematical Induction PDF full book. Access full book title Automated Mathematical Induction by Hantao Zhang. Download full books in PDF and EPUB format.
Author: Hantao Zhang
Publisher: Springer Science & Business Media
ISBN: 9400916752
Category : Computers
Languages : en
Pages : 223
Get Book Here
Book 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.
Author: Hantao Zhang
Publisher: Springer Science & Business Media
ISBN: 9400916752
Category : Computers
Languages : en
Pages : 223
Get Book Here
Book 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.
Author: Hantao Zhang
Publisher:
ISBN: 9789400916760
Category :
Languages : en
Pages : 232
Get Book Here
Book Description
Author: A. Bouhoula
Publisher:
ISBN:
Category :
Languages : en
Pages : 4
Get Book Here
Book Description
Author: Adel Bouhoula
Publisher:
ISBN:
Category : Automatic theorem proving
Languages : en
Pages : 44
Get Book Here
Book Description
Abstract: "Proofs by induction are important in many computer science and artificial intelligence applications, in particular, in program verification and specification systems. We present a new method to prove (and disprove) automatically inductive properties. Given a set of axioms, a well-suited induction scheme is constructed automatically. We call such an induction scheme a test set. Then, for proving a property, we just instantiate it with terms from the test set and apply pure algebraic simplification to the result. This method needs no completion and explicit induction. However it retains their positive features, namely, the completeness of the former and the robustness of the latter. It has been implemented in the theorem-prover SPIKE."
Author: Alan Bundy
Publisher:
ISBN:
Category : Computer software
Languages : en
Pages : 50
Get Book Here
Book Description
Author: Donald A. MacKenzie
Publisher:
ISBN:
Category : Automatic theorem proving
Languages : en
Pages : 60
Get Book Here
Book Description
Author: W. W. Bledsoe
Publisher: American Mathematical Soc.
ISBN: 082185027X
Category : Mathematics
Languages : en
Pages : 372
Get Book Here
Book Description
Author: R. S. Boyer
Publisher:
ISBN:
Category :
Languages : en
Pages : 42
Get Book Here
Book Description
Author: David S. Gunderson
Publisher: Chapman & Hall/CRC
ISBN: 9781138199019
Category : Induction (Mathematics)
Languages : en
Pages : 921
Get Book Here
Book Description
Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics. In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He then introduces ordinals and cardinals, transfinite induction, the axiom of choice, Zorn's lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs. The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized. The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process.
Author: Robert S. Boyer
Publisher:
ISBN:
Category :
Languages : en
Pages : 42
Get Book Here
Book Description