The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysis by David A. PlaistedThe Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysis by David A. Plaisted

The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysis

byDavid A. Plaisted, Yunshan ZhuEditorWolfgang Bibel

Paperback | October 28, 1999

Pricing and Purchase Info

$104.20 online 
$124.50 list price save 16%
Earn 521 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
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 auto...
Loading
Title:The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic AnalysisFormat:PaperbackDimensions:172 pages, 21 × 14.8 × 0.17 inPublished:October 28, 1999Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3528155744

ISBN - 13:9783528155742

Look for similar items by category:

Reviews

Table of Contents

Bereitstellung asymptotischer Schranken für die Größe von Suchfeldern der von vielen gebräuchlichen Beweisstrategien erzeugten Suchräume - Gewinnung eines theoretischen Verständnisses der Effizienz unterschiedlicher Beweisverfahren - Effizienzvergleich von BeweisstrategienAsymptotic bounds on the sizes of the search spaces generated by many common theorem proving strategies - gaining a theoretical understanding of the efficiencies of many different theorem proving methods - a comparative study of theorem proving strategies