Proof plans for the correction of false conjectures:
Abstract: "Theorem proving is the systematic derivation of a mathematical proof from a set of axioms by the use of rules of inference. We are interested in a related but far less explored problem: the analysis and correction of false conjectures, especially where that correction involves findin...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1994
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
681 |
| Subjects: | |
| Summary: | Abstract: "Theorem proving is the systematic derivation of a mathematical proof from a set of axioms by the use of rules of inference. We are interested in a related but far less explored problem: the analysis and correction of false conjectures, especially where that correction involves finding a collection of antecedents that, together with a set of axioms, transform non-theorems into theorems. Most failed search trees are huge, and special care is to be taken in order to tackle the combinatorial explosion phenomenon. Fortunately, the planning search space generated by proof plans, see [1], are moderately small. We have explored the possibility of using this technique in the implementation of an abduction mechanism to correct non-theorems." |
| Physical Description: | [12] S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010467263 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951109s1994 |||| 00||| engod | ||
| 035 | |a (OCoLC)32307192 | ||
| 035 | |a (DE-599)BVBBV010467263 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Monroy, Paul |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Proof plans for the correction of false conjectures |c Paul Monroy, Alan Bundy and Andrew Ireland |
| 264 | 1 | |a Edinburgh |c 1994 | |
| 300 | |a [12] 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 681 | |
| 520 | 3 | |a Abstract: "Theorem proving is the systematic derivation of a mathematical proof from a set of axioms by the use of rules of inference. We are interested in a related but far less explored problem: the analysis and correction of false conjectures, especially where that correction involves finding a collection of antecedents that, together with a set of axioms, transform non-theorems into theorems. Most failed search trees are huge, and special care is to be taken in order to tackle the combinatorial explosion phenomenon. Fortunately, the planning search space generated by proof plans, see [1], are moderately small. We have explored the possibility of using this technique in the implementation of an abduction mechanism to correct non-theorems." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Artificial intelligence | |
| 700 | 1 | |a Bundy, Alan |e Verfasser |4 aut | |
| 700 | 1 | |a Ireland, Andrew |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 681 |w (DE-604)BV010450646 |9 681 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006975080 | ||
Record in the Search Index
| _version_ | 1804124900430970880 |
|---|---|
| any_adam_object | |
| author | Monroy, Paul Bundy, Alan Ireland, Andrew |
| author_facet | Monroy, Paul Bundy, Alan Ireland, Andrew |
| author_role | aut aut aut |
| author_sort | Monroy, Paul |
| author_variant | p m pm a b ab a i ai |
| building | Verbundindex |
| bvnumber | BV010467263 |
| ctrlnum | (OCoLC)32307192 (DE-599)BVBBV010467263 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01967nam a2200361 cb4500</leader><controlfield tag="001">BV010467263</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951109s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32307192</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010467263</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">Monroy, Paul</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proof plans for the correction of false conjectures</subfield><subfield code="c">Paul Monroy, Alan Bundy and Andrew Ireland</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">[12] 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">681</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Theorem proving is the systematic derivation of a mathematical proof from a set of axioms by the use of rules of inference. We are interested in a related but far less explored problem: the analysis and correction of false conjectures, especially where that correction involves finding a collection of antecedents that, together with a set of axioms, transform non-theorems into theorems. Most failed search trees are huge, and special care is to be taken in order to tackle the combinatorial explosion phenomenon. Fortunately, the planning search space generated by proof plans, see [1], are moderately small. We have explored the possibility of using this technique in the implementation of an abduction mechanism to correct non-theorems."</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">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</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">Ireland, Andrew</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">681</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">681</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006975080</subfield></datafield></record></collection> |
| id | DE-604.BV010467263 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:53:01Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006975080 |
| oclc_num | 32307192 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | [12] S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Monroy, Paul Verfasser aut Proof plans for the correction of false conjectures Paul Monroy, Alan Bundy and Andrew Ireland Edinburgh 1994 [12] S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 681 Abstract: "Theorem proving is the systematic derivation of a mathematical proof from a set of axioms by the use of rules of inference. We are interested in a related but far less explored problem: the analysis and correction of false conjectures, especially where that correction involves finding a collection of antecedents that, together with a set of axioms, transform non-theorems into theorems. Most failed search trees are huge, and special care is to be taken in order to tackle the combinatorial explosion phenomenon. Fortunately, the planning search space generated by proof plans, see [1], are moderately small. We have explored the possibility of using this technique in the implementation of an abduction mechanism to correct non-theorems." Bionics and artificial intelligence sigle Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence Bundy, Alan Verfasser aut Ireland, Andrew Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 681 (DE-604)BV010450646 681 |
| spellingShingle | Monroy, Paul Bundy, Alan Ireland, Andrew Proof plans for the correction of false conjectures Bionics and artificial intelligence sigle Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence |
| title | Proof plans for the correction of false conjectures |
| title_auth | Proof plans for the correction of false conjectures |
| title_exact_search | Proof plans for the correction of false conjectures |
| title_full | Proof plans for the correction of false conjectures Paul Monroy, Alan Bundy and Andrew Ireland |
| title_fullStr | Proof plans for the correction of false conjectures Paul Monroy, Alan Bundy and Andrew Ireland |
| title_full_unstemmed | Proof plans for the correction of false conjectures Paul Monroy, Alan Bundy and Andrew Ireland |
| title_short | Proof plans for the correction of false conjectures |
| title_sort | proof plans for the correction of false conjectures |
| topic | Bionics and artificial intelligence sigle Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence |
| topic_facet | Bionics and artificial intelligence Mathematics Künstliche Intelligenz Mathematik Artificial intelligence |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT monroypaul proofplansforthecorrectionoffalseconjectures AT bundyalan proofplansforthecorrectionoffalseconjectures AT irelandandrew proofplansforthecorrectionoffalseconjectures |