The use of proof plans for normalization:
Abstract: "We propose using proof plans to implement expression normalizers in automatic theorem proving. We outline some general-purpose proof plans and show how these can be combined in various ways to yield some standard normalizers. We claim that using proof plans facilitates the flexible a...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1990
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
513 |
| Subjects: | |
| Summary: | Abstract: "We propose using proof plans to implement expression normalizers in automatic theorem proving. We outline some general-purpose proof plans and show how these can be combined in various ways to yield some standard normalizers. We claim that using proof plans facilitates the flexible application of these normalizers so that they can interact with the theorem prover in which they are embedded. We intend to extend this technique to decision procedures." |
| Physical Description: | 13 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010452984 | ||
| 003 | DE-604 | ||
| 007 | t | ||
| 008 | 951027s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)1071359633 | ||
| 035 | |a (DE-599)BVBBV010452984 | ||
| 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 The use of proof plans for normalization |
| 264 | 1 | |a Edinburgh |c 1990 | |
| 300 | |a 13 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 513 | |
| 520 | 3 | |a Abstract: "We propose using proof plans to implement expression normalizers in automatic theorem proving. We outline some general-purpose proof plans and show how these can be combined in various ways to yield some standard normalizers. We claim that using proof plans facilitates the flexible application of these normalizers so that they can interact with the theorem prover in which they are embedded. We intend to extend this technique to decision procedures." | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Automatic theorem proving | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 513 |w (DE-604)BV010450646 |9 513 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006965798 | |
Record in the Search Index
| _version_ | 1812974138994720768 |
|---|---|
| adam_text | |
| 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 | BV010452984 |
| ctrlnum | (OCoLC)1071359633 (DE-599)BVBBV010452984 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010452984</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951027s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1071359633</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010452984</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">The use of proof plans for normalization</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">13 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">513</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We propose using proof plans to implement expression normalizers in automatic theorem proving. We outline some general-purpose proof plans and show how these can be combined in various ways to yield some standard normalizers. We claim that using proof plans facilitates the flexible application of these normalizers so that they can interact with the theorem prover in which they are embedded. We intend to extend this technique to decision procedures."</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="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">513</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">513</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006965798</subfield></datafield></record></collection> |
| id | DE-604.BV010452984 |
| illustrated | Not Illustrated |
| indexdate | 2024-10-15T10:07:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006965798 |
| oclc_num | 1071359633 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 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 The use of proof plans for normalization Edinburgh 1990 13 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 513 Abstract: "We propose using proof plans to implement expression normalizers in automatic theorem proving. We outline some general-purpose proof plans and show how these can be combined in various ways to yield some standard normalizers. We claim that using proof plans facilitates the flexible application of these normalizers so that they can interact with the theorem prover in which they are embedded. We intend to extend this technique to decision procedures." Computer software sigle Automatic theorem proving Department of Artificial Intelligence: DAI research paper University <Edinburgh> 513 (DE-604)BV010450646 513 |
| spellingShingle | Bundy, Alan The use of proof plans for normalization Computer software sigle Automatic theorem proving |
| title | The use of proof plans for normalization |
| title_auth | The use of proof plans for normalization |
| title_exact_search | The use of proof plans for normalization |
| title_full | The use of proof plans for normalization |
| title_fullStr | The use of proof plans for normalization |
| title_full_unstemmed | The use of proof plans for normalization |
| title_short | The use of proof plans for normalization |
| title_sort | the use of proof plans for normalization |
| topic | Computer software sigle Automatic theorem proving |
| topic_facet | Computer software Automatic theorem proving |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT bundyalan theuseofproofplansfornormalization |