Rippling: meta-level guidance for mathematical reasoning
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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2005
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
56 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | 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 |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xiv, 202 pages) |
| ISBN: | 9780511543326 |
| DOI: | 10.1017/CBO9780511543326 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043941270 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2005 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511543326 |c Online |9 978-0-511-54332-6 | ||
| 024 | 7 | |a 10.1017/CBO9780511543326 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511543326 | ||
| 035 | |a (OCoLC)850496232 | ||
| 035 | |a (DE-599)BVBBV043941270 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 006.3/33 |2 22 | |
| 100 | 1 | |a Bundy, Alan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Rippling |b meta-level guidance for mathematical reasoning |c Alan Bundy [and three others] |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2005 | |
| 300 | |a 1 online resource (xiv, 202 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge tracts in theoretical computer science |v 56 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a 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 | |
| 520 | |a 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 | ||
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-83449-0 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511543326 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350241 | ||
| 966 | e | |u https://doi.org/10.1017/CBO9780511543326 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511543326 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176882748358656 |
|---|---|
| any_adam_object | |
| author | Bundy, Alan |
| author_facet | Bundy, Alan |
| author_role | aut |
| author_sort | Bundy, Alan |
| author_variant | a b ab |
| building | Verbundindex |
| bvnumber | BV043941270 |
| collection | ZDB-20-CBO |
| contents | 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 |
| ctrlnum | (ZDB-20-CBO)CR9780511543326 (OCoLC)850496232 (DE-599)BVBBV043941270 |
| dewey-full | 006.3/33 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.3/33 |
| dewey-search | 006.3/33 |
| dewey-sort | 16.3 233 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1017/CBO9780511543326 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02801nmm a2200421zcb4500</leader><controlfield tag="001">BV043941270</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2005 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511543326</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-54332-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511543326</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511543326</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)850496232</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941270</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3/33</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bundy, Alan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Rippling</subfield><subfield code="b">meta-level guidance for mathematical reasoning</subfield><subfield code="c">Alan Bundy [and three others]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiv, 202 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">56</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-83449-0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511543326</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029350241</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511543326</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511543326</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043941270 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:15Z |
| institution | BVB |
| isbn | 9780511543326 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350241 |
| oclc_num | 850496232 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xiv, 202 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Bundy, Alan Verfasser aut Rippling meta-level guidance for mathematical reasoning Alan Bundy [and three others] Cambridge Cambridge University Press 2005 1 online resource (xiv, 202 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in theoretical computer science 56 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 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 Automatic theorem proving Logic, Symbolic and mathematical Erscheint auch als Druckausgabe 978-0-521-83449-0 https://doi.org/10.1017/CBO9780511543326 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Bundy, Alan Rippling meta-level guidance for mathematical reasoning 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 Automatic theorem proving Logic, Symbolic and mathematical |
| title | Rippling meta-level guidance for mathematical reasoning |
| title_auth | Rippling meta-level guidance for mathematical reasoning |
| title_exact_search | Rippling meta-level guidance for mathematical reasoning |
| title_full | Rippling meta-level guidance for mathematical reasoning Alan Bundy [and three others] |
| title_fullStr | Rippling meta-level guidance for mathematical reasoning Alan Bundy [and three others] |
| title_full_unstemmed | Rippling meta-level guidance for mathematical reasoning Alan Bundy [and three others] |
| title_short | Rippling |
| title_sort | rippling meta level guidance for mathematical reasoning |
| title_sub | meta-level guidance for mathematical reasoning |
| topic | Automatic theorem proving Logic, Symbolic and mathematical |
| topic_facet | Automatic theorem proving Logic, Symbolic and mathematical |
| url | https://doi.org/10.1017/CBO9780511543326 |
| work_keys_str_mv | AT bundyalan ripplingmetalevelguidanceformathematicalreasoning |