Using connectionist networks for guiding the search of a theorem prover:
Abstract: "Automated Theorem Proving (ATP) is a difficult area for which no acceptable solution has been found yet. In order to derive better ATP systems, the appropriate exploitation of empirical knowledge about proving is a fundamental attempt. To achieve this goal, a symbiosis between a conv...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
München
1990
|
| Series: | Technische Universität <München>: TUM
9011 |
| Subjects: | |
| Summary: | Abstract: "Automated Theorem Proving (ATP) is a difficult area for which no acceptable solution has been found yet. In order to derive better ATP systems, the appropriate exploitation of empirical knowledge about proving is a fundamental attempt. To achieve this goal, a symbiosis between a conventional symbolic theorem prover and a connectionist network is proposed. While the prover operates in its usual way, nondeterministic branch-points are resolved by the intuition trained into a network. With this approach it was possible to reduce the search space for proving theorems. Several experiments are presented showing particular improvements." |
| Physical Description: | 18 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008950073 | ||
| 003 | DE-604 | ||
| 005 | 19941021 | ||
| 007 | t | ||
| 008 | 940206s1990 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)25310801 | ||
| 035 | |a (DE-599)BVBBV008950073 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Suttner, Christian |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Using connectionist networks for guiding the search of a theorem prover |c Christian Suttner ; Wolfgang Ertel |
| 264 | 1 | |a München |c 1990 | |
| 300 | |a 18 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM |v 9011 | |
| 490 | 1 | |a Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht / A |v 1990,8 | |
| 520 | 3 | |a Abstract: "Automated Theorem Proving (ATP) is a difficult area for which no acceptable solution has been found yet. In order to derive better ATP systems, the appropriate exploitation of empirical knowledge about proving is a fundamental attempt. To achieve this goal, a symbiosis between a conventional symbolic theorem prover and a connectionist network is proposed. While the prover operates in its usual way, nondeterministic branch-points are resolved by the intuition trained into a network. With this approach it was possible to reduce the search space for proving theorems. Several experiments are presented showing particular improvements." | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Connectionism | |
| 650 | 4 | |a Machine learning | |
| 700 | 1 | |a Ertel, Wolfgang |e Verfasser |4 aut | |
| 810 | 2 | |a A |t Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht |v 1990,8 |w (DE-604)BV004627888 |9 1990,8 | |
| 830 | 0 | |a Technische Universität <München>: TUM |v 9011 |w (DE-604)BV006185376 |9 9011 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005905671 | ||
Record in the Search Index
| _version_ | 1804123283295043584 |
|---|---|
| any_adam_object | |
| author | Suttner, Christian Ertel, Wolfgang |
| author_facet | Suttner, Christian Ertel, Wolfgang |
| author_role | aut aut |
| author_sort | Suttner, Christian |
| author_variant | c s cs w e we |
| building | Verbundindex |
| bvnumber | BV008950073 |
| ctrlnum | (OCoLC)25310801 (DE-599)BVBBV008950073 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01974nam a2200349 cb4500</leader><controlfield tag="001">BV008950073</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19941021 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25310801</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008950073</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Suttner, Christian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Using connectionist networks for guiding the search of a theorem prover</subfield><subfield code="c">Christian Suttner ; Wolfgang Ertel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 S.</subfield><subfield code="b">graph. Darst.</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">Technische Universität <München>: TUM</subfield><subfield code="v">9011</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht / A</subfield><subfield code="v">1990,8</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Automated Theorem Proving (ATP) is a difficult area for which no acceptable solution has been found yet. In order to derive better ATP systems, the appropriate exploitation of empirical knowledge about proving is a fundamental attempt. To achieve this goal, a symbiosis between a conventional symbolic theorem prover and a connectionist network is proposed. While the prover operates in its usual way, nondeterministic branch-points are resolved by the intuition trained into a network. With this approach it was possible to reduce the search space for proving theorems. Several experiments are presented showing particular improvements."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Connectionism</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine learning</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ertel, Wolfgang</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">A</subfield><subfield code="t">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht</subfield><subfield code="v">1990,8</subfield><subfield code="w">(DE-604)BV004627888</subfield><subfield code="9">1990,8</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM</subfield><subfield code="v">9011</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9011</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905671</subfield></datafield></record></collection> |
| id | DE-604.BV008950073 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:27:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905671 |
| oclc_num | 25310801 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 18 S. graph. Darst. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Technische Universität <München>: TUM |
| series2 | Technische Universität <München>: TUM Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht / A |
| spelling | Suttner, Christian Verfasser aut Using connectionist networks for guiding the search of a theorem prover Christian Suttner ; Wolfgang Ertel München 1990 18 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM 9011 Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht / A 1990,8 Abstract: "Automated Theorem Proving (ATP) is a difficult area for which no acceptable solution has been found yet. In order to derive better ATP systems, the appropriate exploitation of empirical knowledge about proving is a fundamental attempt. To achieve this goal, a symbiosis between a conventional symbolic theorem prover and a connectionist network is proposed. While the prover operates in its usual way, nondeterministic branch-points are resolved by the intuition trained into a network. With this approach it was possible to reduce the search space for proving theorems. Several experiments are presented showing particular improvements." Automatic theorem proving Connectionism Machine learning Ertel, Wolfgang Verfasser aut A Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht 1990,8 (DE-604)BV004627888 1990,8 Technische Universität <München>: TUM 9011 (DE-604)BV006185376 9011 |
| spellingShingle | Suttner, Christian Ertel, Wolfgang Using connectionist networks for guiding the search of a theorem prover Technische Universität <München>: TUM Automatic theorem proving Connectionism Machine learning |
| title | Using connectionist networks for guiding the search of a theorem prover |
| title_auth | Using connectionist networks for guiding the search of a theorem prover |
| title_exact_search | Using connectionist networks for guiding the search of a theorem prover |
| title_full | Using connectionist networks for guiding the search of a theorem prover Christian Suttner ; Wolfgang Ertel |
| title_fullStr | Using connectionist networks for guiding the search of a theorem prover Christian Suttner ; Wolfgang Ertel |
| title_full_unstemmed | Using connectionist networks for guiding the search of a theorem prover Christian Suttner ; Wolfgang Ertel |
| title_short | Using connectionist networks for guiding the search of a theorem prover |
| title_sort | using connectionist networks for guiding the search of a theorem prover |
| topic | Automatic theorem proving Connectionism Machine learning |
| topic_facet | Automatic theorem proving Connectionism Machine learning |
| volume_link | (DE-604)BV004627888 (DE-604)BV006185376 |
| work_keys_str_mv | AT suttnerchristian usingconnectionistnetworksforguidingthesearchofatheoremprover AT ertelwolfgang usingconnectionistnetworksforguidingthesearchofatheoremprover |