Sinossi
In the 1970s, 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. In 1992, 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. This text 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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
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.
Product Description
Book by None
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Automated Mathematical Induction
Foto dell'editore
Automated Mathematical Induction
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780792340102_new
Compra nuovo
EUR 114,13
Spedizione EUR 13,81
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Automated Mathematical Induction
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 236. Codice articolo 26550177
Compra nuovo
EUR 133,14
Spedizione EUR 3,42
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 4 disponibili
Foto dell'editore
Automated Mathematical Induction
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: New. This text documents advances in the understanding of automated theorem provers that are capable of proofs by mathematical induction. The book provides a tutorial study of the Boyer-Moore theorem prover, and novel ideas that could be used to build theorem provers more powerful than this one. Editor(s): Zhang, Hantao. Num Pages: 222 pages, biography. BIC Classification: UYQ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 14. Weight in Grams: 509. . 1996. Reprinted from JOURNAL OF AUTOMATED REASONING 16:. Hardback. . . . . Codice articolo V9780792340102
Compra nuovo
EUR 132,60
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.
Spedito da Irlanda a U.S.A.
Quantità: 15 disponibili
Foto dell'editore
Automated Mathematical Induction
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 236. Codice articolo 18550187
Compra nuovo
EUR 136,86
Spedizione EUR 9,95
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 4 disponibili
Foto dell'editore
Automated Mathematical Induction
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
Condizione: New. Print on Demand pp. 236 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Codice articolo 8379134
Compra nuovo
EUR 145,82
Spedizione EUR 7,49
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 4 disponibili
Immagini fornite dal venditore
Automated Mathematical Induction
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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 . Codice articolo 5967751
Compra nuovo
EUR 118,64
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Automated Mathematical Induction
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. This text documents advances in the understanding of automated theorem provers that are capable of proofs by mathematical induction. The book provides a tutorial study of the Boyer-Moore theorem prover, and novel ideas that could be used to build theorem provers more powerful than this one. Editor(s): Zhang, Hantao. Num Pages: 222 pages, biography. BIC Classification: UYQ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 14. Weight in Grams: 509. . 1996. Reprinted from JOURNAL OF AUTOMATED REASONING 16:. Hardback. . . . . Books ship from the US and Ireland. Codice articolo V9780792340102
Compra nuovo
EUR 164,74
Spedizione EUR 9,01
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 15 disponibili
Foto dell'editore
Automated Mathematical Induction
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Hardcover. Condizione: Like New. Like New. book. Codice articolo ERICA77307923401086
Compra usato
EUR 162,62
Spedizione EUR 28,81
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Automated Mathematical Induction
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9780792340102
Compra nuovo
EUR 162,93
Spedizione EUR 62,62
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili