Order Total (1 Item Items):
Shipping Destination:
Efficiency Theorem Proving Strategies (22 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (22)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (17)
- As New, Fine or Near Fine (3)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (1)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (20)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (8)
- Not Print on Demand (17)
Language (3)
Free Shipping
Seller Location
Seller Rating
-
The Efficiency of Theorem Proving Strategies
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg Verlag, Friedr, & Sohn Verlagsgesellschaft mbH, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
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.
-
The Efficiency of Theorem Proving Strategies
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg Verlag, Friedr, & Sohn Verlagsgesellschaft mbH, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Condition: New. pp. 184 2nd Edition.
-
The Efficiency of Theorem Proving Strategies
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg Verlag, Friedr, & Sohn Verlagsgesellschaft mbH, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Condition: New. pp. 184.
-
The efficiency of theorem proving strategies. a comparative and asymptotic analysis. second edition.
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Friedr. Vieweg & Sohn, Braunschweig/Wiesbaden, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Seller: Emile Kerssemakers ILAB, Heerlen, Netherlands
Seller rating 5 out of 5 stars
21 cm. original paperback. 170 pp. bibliography. index. "Computational Intelligence". -(book shop mark bottom edge, otherwise (very) good). 280g.
-
The Efficiency Of Theorem Proving Strategies: A Comparative And Asymptotic Analysis (computational Intelligence)
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
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.
-
The Efficiency Of Theorem Proving Strategies: A Comparative And Asymptotic Analysis (computational Intelligence)
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Efficiency of Theorem Proving Strategies : A Comparative and Asymptotic Analysis
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Condition: As New. Unread book in perfect condition.
-
Efficiency of Theorem Proving Strategies : A Comparative and Asymptotic Analysis
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Condition: New.
-
The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysis (Computational Intelligence)
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 50.80
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysis (Computational Intelligence)
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag 1999-10-28, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Paperback. Condition: New.
-
Efficiency of Theorem Proving Strategies : A Comparative and Asymptotic Analysis
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Efficiency of Theorem Proving Strategies : A Comparative and Asymptotic Analysis
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysis (Computational Intelligence)
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Braunschweig, Wiesbaden: Vieweg & Sohn Verlagsgesellschaft, 1997
ISBN 10: 352805574X ISBN 13: 9783528055745
Broschiert Broschiert. Condition: Sehr gut. VI, 167 Seiten, Zust: Gutes Exemplar. Mit Vorbesitzereintrag. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 236.
-
Soft cover. Condition: New. ISBN:9783528155742.
-
The Efficiency of Theorem Proving Strategies : A Comparative and Asymptotic Analysis
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, Vieweg+Teubner Verlag, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
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.
-
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.
-
-
The Efficiency of Theorem Proving Strategies
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, Vieweg+Teubner Verlag Okt 1999, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 184 pp. Englisch.
-
The Efficiency of Theorem Proving Strategies
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
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.
-
The Efficiency of Theorem Proving Strategies
Book 27 of 27: Computational IntelligenceLanguage: English
Published by Vieweg+Teubner Verlag, Vieweg+Teubner Verlag Okt 1999, 1999
ISBN 10: 3528155744 ISBN 13: 9783528155742
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 understanding of the efficiencies of many different theorem proving methods. This is a fundamental new tool in the comparative study of theorem proving strategies.Vieweg+Teubner Verlag, Abraham-Lincoln-Straße 46, 65189 Wiesbaden 184 pp. Englisch.
-
Condition: New. Print on Demand.
-
Condition: New. PRINT ON DEMAND.
