×


 x 

Shopping cart
Monty Newborn - Automated Theorem Proving - 9780387950754 - V9780387950754
Stock image for illustration purposes only - book cover, edition or condition may vary.

Automated Theorem Proving

€ 194.65
FREE Delivery in Ireland
Description for Automated Theorem Proving Hardback. Introduces readers to automated theorem proving, while providing two approaches implemented as easy-to-use programs: semantic-tree theorem proving and resolution-refutation theorem proving. This title also introduces first-order predicate calculus, well-formed formulae, and their transformation to clauses. Num Pages: 231 pages, biography. BIC Classification: PBCD. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 15. Weight in Grams: 543.
As the 21st century begins, the power of our magical new tool and partner, the computer, is increasing at an astonishing rate. Computers that perform billions of operations per second are now commonplace. Multiprocessors with thousands of little computers - relatively little! -can now carry out parallel computations and solve problems in seconds that only a few years ago took days or months. Chess-playing programs are on an even footing with the world's best players. IBM's Deep Blue defeated world champion Garry Kasparov in a match several years ago. Increasingly computers are expected to be more intelligent, to reason, to ... Read more

Product Details

Format
Hardback
Publication date
2000
Publisher
Springer-Verlag New York Inc. United States
Number of pages
231
Condition
New
Number of Pages
231
Place of Publication
New York, NY, United States
ISBN
9780387950754
SKU
V9780387950754
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15

Reviews for Automated Theorem Proving

Goodreads reviews for Automated Theorem Proving


Subscribe to our newsletter

News on special offers, signed editions & more!