The Efficiency of Theorem Proving Strategies

A Comparative and Asymptotic Analysis

  • Authors
  • David A. Plaisted
  • Yunshan Zhu

Part of the Computational Intelligence book series (CI)

Table of contents

  1. Front Matter
    Pages i-viii
  2. David A. Plaisted, Yunshan Zhu
    Pages 67-155
  3. Back Matter
    Pages 157-172

About this book

Introduction

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.

Keywords

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 logic performance Prolog proving Resolution theorem proving

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-663-07847-0
  • Copyright Information Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH, Wiesbaden 1999
  • Publisher Name Vieweg+Teubner Verlag, Wiesbaden
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-528-15574-2
  • Online ISBN 978-3-663-07847-0
  • About this book
Industry Sectors
Pharma
Automotive
Electronics
Telecommunications
Aerospace