Extensions to the rippling-out tactic for guiding inductive proofs:
Abstract: "In earlier papers we described a technique for automatically constructing inductive proofs, using a technique called rippling to reduce the search. Although essentially correct, further testing on harder examples showed that this technique had to be extended in various ways. Each of...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1990
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
459 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In earlier papers we described a technique for automatically constructing inductive proofs, using a technique called rippling to reduce the search. Although essentially correct, further testing on harder examples showed that this technique had to be extended in various ways. Each of the various extensions are described with examples to illustrate why they are needed, but it is shown that the spirit of rippling has been maintained." |
| Beschreibung: | 17 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010451625 | ||
| 003 | DE-604 | ||
| 005 | 19951026 | ||
| 007 | t | ||
| 008 | 951026s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)22223786 | ||
| 035 | |a (DE-599)BVBBV010451625 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Bundy, Alan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Extensions to the rippling-out tactic for guiding inductive proofs |c Alan Bundy ; Frank van Harmelen ; Alan Smaill |
| 264 | 1 | |a Edinburgh |c 1990 | |
| 300 | |a 17 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 459 | |
| 520 | 3 | |a Abstract: "In earlier papers we described a technique for automatically constructing inductive proofs, using a technique called rippling to reduce the search. Although essentially correct, further testing on harder examples showed that this technique had to be extended in various ways. Each of the various extensions are described with examples to illustrate why they are needed, but it is shown that the spirit of rippling has been maintained." | |
| 650 | 7 | |a Electronics and electrical engineering, computer science |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Induction (Logic) | |
| 700 | 1 | |a Van Harmelen, Frank |e Verfasser |4 aut | |
| 700 | 1 | |a Smaill, Alan |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 459 |w (DE-604)BV010450646 |9 459 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006964654 | ||
Datensatz im Suchindex
| _version_ | 1804124884557627392 |
|---|---|
| any_adam_object | |
| author | Bundy, Alan Van Harmelen, Frank Smaill, Alan |
| author_facet | Bundy, Alan Van Harmelen, Frank Smaill, Alan |
| author_role | aut aut aut |
| author_sort | Bundy, Alan |
| author_variant | a b ab h f v hf hfv a s as |
| building | Verbundindex |
| bvnumber | BV010451625 |
| ctrlnum | (OCoLC)22223786 (DE-599)BVBBV010451625 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01656nam a2200349 cb4500</leader><controlfield tag="001">BV010451625</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19951026 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951026s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22223786</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010451625</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">Bundy, Alan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Extensions to the rippling-out tactic for guiding inductive proofs</subfield><subfield code="c">Alan Bundy ; Frank van Harmelen ; Alan Smaill</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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">459</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In earlier papers we described a technique for automatically constructing inductive proofs, using a technique called rippling to reduce the search. Although essentially correct, further testing on harder examples showed that this technique had to be extended in various ways. Each of the various extensions are described with examples to illustrate why they are needed, but it is shown that the spirit of rippling has been maintained."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Electronics and electrical engineering, computer science</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">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Induction (Logic)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Van Harmelen, Frank</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Smaill, 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">459</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">459</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006964654</subfield></datafield></record></collection> |
| id | DE-604.BV010451625 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:45Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006964654 |
| oclc_num | 22223786 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 17 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Bundy, Alan Verfasser aut Extensions to the rippling-out tactic for guiding inductive proofs Alan Bundy ; Frank van Harmelen ; Alan Smaill Edinburgh 1990 17 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 459 Abstract: "In earlier papers we described a technique for automatically constructing inductive proofs, using a technique called rippling to reduce the search. Although essentially correct, further testing on harder examples showed that this technique had to be extended in various ways. Each of the various extensions are described with examples to illustrate why they are needed, but it is shown that the spirit of rippling has been maintained." Electronics and electrical engineering, computer science sigle Mathematics sigle Mathematik Induction (Logic) Van Harmelen, Frank Verfasser aut Smaill, Alan Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 459 (DE-604)BV010450646 459 |
| spellingShingle | Bundy, Alan Van Harmelen, Frank Smaill, Alan Extensions to the rippling-out tactic for guiding inductive proofs Electronics and electrical engineering, computer science sigle Mathematics sigle Mathematik Induction (Logic) |
| title | Extensions to the rippling-out tactic for guiding inductive proofs |
| title_auth | Extensions to the rippling-out tactic for guiding inductive proofs |
| title_exact_search | Extensions to the rippling-out tactic for guiding inductive proofs |
| title_full | Extensions to the rippling-out tactic for guiding inductive proofs Alan Bundy ; Frank van Harmelen ; Alan Smaill |
| title_fullStr | Extensions to the rippling-out tactic for guiding inductive proofs Alan Bundy ; Frank van Harmelen ; Alan Smaill |
| title_full_unstemmed | Extensions to the rippling-out tactic for guiding inductive proofs Alan Bundy ; Frank van Harmelen ; Alan Smaill |
| title_short | Extensions to the rippling-out tactic for guiding inductive proofs |
| title_sort | extensions to the rippling out tactic for guiding inductive proofs |
| topic | Electronics and electrical engineering, computer science sigle Mathematics sigle Mathematik Induction (Logic) |
| topic_facet | Electronics and electrical engineering, computer science Mathematics Mathematik Induction (Logic) |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT bundyalan extensionstotheripplingouttacticforguidinginductiveproofs AT vanharmelenfrank extensionstotheripplingouttacticforguidinginductiveproofs AT smaillalan extensionstotheripplingouttacticforguidinginductiveproofs |