Skip to main content
SpringerLink
Log in
Book cover

The Efficiency of Theorem Proving Strategies

A Comparative and Asymptotic Analysis

  • Textbook
  • © 1997

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

  • Ein besseres Verständnis theorembeweisender Methoden

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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 N1-vi
    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-154

  4. Back Matter

    Pages 155-168
    Download chapter PDF
Back to top

Keywords

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-322-93862-6

  • Publisher: Vieweg+Teubner Verlag Wiesbaden

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Fachmedien Wiesbaden 1997

  • eBook ISBN: 978-3-322-93862-6Published: 13 March 2013

  • Series ISSN: 2522-0519

  • Series E-ISSN: 2522-0527

  • Edition Number: 1

  • Number of Pages: VI, 167

  • Number of Illustrations: 2 b/w illustrations

  • Topics: Engineering, general

Publish with us

Policies and ethics

Back to top

Search

Navigation