|
|
|
|
||
|
HELP | |
|
  $16.50 List price:
Used Trade Paper
Usually ships in 5 to 7 business days
 available for shipping or prepaid pickup only
The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysisby David A. Plaisted
Synopses & ReviewsPublisher Comments: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 understanding of the efficiencies of many different theorem-proving methods. This is a fundamental new tool in the comparative study of theorem proving strategies. Synopsis: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 understanding 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. About the AuthorYunshan Zhu also is a member of the Department of Computer Science at the University of North Carolina. Zhu's current research interests include theorem proving, formal methods and logical approaches of Artificial Intelligence. Table of ContentsAsymptotic bounds on the sizes of the search spaces generated by many common theorem proving strategies Gaining a theoretical understanding of the efficiencies of many different theorem proving methods A comparative study of theorem proving strategies What Our Readers Are SayingBe the first to add a comment for a chance to win!Product Details
Related Aisles
| |||||||||
|
| ||||||||||
|
||||||||||
Don't Miss
