Skip to main content
SpringerLink
Log in

The Efficiency of Theorem Proving Strategies

A Comparative and Asymptotic Analysis

  • Book
  • © 1999

Overview

Authors:
  1. David A. Plaisted
    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Yunshan Zhu
    View author publications

    You can also search for this author in PubMed   Google Scholar

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

Part of the book series: Computational Intelligence (CI)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (2 chapters)

  1. Front Matter

    Pages i-viii
    Download chapter PDF

  2. The Propositional Complexity of First-Order Theorem Proving Strategies

    • David A. Plaisted, Yunshan Zhu
    Pages 1-65

  3. The First-Order Complexity of First-Order Theorem Proving Strategies

    • David A. Plaisted, Yunshan Zhu
    Pages 67-155

  4. Back Matter

    Pages 157-172
    Download chapter PDF
Back to top

Keywords

About this book

This is the second and slightly revised edition of this book. A few errors have been fixed, and some references to related work have been added. I thank the readers for their comments on the first edition. We analyze the search efficiency of a number of common refutational theorem proving strategies on propositional and near-propositional prob­ lems. Search efficiency is concerned with the total number of proofs and partial proofs generated, rather than with the sizes of the proofs. We show that most common strategies produce search spaces of expo­ nential size even on simple sets of clauses, or else are not sensitive to the goal. However, clause linking, which uses a reduction to proposi­ tional calculus, has behavior that is more favorable in some respects, a property that it shares with methods that cache subgoals. A strat­ egy which is of interest for term-rewriting based theorem proving is the A-ordering strategy, and we discuss it in some detail. We show some advantages of A-ordering over other strategies, which may help to explain its efficiency in practice. We also point out some of its com­ binatorial inefficiencies, especially in relation to goal-sensitivity and irrelevant clauses. In addition, SLD-resolution, which is of importance for Prolog implementation, has combinatorial inefficiencies; this may suggest basing Prolog implementations on a different theorem proving strategy. We also develop techniques for studying the asymptotic complexity of first-order theorem provers. This permits an analytic comparison of the worst-case performances of various theorem proving methods.

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

  • Publisher: Vieweg+Teubner Verlag Wiesbaden

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Fachmedien Wiesbaden 1999

  • Softcover ISBN: 978-3-528-15574-2Published: 28 October 1999

  • eBook ISBN: 978-3-663-07847-0Published: 11 November 2013

  • Series ISSN: 2522-0519

  • Series E-ISSN: 2522-0527

  • Edition Number: 2

  • Number of Pages: VIII, 172

  • Number of Illustrations: 3 b/w illustrations

  • Topics: Computer Science, general

  • Industry Sectors: IT & Software, Telecommunications

Publish with us

Policies and ethics

Back to top

Search

Navigation