Rippling: Meta-Level Guidance for Mathematical Reasoning (Cambridge Tracts in Theoretical Computer Science)

Bundy, Alan; Basin, David; Hutter, Dieter; Ireland, Andrew

ISBN 10: 052183449X / ISBN 13: 9780521834490

Published by Cambridge University Press, 2005

About this Item

Hardcover. Good binding and cover. Library markings. Clean, unmarked pages.

Seller Inventory # 1807050038

Bibliographic Details

• Title: Rippling: Meta-Level Guidance for Mathematical Reasoning (Cambridge Tracts in Theoretical Computer Science)
• Publisher: Cambridge University Press
• Publication Date: 2005
• Language: English
• ISBN 10: 052183449X
• ISBN 13: 9780521834490
• Binding: Hardcover
• Condition: Good
• Weight: 17 ounces
• Seller catalogs:
  • Computers

About this title

Synopsis

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.

Book Description

The new technique of rippling and its use in automated reasoning are described here. The method uses heuristics and search to help address the problem of combinatorial explosion. The book provides a unique, systematic and comprehensive introduction to this and to the wider subject of automated inductive theorem proving.