| 書目名稱 | The Efficiency of Theorem Proving Strategies |
| 副標(biāo)題 | A Comparative and As |
| 編輯 | David A. Plaisted,Yunshan Zhu |
| 視頻video | http://file.papertrans.cn/909/908534/908534.mp4 |
| 概述 | Theoretical understanding of the efficiencies of many different theorem proving methods |
| 叢書名稱 | Computational Intelligence |
| 圖書封面 |  |
| 描述 | This is the second and slightly revised edition of this book. A few errors have been fixed, and some references to related work have been added. I thank the readers for their comments on the first edition. We analyze the search efficiency of a number of common refutational theorem proving strategies on propositional and near-propositional prob- lems. 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 expo- nential size even on simple sets of clauses, or else are not sensitive to the goal. However, clause linking, which uses a reduction to proposi- tional calculus, has behavior that is more favorable in some respects, a property that it shares with methods that cache subgoals. A strat- egy 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 com- binatorial inefficiencies, especially in relation to goal-sensitivity and irrelevan |
| 出版日期 | Book 1999Latest edition |
| 關(guān)鍵詞 | Automated Theorem Proving; Compexity; Computational Intelligence; First-Order Complexity; First-Order Th |
| 版次 | 2 |
| doi | https://doi.org/10.1007/978-3-663-07847-0 |
| isbn_softcover | 978-3-528-15574-2 |
| isbn_ebook | 978-3-663-07847-0Series ISSN 2522-0519 Series E-ISSN 2522-0527 |
| issn_series | 2522-0519 |
| copyright | Springer Fachmedien Wiesbaden 1999 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-21 04:02
發(fā)表于 2025-3-21 19:59:09
