Abstract theorem proving: mapping back:
Abstract: "Abstraction is a very powerful heuristic that has often been used in theorem proving (eg. [Pla81, Pla86, Ten87, Imi87, GW89b]). This paper uses the general theory of abstration presented in [GW89a] to consider the problem of how an abstract solution can be 'mapped back' ont...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1990
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
460 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Abstraction is a very powerful heuristic that has often been used in theorem proving (eg. [Pla81, Pla86, Ten87, Imi87, GW89b]). This paper uses the general theory of abstration presented in [GW89a] to consider the problem of how an abstract solution can be 'mapped back' onto a solution of the original problem. We describe the basic ideas and report some experimental results." |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010451648 | ||
| 003 | DE-604 | ||
| 005 | 19981022 | ||
| 007 | t | ||
| 008 | 951026s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)22285527 | ||
| 035 | |a (DE-599)BVBBV010451648 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Giunchiglia, Fausto |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Abstract theorem proving: mapping back |c Fausto Giunchiglia ; Toby Walsh |
| 264 | 1 | |a Edinburgh |c 1990 | |
| 300 | |a 16 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 460 | |
| 520 | 3 | |a Abstract: "Abstraction is a very powerful heuristic that has often been used in theorem proving (eg. [Pla81, Pla86, Ten87, Imi87, GW89b]). This paper uses the general theory of abstration presented in [GW89a] to consider the problem of how an abstract solution can be 'mapped back' onto a solution of the original problem. We describe the basic ideas and report some experimental results." | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Information theory |2 sigle | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Mappings (Mathematics) | |
| 700 | 1 | |a Walsh, Toby |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 460 |w (DE-604)BV010450646 |9 460 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006964673 | ||
Datensatz im Suchindex
| _version_ | 1804124884597473280 |
|---|---|
| any_adam_object | |
| author | Giunchiglia, Fausto Walsh, Toby |
| author_facet | Giunchiglia, Fausto Walsh, Toby |
| author_role | aut aut |
| author_sort | Giunchiglia, Fausto |
| author_variant | f g fg t w tw |
| building | Verbundindex |
| bvnumber | BV010451648 |
| ctrlnum | (OCoLC)22285527 (DE-599)BVBBV010451648 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01500nam a2200337 cb4500</leader><controlfield tag="001">BV010451648</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19981022 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951026s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22285527</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010451648</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">Giunchiglia, Fausto</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Abstract theorem proving: mapping back</subfield><subfield code="c">Fausto Giunchiglia ; Toby Walsh</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">16 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">460</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Abstraction is a very powerful heuristic that has often been used in theorem proving (eg. [Pla81, Pla86, Ten87, Imi87, GW89b]). This paper uses the general theory of abstration presented in [GW89a] to consider the problem of how an abstract solution can be 'mapped back' onto a solution of the original problem. We describe the basic ideas and report some experimental results."</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">Information theory</subfield><subfield code="2">sigle</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">Mappings (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Walsh, Toby</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">460</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">460</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006964673</subfield></datafield></record></collection> |
| id | DE-604.BV010451648 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:45Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006964673 |
| oclc_num | 22285527 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Giunchiglia, Fausto Verfasser aut Abstract theorem proving: mapping back Fausto Giunchiglia ; Toby Walsh Edinburgh 1990 16 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 460 Abstract: "Abstraction is a very powerful heuristic that has often been used in theorem proving (eg. [Pla81, Pla86, Ten87, Imi87, GW89b]). This paper uses the general theory of abstration presented in [GW89a] to consider the problem of how an abstract solution can be 'mapped back' onto a solution of the original problem. We describe the basic ideas and report some experimental results." Computer software sigle Information theory sigle Automatic theorem proving Mappings (Mathematics) Walsh, Toby Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 460 (DE-604)BV010450646 460 |
| spellingShingle | Giunchiglia, Fausto Walsh, Toby Abstract theorem proving: mapping back Computer software sigle Information theory sigle Automatic theorem proving Mappings (Mathematics) |
| title | Abstract theorem proving: mapping back |
| title_auth | Abstract theorem proving: mapping back |
| title_exact_search | Abstract theorem proving: mapping back |
| title_full | Abstract theorem proving: mapping back Fausto Giunchiglia ; Toby Walsh |
| title_fullStr | Abstract theorem proving: mapping back Fausto Giunchiglia ; Toby Walsh |
| title_full_unstemmed | Abstract theorem proving: mapping back Fausto Giunchiglia ; Toby Walsh |
| title_short | Abstract theorem proving: mapping back |
| title_sort | abstract theorem proving mapping back |
| topic | Computer software sigle Information theory sigle Automatic theorem proving Mappings (Mathematics) |
| topic_facet | Computer software Information theory Automatic theorem proving Mappings (Mathematics) |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT giunchigliafausto abstracttheoremprovingmappingback AT walshtoby abstracttheoremprovingmappingback |