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
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!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
