The Efficiency of Theorem Proving Strategies

Beschreibung

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.
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.
Theoretical understanding of the efficiencies of many different theorem proving methods

Autor*in

David A. Plaisted

Themen in »The Efficiency of Theorem Proving Strategies«

Automated Theorem Proving Compexity Computational Intelligence First-Order Complexity First-Order Theorem Provin Logic Search Efficiency Strategy Theorem Proving automated theorem proving behavior calculus complexity computational intelligence intelligence

Stimmen zu »The Efficiency of Theorem Proving Strategies«

Details

Link teilen