|
Automated Theorem Proving: Theory and Practice | 
 enlarge | Author: Monty Newborn
Publisher: Springer
Category: Book
List Price: $109.00
Buy New: $75.10
You Save: $33.90 (31%)
New (6) Used (10) from $39.95
Avg. Customer Rating:  1 reviews
Sales Rank: 1452488
Media: Hardcover
Edition: 1
Number Of Items: 1
Pages: 231
Shipping Weight (lbs): 1.3
Dimensions (in): 9.5 x 6.4 x 0.7
ISBN: 0387950753
Dewey Decimal Number: 004.015113
EAN: 9780387950754
ASIN: 0387950753
Publication Date: December 15, 2000
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: New Book. International Shipping Available
|
| Editorial Reviews:
Product Description
This text and software package introduces the reader to automated theorem proving and provides two approaches implemented as easy-to-use programs. The two approaches studied are semantic tree theorem proving and resolution-refutation theorem proving. The first chapters introduce the reader to first-order predicate calculus, well-formed formulae, and their transformation to clauses (implemented in a third program provided on diskette). Then the author shows how the two methods work and provides numerous examples for readers to try their hand at theorem-proving experiments. Each chapter comes with exercises intended to familiarise the readers with the ideas and with the software, and answers are provided to many of the problems.
|
| Customer Reviews:
Learn about automated theorem proving in one weekend February 12, 2001
12 out of 12 found this review helpful
So you wanted to know how automated theorem proving algorithms work? This is a "hands on" book that tells you just that and gives you the sources of a program that implements these algorithms. The book is a cross between giving you theory and telling you about the included programs. As such it is a fast read and is great to learn the basic concepts. Its short comings are that you sometimes need to reread a paragraph a few times because it is written in a fairly terse style. The code is meant to work under unix but compiles and run well under windows visual C++ although one program does not work fully (COMPILE).
|
|
|
Powered by Associate-O-Matic
| |
