From
SMASS Sellers, IRVING, TX, U.S.A.
Seller rating 4 out of 5 stars
AbeBooks Seller since 22 February 2022
Brand New Original US Edition. Customer service! Satisfaction Guaranteed. Seller Inventory # ASNT3-68654
A Comparative and Asymptotic Analysis
About the Author:
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.
Title: EFFICIENCY OF THEOREM PROVING STRATEGIES: A ...
Publisher: Vieweg+Teubner Verlag
Publication Date: 1999
Binding: Soft cover
Condition: New
Edition: 2nd Edition
Seller: Emile Kerssemakers ILAB, Heerlen, Netherlands
21 cm. original paperback. 170 pp. bibliography. index. "Computational Intelligence". -(book shop mark bottom edge, otherwise (very) good). 280g. Seller Inventory # 72270
Quantity: 1 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 184 24:B&W 5.83 x 8.27 in or 210 x 148 mm (A5) Perfect Bound on Creme w/Gloss Lam. Seller Inventory # 7589468
Quantity: 4 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. pp. 184. Seller Inventory # 18291209
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 184 2nd Edition. Seller Inventory # 26291203
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. David A. Plaisted ist seit 1984 Professor am Fachbereich Informatik der University of North Carolina. Seine gegenwaertigen Forschungen umfassen automatisches Theorembeweisen, Termersetzungssysteme sowie funktionale und Logikprogrammierung.Yunshan Zhu ist. Seller Inventory # 4867623
Quantity: Over 20 available
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. The Efficiency of Theorem Proving Strategies | A Comparative and Asymptotic Analysis | David A. Plaisted (u. a.) | Taschenbuch | Computational Intelligence | Einband - flex.(Paperback) | Englisch | 1999 | Vieweg & Teubner | EAN 9783528155742 | Verantwortliche Person für die EU: Vieweg+Teubner Verlag, Abraham-Lincoln-Str. 46, 65189 Wiesbaden, productsafety[at]springernature[dot]com | Anbieter: preigu. Seller Inventory # 106578161
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Seller Inventory # ABBB-163136
Seller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEOCT25-238700
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 574527-n
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783528155742