The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysis
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | German |
| Veröffentlicht: |
Wiesbaden
Vieweg+Teubner Verlag
1997
|
| Schriftenreihe: | Computational Intelligence
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | We analyze the search efficiency of a number of common refutational theorem proving strategies on propositional and near-propositional problems. Search efficiency is concerned with the total number of proofs and partial proofs generated, rather than with the sizes of the proofs. We show that most common strategies produce search spaces of exponential size even on simple sets of clauses, or else are not sensitive to the goal. However, clause linking, which uses a reduction to propositional calculus, has behavior that is more favorable in some respects, a property that it shares with methods that cache subgoals. A strategy which is of interest for term-rewriting based theorem proving is the A-ordering strategy, and we discuss it in some detail. We show some advantages of A-ordering over other strategies, which may help to explain its efficiency in practice. We also point out some of its combinatorial inefficiencies, especially in relation to goal-sensitivity and irrelevant clauses. In addition, SLD-resolution, which is of importance for Prolog implementation, has combinatorial inefficiencies; this may suggest basing Prolog implementations on a different theorem proving strategy. We also develop techniques for studying the asymptotic complexity of first-order theorem provers. This permits an analytic comparison of the worst-case performances of various theorem proving methods. We show that the speeds of various well-known methods range in complexity from singe to quintuple exponential with respect to various natural measures of the hardness of the input |
| Beschreibung: | 1 Online-Ressource (VI, 167S.) |
| ISBN: | 9783322938626 9783528055745 |
| DOI: | 10.1007/978-3-322-93862-6 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042430781 | ||
| 003 | DE-604 | ||
| 005 | 20180126 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150320s1997 |||| o||u| ||||||ger d | ||
| 020 | |a 9783322938626 |c Online |9 978-3-322-93862-6 | ||
| 020 | |a 9783528055745 |c Print |9 978-3-528-05574-5 | ||
| 024 | 7 | |a 10.1007/978-3-322-93862-6 |2 doi | |
| 035 | |a (OCoLC)907314254 | ||
| 035 | |a (DE-599)BVBBV042430781 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-91 |a DE-634 |a DE-92 |a DE-573 |a DE-706 |a DE-860 |a DE-1046 |a DE-Aug4 | ||
| 082 | 0 | |a 620 |2 23 | |
| 084 | |a DAT 000 |2 stub | ||
| 084 | |a TEC 000 |2 stub | ||
| 100 | 1 | |a Plaisted, David A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The Efficiency of Theorem Proving Strategies |b A Comparative and Asymptotic Analysis |c von David A. Plaisted, Yunshan Zhu |
| 264 | 1 | |a Wiesbaden |b Vieweg+Teubner Verlag |c 1997 | |
| 300 | |a 1 Online-Ressource (VI, 167S.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Computational Intelligence | |
| 500 | |a We analyze the search efficiency of a number of common refutational theorem proving strategies on propositional and near-propositional problems. Search efficiency is concerned with the total number of proofs and partial proofs generated, rather than with the sizes of the proofs. We show that most common strategies produce search spaces of exponential size even on simple sets of clauses, or else are not sensitive to the goal. However, clause linking, which uses a reduction to propositional calculus, has behavior that is more favorable in some respects, a property that it shares with methods that cache subgoals. A strategy which is of interest for term-rewriting based theorem proving is the A-ordering strategy, and we discuss it in some detail. We show some advantages of A-ordering over other strategies, which may help to explain its efficiency in practice. We also point out some of its combinatorial inefficiencies, especially in relation to goal-sensitivity and irrelevant clauses. In addition, SLD-resolution, which is of importance for Prolog implementation, has combinatorial inefficiencies; this may suggest basing Prolog implementations on a different theorem proving strategy. We also develop techniques for studying the asymptotic complexity of first-order theorem provers. This permits an analytic comparison of the worst-case performances of various theorem proving methods. We show that the speeds of various well-known methods range in complexity from singe to quintuple exponential with respect to various natural measures of the hardness of the input | ||
| 650 | 4 | |a Engineering | |
| 650 | 4 | |a Engineering, general | |
| 650 | 4 | |a Ingenieurwissenschaften | |
| 650 | 0 | 7 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Zhu, Yunshan |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-322-93862-6 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-STI |a ZDB-2-BAD | ||
| 940 | 1 | |q ZDB-2-STI_Archive | |
| 940 | 1 | |q ZDB-2-STI_1990/1999 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027866112 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153113137905664 |
|---|---|
| any_adam_object | |
| author | Plaisted, David A. |
| author_facet | Plaisted, David A. |
| author_role | aut |
| author_sort | Plaisted, David A. |
| author_variant | d a p da dap |
| building | Verbundindex |
| bvnumber | BV042430781 |
| classification_tum | DAT 000 TEC 000 |
| collection | ZDB-2-STI ZDB-2-BAD |
| ctrlnum | (OCoLC)907314254 (DE-599)BVBBV042430781 |
| dewey-full | 620 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 620 - Engineering and allied operations |
| dewey-raw | 620 |
| dewey-search | 620 |
| dewey-sort | 3620 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Technik Technik Informatik |
| doi_str_mv | 10.1007/978-3-322-93862-6 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03294nmm a2200481zc 4500</leader><controlfield tag="001">BV042430781</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180126 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150320s1997 |||| o||u| ||||||ger d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783322938626</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-322-93862-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783528055745</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-528-05574-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-322-93862-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)907314254</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042430781</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-Aug4</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">620</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">TEC 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Plaisted, David A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Efficiency of Theorem Proving Strategies</subfield><subfield code="b">A Comparative and Asymptotic Analysis</subfield><subfield code="c">von David A. Plaisted, Yunshan Zhu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Wiesbaden</subfield><subfield code="b">Vieweg+Teubner Verlag</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VI, 167S.)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Computational Intelligence</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">We analyze the search efficiency of a number of common refutational theorem proving strategies on propositional and near-propositional problems. Search efficiency is concerned with the total number of proofs and partial proofs generated, rather than with the sizes of the proofs. We show that most common strategies produce search spaces of exponential size even on simple sets of clauses, or else are not sensitive to the goal. However, clause linking, which uses a reduction to propositional calculus, has behavior that is more favorable in some respects, a property that it shares with methods that cache subgoals. A strategy which is of interest for term-rewriting based theorem proving is the A-ordering strategy, and we discuss it in some detail. We show some advantages of A-ordering over other strategies, which may help to explain its efficiency in practice. We also point out some of its combinatorial inefficiencies, especially in relation to goal-sensitivity and irrelevant clauses. In addition, SLD-resolution, which is of importance for Prolog implementation, has combinatorial inefficiencies; this may suggest basing Prolog implementations on a different theorem proving strategy. We also develop techniques for studying the asymptotic complexity of first-order theorem provers. This permits an analytic comparison of the worst-case performances of various theorem proving methods. We show that the speeds of various well-known methods range in complexity from singe to quintuple exponential with respect to various natural measures of the hardness of the input</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering, general</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ingenieurwissenschaften</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Yunshan</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-322-93862-6</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-STI</subfield><subfield code="a">ZDB-2-BAD</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-STI_Archive</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-STI_1990/1999</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027866112</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042430781 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:26Z |
| institution | BVB |
| isbn | 9783322938626 9783528055745 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027866112 |
| oclc_num | 907314254 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-634 DE-92 DE-573 DE-706 DE-860 DE-1046 DE-Aug4 |
| owner_facet | DE-91 DE-BY-TUM DE-634 DE-92 DE-573 DE-706 DE-860 DE-1046 DE-Aug4 |
| physical | 1 Online-Ressource (VI, 167S.) |
| psigel | ZDB-2-STI ZDB-2-BAD ZDB-2-STI_Archive ZDB-2-STI_1990/1999 |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Vieweg+Teubner Verlag |
| record_format | marc |
| series2 | Computational Intelligence |
| spelling | Plaisted, David A. Verfasser aut The Efficiency of Theorem Proving Strategies A Comparative and Asymptotic Analysis von David A. Plaisted, Yunshan Zhu Wiesbaden Vieweg+Teubner Verlag 1997 1 Online-Ressource (VI, 167S.) txt rdacontent c rdamedia cr rdacarrier Computational Intelligence We analyze the search efficiency of a number of common refutational theorem proving strategies on propositional and near-propositional problems. Search efficiency is concerned with the total number of proofs and partial proofs generated, rather than with the sizes of the proofs. We show that most common strategies produce search spaces of exponential size even on simple sets of clauses, or else are not sensitive to the goal. However, clause linking, which uses a reduction to propositional calculus, has behavior that is more favorable in some respects, a property that it shares with methods that cache subgoals. A strategy which is of interest for term-rewriting based theorem proving is the A-ordering strategy, and we discuss it in some detail. We show some advantages of A-ordering over other strategies, which may help to explain its efficiency in practice. We also point out some of its combinatorial inefficiencies, especially in relation to goal-sensitivity and irrelevant clauses. In addition, SLD-resolution, which is of importance for Prolog implementation, has combinatorial inefficiencies; this may suggest basing Prolog implementations on a different theorem proving strategy. We also develop techniques for studying the asymptotic complexity of first-order theorem provers. This permits an analytic comparison of the worst-case performances of various theorem proving methods. We show that the speeds of various well-known methods range in complexity from singe to quintuple exponential with respect to various natural measures of the hardness of the input Engineering Engineering, general Ingenieurwissenschaften Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf Automatisches Beweisverfahren (DE-588)4069034-9 s 1\p DE-604 Zhu, Yunshan Sonstige oth https://doi.org/10.1007/978-3-322-93862-6 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Plaisted, David A. The Efficiency of Theorem Proving Strategies A Comparative and Asymptotic Analysis Engineering Engineering, general Ingenieurwissenschaften Automatisches Beweisverfahren (DE-588)4069034-9 gnd |
| subject_GND | (DE-588)4069034-9 |
| title | The Efficiency of Theorem Proving Strategies A Comparative and Asymptotic Analysis |
| title_auth | The Efficiency of Theorem Proving Strategies A Comparative and Asymptotic Analysis |
| title_exact_search | The Efficiency of Theorem Proving Strategies A Comparative and Asymptotic Analysis |
| title_full | The Efficiency of Theorem Proving Strategies A Comparative and Asymptotic Analysis von David A. Plaisted, Yunshan Zhu |
| title_fullStr | The Efficiency of Theorem Proving Strategies A Comparative and Asymptotic Analysis von David A. Plaisted, Yunshan Zhu |
| title_full_unstemmed | The Efficiency of Theorem Proving Strategies A Comparative and Asymptotic Analysis von David A. Plaisted, Yunshan Zhu |
| title_short | The Efficiency of Theorem Proving Strategies |
| title_sort | the efficiency of theorem proving strategies a comparative and asymptotic analysis |
| title_sub | A Comparative and Asymptotic Analysis |
| topic | Engineering Engineering, general Ingenieurwissenschaften Automatisches Beweisverfahren (DE-588)4069034-9 gnd |
| topic_facet | Engineering Engineering, general Ingenieurwissenschaften Automatisches Beweisverfahren |
| url | https://doi.org/10.1007/978-3-322-93862-6 |
| work_keys_str_mv | AT plaisteddavida theefficiencyoftheoremprovingstrategiesacomparativeandasymptoticanalysis AT zhuyunshan theefficiencyoftheoremprovingstrategiesacomparativeandasymptoticanalysis |