How to solve it by induction:
Abstract: "We describe a computer program that proves theorems using mathematical induction. It is used to prove properties of computer programs. Helpful tips guide the program's search for a proof. These tips are used to form proof plans, which describe the structure of proofs at multiple...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1992
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
600 |
| Subjects: | |
| Summary: | Abstract: "We describe a computer program that proves theorems using mathematical induction. It is used to prove properties of computer programs. Helpful tips guide the program's search for a proof. These tips are used to form proof plans, which describe the structure of proofs at multiple levels. We are attempting to discover general-purpose proof plans which describe the common structure in families of similar proofs. This study constitutes a new science of reasoning in which mathematical proofs are the objects of analysis." |
| Physical Description: | 12 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010460554 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951102s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)30863557 | ||
| 035 | |a (DE-599)BVBBV010460554 | ||
| 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 How to solve it by induction |
| 264 | 1 | |a Edinburgh |c 1992 | |
| 300 | |a 12 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 600 | |
| 520 | 3 | |a Abstract: "We describe a computer program that proves theorems using mathematical induction. It is used to prove properties of computer programs. Helpful tips guide the program's search for a proof. These tips are used to form proof plans, which describe the structure of proofs at multiple levels. We are attempting to discover general-purpose proof plans which describe the common structure in families of similar proofs. This study constitutes a new science of reasoning in which mathematical proofs are the objects of analysis." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Automatic programming (Computer science) | |
| 650 | 4 | |a Automatic theorem proving | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 600 |w (DE-604)BV010450646 |9 600 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006969374 | ||
Record in the Search Index
| _version_ | 1804124891789656064 |
|---|---|
| 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 | BV010460554 |
| ctrlnum | (OCoLC)30863557 (DE-599)BVBBV010460554 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01645nam a2200349 cb4500</leader><controlfield tag="001">BV010460554</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951102s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30863557</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010460554</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">How to solve it by induction</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">12 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">600</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We describe a computer program that proves theorems using mathematical induction. It is used to prove properties of computer programs. Helpful tips guide the program's search for a proof. These tips are used to form proof plans, which describe the structure of proofs at multiple levels. We are attempting to discover general-purpose proof plans which describe the common structure in families of similar proofs. This study constitutes a new science of reasoning in which mathematical proofs are the objects of analysis."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</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">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</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">600</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">600</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006969374</subfield></datafield></record></collection> |
| id | DE-604.BV010460554 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006969374 |
| oclc_num | 30863557 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Bundy, Alan Verfasser aut How to solve it by induction Edinburgh 1992 12 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 600 Abstract: "We describe a computer program that proves theorems using mathematical induction. It is used to prove properties of computer programs. Helpful tips guide the program's search for a proof. These tips are used to form proof plans, which describe the structure of proofs at multiple levels. We are attempting to discover general-purpose proof plans which describe the common structure in families of similar proofs. This study constitutes a new science of reasoning in which mathematical proofs are the objects of analysis." Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic programming (Computer science) Automatic theorem proving Department of Artificial Intelligence: DAI research paper University <Edinburgh> 600 (DE-604)BV010450646 600 |
| spellingShingle | Bundy, Alan How to solve it by induction Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic programming (Computer science) Automatic theorem proving |
| title | How to solve it by induction |
| title_auth | How to solve it by induction |
| title_exact_search | How to solve it by induction |
| title_full | How to solve it by induction |
| title_fullStr | How to solve it by induction |
| title_full_unstemmed | How to solve it by induction |
| title_short | How to solve it by induction |
| title_sort | how to solve it by induction |
| topic | Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic programming (Computer science) Automatic theorem proving |
| topic_facet | Bionics and artificial intelligence Computer software Mathematics Mathematik Automatic programming (Computer science) Automatic theorem proving |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT bundyalan howtosolveitbyinduction |