efficiency theorem proving strategies (8 Ergebnisse)

Zustand: 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.

Zustand: 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.

Zustand: 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.

21 cm. original paperback. 170 pp. bibliography. index. "Computational Intelligence". -(book shop mark bottom edge, otherwise (very) good). 280g.

Softcover. Zustand: Très bon. Ancien livre de bibliothèque. Salissures sur la tranche. Edition 1997. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Stains on the edge. Edition 1997. Ammareal gives back up to 15% of this item's net price to charity organizations.

Taschenbuch. Zustand: 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. Zustand: Neu. The Efficiency of Theorem Proving Strategies | A Comparative and Asymptotic Analysis | David A. Plaisted (u. a.) | Taschenbuch | 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.

Broschiert. Zustand: Sehr gut. Zust: Gutes Exemplar. Mit Vorbesitzereintrag. VI, 167 Seiten, Englisch 236g.