Cambridge Catalogue  
  • Your account
  • View basket
  • Help
Home > Catalogue > Rippling: Meta-Level Guidance for Mathematical Reasoning
Rippling: Meta-Level Guidance for Mathematical Reasoning
Google Book Search

Search this book

Details

  • 1 b/w illus. 10 colour illus.
  • Page extent: 216 pages
  • Size: 228 x 152 mm
  • Weight: 0.475 kg

Library of Congress

  • Dewey number: 006.3/33
  • Dewey version: 22
  • LC Classification: QA76.9.A96 B84 2005
  • LC Subject headings:
    • Automatic theorem proving
    • Logic, Symbolic and mathematical

Library of Congress Record

Add to basket

Hardback

 (ISBN-13: 9780521834490 | ISBN-10: 052183449X)

DOI: 10.2277/052183449X

In stock

 (Stock level updated: 16:52 GMT, 03 September 2015)

£94.99

Rippling is a radically new technique for the automation of mathematical reasoning. It is widely applicable whenever a goal is to be proved from one or more syntactically similar givens. It was originally developed for inductive proofs, where the goal was the induction conclusion and the givens were the induction hypotheses. It has proved to be applicable to a much wider class of tasks, from summing series via analysis to general equational reasoning. The application to induction has especially important practical implications in the building of dependable IT systems, and provides solutions to issues such as the problem of combinatorial explosion. Rippling is the first of many new search control techniques based on formula annotation; some additional annotated reasoning techniques are also described here. This systematic and comprehensive introduction to rippling, and to the wider subject of automated inductive theorem proving, will be welcomed by researchers and graduate students alike.

• Describes a brand new approach to automated reasoning • Can be used with profit by students or software engineers working in software correctness and automated theorem proving • First book on the subject

Contents

Preface; 1. An introduction to rippling; 2. Varieties of rippling; 3. Productive use of failure; 4. A formal account of rippling; 5. The scope and limitations of rippling; 6. From rippling to a general methodology; 7. Conclusions; Appendix 1. An annotated calculus and a unification algorithm; Appendix 2. Definitions of functions used in this book; Bibliography; Index.

printer iconPrinter friendly version AddThis