Using failure to guode inductive proof:
Abstract: "Lemma discovery and generalization are two of the major hurdles in automating inductive proof. This paper addresses aspects of these related problems. We build upon rippling, a heuristic which plays a pivotal role in guiding inductive proof. Rippling provides a high-level explanation...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Edinburgh
1992
|
Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
613 |
Schlagworte: | |
Zusammenfassung: | Abstract: "Lemma discovery and generalization are two of the major hurdles in automating inductive proof. This paper addresses aspects of these related problems. We build upon rippling, a heuristic which plays a pivotal role in guiding inductive proof. Rippling provides a high-level explanation of how to control the search for a proof. We demonstrate how this high-level explanation can be exploited productively when a proof attempt fails. In particular we show how failure can be used to focus the search for lemmas and generalizations." |
Beschreibung: | 15 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV035170148 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 081119s1992 |||| 00||| engod | ||
035 | |a (OCoLC)31223375 | ||
035 | |a (DE-599)BVBBV035170148 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
100 | 1 | |a Ireland, Andrew |e Verfasser |4 aut | |
245 | 1 | 0 | |a Using failure to guode inductive proof |c Andrew Ireland and Alan Bundy |
264 | 1 | |a Edinburgh |c 1992 | |
300 | |a 15 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 613 | |
520 | 3 | |a Abstract: "Lemma discovery and generalization are two of the major hurdles in automating inductive proof. This paper addresses aspects of these related problems. We build upon rippling, a heuristic which plays a pivotal role in guiding inductive proof. Rippling provides a high-level explanation of how to control the search for a proof. We demonstrate how this high-level explanation can be exploited productively when a proof attempt fails. In particular we show how failure can be used to focus the search for lemmas and generalizations." | |
650 | 7 | |a Computer software |2 sigle | |
650 | 7 | |a Mathematics |2 sigle | |
650 | 4 | |a Künstliche Intelligenz | |
650 | 4 | |a Mathematik | |
650 | 4 | |a Artificial intelligence | |
700 | 1 | |a Bundy, Alan |e Verfasser |4 aut | |
810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 613 |w (DE-604)BV010450646 |9 613 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-016977091 |
Datensatz im Suchindex
_version_ | 1804138337833844736 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Ireland, Andrew Bundy, Alan |
author_facet | Ireland, Andrew Bundy, Alan |
author_role | aut aut |
author_sort | Ireland, Andrew |
author_variant | a i ai a b ab |
building | Verbundindex |
bvnumber | BV035170148 |
ctrlnum | (OCoLC)31223375 (DE-599)BVBBV035170148 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01665nam a2200349 cb4500</leader><controlfield tag="001">BV035170148</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">081119s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31223375</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035170148</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ireland, Andrew</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Using failure to guode inductive proof</subfield><subfield code="c">Andrew Ireland and Alan Bundy</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">613</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Lemma discovery and generalization are two of the major hurdles in automating inductive proof. This paper addresses aspects of these related problems. We build upon rippling, a heuristic which plays a pivotal role in guiding inductive proof. Rippling provides a high-level explanation of how to control the search for a proof. We demonstrate how this high-level explanation can be exploited productively when a proof attempt fails. In particular we show how failure can be used to focus the search for lemmas and generalizations."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bundy, Alan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">613</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">613</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016977091</subfield></datafield></record></collection> |
id | DE-604.BV035170148 |
illustrated | Not Illustrated |
index_date | 2024-07-02T22:54:01Z |
indexdate | 2024-07-09T21:26:36Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016977091 |
oclc_num | 31223375 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 15 S. |
publishDate | 1992 |
publishDateSearch | 1992 |
publishDateSort | 1992 |
record_format | marc |
series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
spelling | Ireland, Andrew Verfasser aut Using failure to guode inductive proof Andrew Ireland and Alan Bundy Edinburgh 1992 15 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 613 Abstract: "Lemma discovery and generalization are two of the major hurdles in automating inductive proof. This paper addresses aspects of these related problems. We build upon rippling, a heuristic which plays a pivotal role in guiding inductive proof. Rippling provides a high-level explanation of how to control the search for a proof. We demonstrate how this high-level explanation can be exploited productively when a proof attempt fails. In particular we show how failure can be used to focus the search for lemmas and generalizations." Computer software sigle Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence Bundy, Alan Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 613 (DE-604)BV010450646 613 |
spellingShingle | Ireland, Andrew Bundy, Alan Using failure to guode inductive proof Computer software sigle Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence |
title | Using failure to guode inductive proof |
title_auth | Using failure to guode inductive proof |
title_exact_search | Using failure to guode inductive proof |
title_exact_search_txtP | Using failure to guode inductive proof |
title_full | Using failure to guode inductive proof Andrew Ireland and Alan Bundy |
title_fullStr | Using failure to guode inductive proof Andrew Ireland and Alan Bundy |
title_full_unstemmed | Using failure to guode inductive proof Andrew Ireland and Alan Bundy |
title_short | Using failure to guode inductive proof |
title_sort | using failure to guode inductive proof |
topic | Computer software sigle Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence |
topic_facet | Computer software Mathematics Künstliche Intelligenz Mathematik Artificial intelligence |
volume_link | (DE-604)BV010450646 |
work_keys_str_mv | AT irelandandrew usingfailuretoguodeinductiveproof AT bundyalan usingfailuretoguodeinductiveproof |