Increasing the versatility of heuristic based theorem provers:
Abstract: "Heuristic based theorem proving systems typically impose a fixed ordering on the strategies which they embody. The ordering reflects the general experience of the system designer. As a consequence, there will exist a variety of specific instances where the fixed ordering breaks down....
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1993
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
633 |
| Subjects: | |
| Summary: | Abstract: "Heuristic based theorem proving systems typically impose a fixed ordering on the strategies which they embody. The ordering reflects the general experience of the system designer. As a consequence, there will exist a variety of specific instances where the fixed ordering breaks down. We present an approach which liberates such systems by introducing a more versatile framework for organising proof strategies." |
| Physical Description: | 13 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035170164 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 081119s1993 |||| 00||| engod | ||
| 035 | |a (OCoLC)31073904 | ||
| 035 | |a (DE-599)BVBBV035170164 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Manning, Alistair |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Increasing the versatility of heuristic based theorem provers |
| 264 | 1 | |a Edinburgh |c 1993 | |
| 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 633 | |
| 520 | 3 | |a Abstract: "Heuristic based theorem proving systems typically impose a fixed ordering on the strategies which they embody. The ordering reflects the general experience of the system designer. As a consequence, there will exist a variety of specific instances where the fixed ordering breaks down. We present an approach which liberates such systems by introducing a more versatile framework for organising proof strategies." | |
| 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 theorem proving | |
| 700 | 1 | |a Ireland, Andrew |e Verfasser |4 aut | |
| 700 | 1 | |a Bundy, Alan |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 633 |w (DE-604)BV010450646 |9 633 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016977108 | ||
Record in the Search Index
| _version_ | 1804138337860059136 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Manning, Alistair Ireland, Andrew Bundy, Alan |
| author_facet | Manning, Alistair Ireland, Andrew Bundy, Alan |
| author_role | aut aut aut |
| author_sort | Manning, Alistair |
| author_variant | a m am a i ai a b ab |
| building | Verbundindex |
| bvnumber | BV035170164 |
| ctrlnum | (OCoLC)31073904 (DE-599)BVBBV035170164 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01610nam a2200361 cb4500</leader><controlfield tag="001">BV035170164</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">081119s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31073904</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035170164</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">Manning, Alistair</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Increasing the versatility of heuristic based theorem provers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1993</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">633</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Heuristic based theorem proving systems typically impose a fixed ordering on the strategies which they embody. The ordering reflects the general experience of the system designer. As a consequence, there will exist a variety of specific instances where the fixed ordering breaks down. We present an approach which liberates such systems by introducing a more versatile framework for organising proof strategies."</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 theorem proving</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ireland, Andrew</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bundy, 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">633</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">633</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016977108</subfield></datafield></record></collection> |
| id | DE-604.BV035170164 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T22:54:02Z |
| indexdate | 2024-07-09T21:26:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016977108 |
| oclc_num | 31073904 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Manning, Alistair Verfasser aut Increasing the versatility of heuristic based theorem provers Edinburgh 1993 13 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 633 Abstract: "Heuristic based theorem proving systems typically impose a fixed ordering on the strategies which they embody. The ordering reflects the general experience of the system designer. As a consequence, there will exist a variety of specific instances where the fixed ordering breaks down. We present an approach which liberates such systems by introducing a more versatile framework for organising proof strategies." Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic theorem proving Ireland, Andrew Verfasser aut Bundy, Alan Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 633 (DE-604)BV010450646 633 |
| spellingShingle | Manning, Alistair Ireland, Andrew Bundy, Alan Increasing the versatility of heuristic based theorem provers Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic theorem proving |
| title | Increasing the versatility of heuristic based theorem provers |
| title_auth | Increasing the versatility of heuristic based theorem provers |
| title_exact_search | Increasing the versatility of heuristic based theorem provers |
| title_exact_search_txtP | Increasing the versatility of heuristic based theorem provers |
| title_full | Increasing the versatility of heuristic based theorem provers |
| title_fullStr | Increasing the versatility of heuristic based theorem provers |
| title_full_unstemmed | Increasing the versatility of heuristic based theorem provers |
| title_short | Increasing the versatility of heuristic based theorem provers |
| title_sort | increasing the versatility of heuristic based theorem provers |
| topic | Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic theorem proving |
| topic_facet | Bionics and artificial intelligence Computer software Mathematics Mathematik Automatic theorem proving |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT manningalistair increasingtheversatilityofheuristicbasedtheoremprovers AT irelandandrew increasingtheversatilityofheuristicbasedtheoremprovers AT bundyalan increasingtheversatilityofheuristicbasedtheoremprovers |