The Efficiency of Theorem Proving Strategies A Comparative and Asymptotic Analysis
This book is unique in that it gives asymptotic bounds on the sizes of the search spaces generated by many common theorem proving strategies. Thus it permits one to gain a theoretical unterstanding of the efficiencies of many different theorem proving methods. This is a fundamental tool in the compa...
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Wiesbaden
Vieweg+Teubner Verlag
1999, 1999
|
| Edition: | 2nd ed. 1999 |
| Series: | Computational Intelligence
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
| Summary: | This book is unique in that it gives asymptotic bounds on the sizes of the search spaces generated by many common theorem proving strategies. Thus it permits one to gain a theoretical unterstanding of the efficiencies of many different theorem proving methods. This is a fundamental tool in the comparative study of theorem proving strategies. The second edition is slightly revised, a few errors have been fixed, and some references to related works have been added |
|---|---|
| Physical Description: | VIII, 172 p. 3 illus online resource |
| ISBN: | 9783663078470 |