The Boyer-Moore prover and NUPRL: an experimental comparison
Abstract: "We use an example to compare the Boyer-Moore Theorem Prover and the Nuprl Proof Development System. The respective machine verifications of a version of Ramsey's theorem illustrate similarities and differences between the two systems. The proofs are compared using both quantitat...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1991
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
525 |
| Subjects: | |
| Summary: | Abstract: "We use an example to compare the Boyer-Moore Theorem Prover and the Nuprl Proof Development System. The respective machine verifications of a version of Ramsey's theorem illustrate similarities and differences between the two systems. The proofs are compared using both quantitative and non-quantitative measures, and we examine difficulties in making such comparisons." |
| Physical Description: | 23 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010453625 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951030s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)24892607 | ||
| 035 | |a (DE-599)BVBBV010453625 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Basin, David |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The Boyer-Moore prover and NUPRL |b an experimental comparison |c David Basin ; Matt Kaufmann |
| 264 | 1 | |a Edinburgh |c 1991 | |
| 300 | |a 23 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 525 | |
| 520 | 3 | |a Abstract: "We use an example to compare the Boyer-Moore Theorem Prover and the Nuprl Proof Development System. The respective machine verifications of a version of Ramsey's theorem illustrate similarities and differences between the two systems. The proofs are compared using both quantitative and non-quantitative measures, and we examine difficulties in making such comparisons." | |
| 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 Kaufmann, Matt |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 525 |w (DE-604)BV010450646 |9 525 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006966364 | ||
Record in the Search Index
| _version_ | 1804124887160193024 |
|---|---|
| any_adam_object | |
| author | Basin, David Kaufmann, Matt |
| author_facet | Basin, David Kaufmann, Matt |
| author_role | aut aut |
| author_sort | Basin, David |
| author_variant | d b db m k mk |
| building | Verbundindex |
| bvnumber | BV010453625 |
| ctrlnum | (OCoLC)24892607 (DE-599)BVBBV010453625 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01491nam a2200337 cb4500</leader><controlfield tag="001">BV010453625</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951030s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24892607</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010453625</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">Basin, David</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Boyer-Moore prover and NUPRL</subfield><subfield code="b">an experimental comparison</subfield><subfield code="c">David Basin ; Matt Kaufmann</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23 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">525</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We use an example to compare the Boyer-Moore Theorem Prover and the Nuprl Proof Development System. The respective machine verifications of a version of Ramsey's theorem illustrate similarities and differences between the two systems. The proofs are compared using both quantitative and non-quantitative measures, and we examine difficulties in making such comparisons."</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">Kaufmann, Matt</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">525</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">525</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006966364</subfield></datafield></record></collection> |
| id | DE-604.BV010453625 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:48Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006966364 |
| oclc_num | 24892607 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 23 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Basin, David Verfasser aut The Boyer-Moore prover and NUPRL an experimental comparison David Basin ; Matt Kaufmann Edinburgh 1991 23 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 525 Abstract: "We use an example to compare the Boyer-Moore Theorem Prover and the Nuprl Proof Development System. The respective machine verifications of a version of Ramsey's theorem illustrate similarities and differences between the two systems. The proofs are compared using both quantitative and non-quantitative measures, and we examine difficulties in making such comparisons." Computer software sigle Mathematics sigle Mathematik Automatic theorem proving Kaufmann, Matt Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 525 (DE-604)BV010450646 525 |
| spellingShingle | Basin, David Kaufmann, Matt The Boyer-Moore prover and NUPRL an experimental comparison Computer software sigle Mathematics sigle Mathematik Automatic theorem proving |
| title | The Boyer-Moore prover and NUPRL an experimental comparison |
| title_auth | The Boyer-Moore prover and NUPRL an experimental comparison |
| title_exact_search | The Boyer-Moore prover and NUPRL an experimental comparison |
| title_full | The Boyer-Moore prover and NUPRL an experimental comparison David Basin ; Matt Kaufmann |
| title_fullStr | The Boyer-Moore prover and NUPRL an experimental comparison David Basin ; Matt Kaufmann |
| title_full_unstemmed | The Boyer-Moore prover and NUPRL an experimental comparison David Basin ; Matt Kaufmann |
| title_short | The Boyer-Moore prover and NUPRL |
| title_sort | the boyer moore prover and nuprl an experimental comparison |
| title_sub | an experimental comparison |
| topic | Computer software sigle Mathematics sigle Mathematik Automatic theorem proving |
| topic_facet | Computer software Mathematics Mathematik Automatic theorem proving |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT basindavid theboyermooreproverandnuprlanexperimentalcomparison AT kaufmannmatt theboyermooreproverandnuprlanexperimentalcomparison |