The use of proof planning for cooperative theorem proving:
Abstract: "We describe BARNACLE: a cooperative interface to an inductive theorem prover. The cooperative nature of the BARNACLE interface is made possible by proof planning. Proof planning is a technique for guiding the search for a proof in automatic theorem proving. Common patterns of reasoni...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1995
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
745 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We describe BARNACLE: a cooperative interface to an inductive theorem prover. The cooperative nature of the BARNACLE interface is made possible by proof planning. Proof planning is a technique for guiding the search for a proof in automatic theorem proving. Common patterns of reasoning in proofs are identified and represented computationally as proof plans. These proof plans are then used to guide the search for proofs of new conjectures. Where a proof requires more than common patterns of reasoning, proof planning needs to be supplemented by human interaction. Proof planning makes new kinds of user interaction possible. Proof plans structure proofs hierarchically. This can be used to present partial proofs to users without overwhelming them with detail. Proof plans use a meta-logic to relate each chunk of a proof to its parents and daughters in the hierarchy and to its subparts. Proof plans sometimes annotate the proof steps to display the rationale behind them. The relations between proof chunks and the annotations can both be used to help users understand the state of proof attempts. This improved understanding can help them find patches to failed proofs and the meta-logic provides a high-level language for specifying the patch." |
| Beschreibung: | 18 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011043839 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961107s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)35073085 | ||
| 035 | |a (DE-599)BVBBV011043839 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Lowe, Helen |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The use of proof planning for cooperative theorem proving |c Helen Lowe, Alan Bundy, & Duncan McLean |
| 264 | 1 | |a Edinburgh |c 1995 | |
| 300 | |a 18 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 745 | |
| 520 | 3 | |a Abstract: "We describe BARNACLE: a cooperative interface to an inductive theorem prover. The cooperative nature of the BARNACLE interface is made possible by proof planning. Proof planning is a technique for guiding the search for a proof in automatic theorem proving. Common patterns of reasoning in proofs are identified and represented computationally as proof plans. These proof plans are then used to guide the search for proofs of new conjectures. Where a proof requires more than common patterns of reasoning, proof planning needs to be supplemented by human interaction. Proof planning makes new kinds of user interaction possible. Proof plans structure proofs hierarchically. This can be used to present partial proofs to users without overwhelming them with detail. Proof plans use a meta-logic to relate each chunk of a proof to its parents and daughters in the hierarchy and to its subparts. Proof plans sometimes annotate the proof steps to display the rationale behind them. The relations between proof chunks and the annotations can both be used to help users understand the state of proof attempts. This improved understanding can help them find patches to failed proofs and the meta-logic provides a high-level language for specifying the patch." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Automatic theorem proving |x Computer programs | |
| 700 | 1 | |a Bundy, Alan |e Verfasser |4 aut | |
| 700 | 1 | |a McLean, Duncan |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 745 |w (DE-604)BV010450646 |9 745 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007395116 | ||
Datensatz im Suchindex
| _version_ | 1804125533202546689 |
|---|---|
| any_adam_object | |
| author | Lowe, Helen Bundy, Alan McLean, Duncan |
| author_facet | Lowe, Helen Bundy, Alan McLean, Duncan |
| author_role | aut aut aut |
| author_sort | Lowe, Helen |
| author_variant | h l hl a b ab d m dm |
| building | Verbundindex |
| bvnumber | BV011043839 |
| ctrlnum | (OCoLC)35073085 (DE-599)BVBBV011043839 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02441nam a2200337 cb4500</leader><controlfield tag="001">BV011043839</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)35073085</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011043839</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">Lowe, Helen</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 planning for cooperative theorem proving</subfield><subfield code="c">Helen Lowe, Alan Bundy, & Duncan McLean</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">18 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">745</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We describe BARNACLE: a cooperative interface to an inductive theorem prover. The cooperative nature of the BARNACLE interface is made possible by proof planning. Proof planning is a technique for guiding the search for a proof in automatic theorem proving. Common patterns of reasoning in proofs are identified and represented computationally as proof plans. These proof plans are then used to guide the search for proofs of new conjectures. Where a proof requires more than common patterns of reasoning, proof planning needs to be supplemented by human interaction. Proof planning makes new kinds of user interaction possible. Proof plans structure proofs hierarchically. This can be used to present partial proofs to users without overwhelming them with detail. Proof plans use a meta-logic to relate each chunk of a proof to its parents and daughters in the hierarchy and to its subparts. Proof plans sometimes annotate the proof steps to display the rationale behind them. The relations between proof chunks and the annotations can both be used to help users understand the state of proof attempts. This improved understanding can help them find patches to failed proofs and the meta-logic provides a high-level language for specifying the patch."</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="4"><subfield code="a">Automatic theorem proving</subfield><subfield code="x">Computer programs</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="700" ind1="1" ind2=" "><subfield code="a">McLean, Duncan</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">745</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">745</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007395116</subfield></datafield></record></collection> |
| id | DE-604.BV011043839 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007395116 |
| oclc_num | 35073085 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 18 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Lowe, Helen Verfasser aut The use of proof planning for cooperative theorem proving Helen Lowe, Alan Bundy, & Duncan McLean Edinburgh 1995 18 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 745 Abstract: "We describe BARNACLE: a cooperative interface to an inductive theorem prover. The cooperative nature of the BARNACLE interface is made possible by proof planning. Proof planning is a technique for guiding the search for a proof in automatic theorem proving. Common patterns of reasoning in proofs are identified and represented computationally as proof plans. These proof plans are then used to guide the search for proofs of new conjectures. Where a proof requires more than common patterns of reasoning, proof planning needs to be supplemented by human interaction. Proof planning makes new kinds of user interaction possible. Proof plans structure proofs hierarchically. This can be used to present partial proofs to users without overwhelming them with detail. Proof plans use a meta-logic to relate each chunk of a proof to its parents and daughters in the hierarchy and to its subparts. Proof plans sometimes annotate the proof steps to display the rationale behind them. The relations between proof chunks and the annotations can both be used to help users understand the state of proof attempts. This improved understanding can help them find patches to failed proofs and the meta-logic provides a high-level language for specifying the patch." Bionics and artificial intelligence sigle Computer software sigle Automatic theorem proving Computer programs Bundy, Alan Verfasser aut McLean, Duncan Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 745 (DE-604)BV010450646 745 |
| spellingShingle | Lowe, Helen Bundy, Alan McLean, Duncan The use of proof planning for cooperative theorem proving Bionics and artificial intelligence sigle Computer software sigle Automatic theorem proving Computer programs |
| title | The use of proof planning for cooperative theorem proving |
| title_auth | The use of proof planning for cooperative theorem proving |
| title_exact_search | The use of proof planning for cooperative theorem proving |
| title_full | The use of proof planning for cooperative theorem proving Helen Lowe, Alan Bundy, & Duncan McLean |
| title_fullStr | The use of proof planning for cooperative theorem proving Helen Lowe, Alan Bundy, & Duncan McLean |
| title_full_unstemmed | The use of proof planning for cooperative theorem proving Helen Lowe, Alan Bundy, & Duncan McLean |
| title_short | The use of proof planning for cooperative theorem proving |
| title_sort | the use of proof planning for cooperative theorem proving |
| topic | Bionics and artificial intelligence sigle Computer software sigle Automatic theorem proving Computer programs |
| topic_facet | Bionics and artificial intelligence Computer software Automatic theorem proving Computer programs |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT lowehelen theuseofproofplanningforcooperativetheoremproving AT bundyalan theuseofproofplanningforcooperativetheoremproving AT mcleanduncan theuseofproofplanningforcooperativetheoremproving |