UID:
almafu_9960117168602883
Format:
1 online resource (xiv, 202 pages) :
,
digital, PDF file(s).
ISBN:
1-107-13947-3
,
1-280-45868-2
,
9786610458684
,
0-511-19829-9
,
0-511-18152-3
,
0-511-11338-2
,
0-511-29926-5
,
0-511-54332-8
,
0-511-11287-4
Series Statement:
Cambridge tracts in theoretical computer science ; 56
Content:
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.
Note:
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
,
An introduction to rippling -- Varieties of rippling -- Productive use of failure -- A formal account of rippling -- The scope and limitations of rippling -- From rippling to a general methodology.
,
English
Additional Edition:
ISBN 0-521-83449-X
Language:
English
Bookmarklink
