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 Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
Braunschweig :
Vieweg,
1999.
|
| Edition: | 2nd, revised edition. |
| Series: | Computational intelligence.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| 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: | 1 online resource (vii, 170 pages) : illustrations. |
| Bibliography: | Includes bibliographical references (pages [157]-163) and index. |
| ISBN: | 9783663078470 (electronic bk.) 3663078477 (electronic bk.) |