Rippling : meta-level guidance for mathematical reasoning
Author(s)
Bibliographic Information
Rippling : meta-level guidance for mathematical reasoning
(Cambridge tracts in theoretical computer science, 56)
Cambridge University Press, 2005
- : hbk
Available at 8 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references and index
HTTP:URL=http://www.loc.gov/catdir/toc/cam051/2004051866.html Information=Table of contents
HTTP:URL=http://www.loc.gov/catdir/description/cam051/2004051866.html Information=Publisher description
Description and Table of Contents
Description
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.
Table of 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.
by "Nielsen BookData"