Automated Theorem Proving - Theory and Practice (Paperback, Softcover reprint of the original 1st ed. 2001)

This text and software package introduces readers to automated theorem proving, while providing two approaches implemented as easy-to-use programs. These are semantic-tree theorem proving and resolution-refutation theorem proving. The early chapters introduce first-order predicate calculus, well-formed formulae, and their transformation to clauses. Then the author goes on to show how the two methods work and provides numerous examples for readers to try their hand at theorem-proving experiments. Each chapter comes with exercises designed to familiarise the readers with the ideas and with the software, and answers to many of the problems.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Release date:	May 2013
First published:	2001
Authors:	Monty Newborn
Dimensions:	235 x 155 x 13mm (L x W x T)
Format:	Paperback
Pages:	231
Edition:	Softcover reprint of the original 1st ed. 2001
ISBN-13:	978-1-4612-6519-1
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Mathematical foundations > General Books > Computing & IT > Applications of computing > Artificial intelligence > General
LSN:	1-4612-6519-3
Barcode:	9781461265191

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!