Analogy driven proof plan construction:
Abstract: "This paper addresses analogy-driven automated theorem proving. More precisely, we consider analogy as a control strategy in proof planning and employ a source proof-plan to guide the search for a proof-plan of the target problem. The approach presented employs restructuring and refor...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1995
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
735 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper addresses analogy-driven automated theorem proving. More precisely, we consider analogy as a control strategy in proof planning and employ a source proof-plan to guide the search for a proof-plan of the target problem. The approach presented employs restructuring and reformulations. Reformulations go beyond symbol mappings and may encode certain re-representations. This is in accordance with the well known fact that constructing an analogy in mathematics often amounts to finding the appropriate representation which brings out the similarity of two problems, that is, finding the right concepts and the right level of abstraction. Several realistic math examples were successfully processed by our analogy-driven proof-plan construction. One of these examples is discussed here." |
| Beschreibung: | 31 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011043567 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961107s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)34820496 | ||
| 035 | |a (DE-599)BVBBV011043567 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Melkis, Erica |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Analogy driven proof plan construction |c Melis, E. |
| 264 | 1 | |a Edinburgh |c 1995 | |
| 300 | |a 31 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 735 | |
| 520 | 3 | |a Abstract: "This paper addresses analogy-driven automated theorem proving. More precisely, we consider analogy as a control strategy in proof planning and employ a source proof-plan to guide the search for a proof-plan of the target problem. The approach presented employs restructuring and reformulations. Reformulations go beyond symbol mappings and may encode certain re-representations. This is in accordance with the well known fact that constructing an analogy in mathematics often amounts to finding the appropriate representation which brings out the similarity of two problems, that is, finding the right concepts and the right level of abstraction. Several realistic math examples were successfully processed by our analogy-driven proof-plan construction. One of these examples is discussed here." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Analogy | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Control theory | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 735 |w (DE-604)BV010450646 |9 735 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007394864 | ||
Datensatz im Suchindex
| _version_ | 1804125532850225152 |
|---|---|
| any_adam_object | |
| author | Melkis, Erica |
| author_facet | Melkis, Erica |
| author_role | aut |
| author_sort | Melkis, Erica |
| author_variant | e m em |
| building | Verbundindex |
| bvnumber | BV011043567 |
| ctrlnum | (OCoLC)34820496 (DE-599)BVBBV011043567 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01899nam a2200349 cb4500</leader><controlfield tag="001">BV011043567</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961107s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34820496</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011043567</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">Melkis, Erica</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analogy driven proof plan construction</subfield><subfield code="c">Melis, E.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">31 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">735</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper addresses analogy-driven automated theorem proving. More precisely, we consider analogy as a control strategy in proof planning and employ a source proof-plan to guide the search for a proof-plan of the target problem. The approach presented employs restructuring and reformulations. Reformulations go beyond symbol mappings and may encode certain re-representations. This is in accordance with the well known fact that constructing an analogy in mathematics often amounts to finding the appropriate representation which brings out the similarity of two problems, that is, finding the right concepts and the right level of abstraction. Several realistic math examples were successfully processed by our analogy-driven proof-plan construction. One of these examples is discussed here."</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">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">Analogy</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">Control theory</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">735</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">735</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007394864</subfield></datafield></record></collection> |
| id | DE-604.BV011043567 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007394864 |
| oclc_num | 34820496 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 31 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Melkis, Erica Verfasser aut Analogy driven proof plan construction Melis, E. Edinburgh 1995 31 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 735 Abstract: "This paper addresses analogy-driven automated theorem proving. More precisely, we consider analogy as a control strategy in proof planning and employ a source proof-plan to guide the search for a proof-plan of the target problem. The approach presented employs restructuring and reformulations. Reformulations go beyond symbol mappings and may encode certain re-representations. This is in accordance with the well known fact that constructing an analogy in mathematics often amounts to finding the appropriate representation which brings out the similarity of two problems, that is, finding the right concepts and the right level of abstraction. Several realistic math examples were successfully processed by our analogy-driven proof-plan construction. One of these examples is discussed here." Bionics and artificial intelligence sigle Mathematics sigle Mathematik Analogy Automatic theorem proving Control theory Department of Artificial Intelligence: DAI research paper University <Edinburgh> 735 (DE-604)BV010450646 735 |
| spellingShingle | Melkis, Erica Analogy driven proof plan construction Bionics and artificial intelligence sigle Mathematics sigle Mathematik Analogy Automatic theorem proving Control theory |
| title | Analogy driven proof plan construction |
| title_auth | Analogy driven proof plan construction |
| title_exact_search | Analogy driven proof plan construction |
| title_full | Analogy driven proof plan construction Melis, E. |
| title_fullStr | Analogy driven proof plan construction Melis, E. |
| title_full_unstemmed | Analogy driven proof plan construction Melis, E. |
| title_short | Analogy driven proof plan construction |
| title_sort | analogy driven proof plan construction |
| topic | Bionics and artificial intelligence sigle Mathematics sigle Mathematik Analogy Automatic theorem proving Control theory |
| topic_facet | Bionics and artificial intelligence Mathematics Mathematik Analogy Automatic theorem proving Control theory |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT melkiserica analogydrivenproofplanconstruction |