Advertisement

© 1999

The Efficiency of Theorem Proving Strategies

A Comparative and Asymptotic Analysis

  • Authors
  • Theoretical understanding of the efficiencies of many different theorem proving methods

Book

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

About the authors

David A. Plaisted ist seit 1984 Professor am Fachbereich Informatik der University of North Carolina. Seine gegenwärtigen Forschungen umfassen automatisches Theorembeweisen, Termersetzungssysteme sowie funktionale und Logikprogrammierung.
Yunshan Zhu ist Mitarbeiter am selben Fachbereich der UNC. Sein Forschungsinteresse gilt dem automatischen Theorembeweisen, formalen Methoden und logikbasierten Methoden der Künstlichen Intelligenz.

Since 1984 David A. Plaisted is professor in the Department of Computer Science at the University of North Carolina. His current interests include theorem proving, term-rewriting systems and logic and functional programming.
Yunshan 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.

Bibliographic information

  • Book Title The Efficiency of Theorem Proving Strategies
  • Book Subtitle A Comparative and Asymptotic Analysis
  • Authors David A. Plaisted
    Yunshan Zhu
  • Series Title Computational Intelligence
  • 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
  • Softcover ISBN 978-3-528-15574-2
  • eBook ISBN 978-3-663-07847-0
  • Edition Number 2
  • Number of Pages VIII, 172
  • Number of Illustrations 3 b/w illustrations, 0 illustrations in colour
  • Topics Computer Science, general
  • Buy this book on publisher's site
Industry Sectors
Pharma
Automotive
Chemical Manufacturing
Biotechnology
Electronics
IT & Software
Telecommunications
Consumer Packaged Goods
Aerospace
Engineering