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 understanding of the efficiencies of many different theorem proving methods. This is a fundamental new tool in the comparative study of theorem proving strategies.

octobre 1999, env. 172 pages, Computational intelligence, Anglais
Vieweg + Teubner
978-3-528-15574-2

Autres titres de la collection: Computational intelligence

Afficher tout

Autres titres sur ce thème