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.
Automated Theorem Proving: Theory and Practice
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
13 of 13 people found the following review helpful:
4.0 out of 5 stars
Learn about automated theorem proving in one weekend,
By james (Geneva, Switzerland) - See all my reviews
This review is from: Automated Theorem Proving: Theory and Practice (Hardcover)
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).
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
This book is about how computers prove theorems. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
extended search strategy, hash table resolution, hash code list, closed semantic tree, atom selection heuristic, binary factoring, merge clause, equality substitution axioms, using binary resolution, semantic tree constructed, negated conclusion, search depth set, literal header, binary resolvent, sos strategy, base clauses, derivation rooted, eliminate inferences, unit cutoff, simple subsumption, first resolvent, linear proof, hash codes, major arrays, binary factors Key Phrases - Capitalized Phrases (CAPs): (learn more)
Problem Library, Applying Step, Wed Jul, After Transformation, Brief Introduction New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
This book is about how computers prove theorems. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
extended search strategy, hash table resolution, hash code list, closed semantic tree, atom selection heuristic, binary factoring, merge clause, equality substitution axioms, using binary resolution, semantic tree constructed, negated conclusion, search depth set, literal header, binary resolvent, sos strategy, base clauses, derivation rooted, eliminate inferences, unit cutoff, simple subsumption, first resolvent, linear proof, hash codes, major arrays, binary factors Key Phrases - Capitalized Phrases (CAPs): (learn more)
Problem Library, Applying Step, Wed Jul, After Transformation, Brief Introduction New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 9
books:
See all 9 books this book cites
1
book
cites this book:
- Machine Intelligence by B. Meltzer in Back Matter
- What is the Name of This Book? The Riddle of Dracula and Other Logical Puzzles by Raymond Smullyan on page 157
- Automated Theorem Proving (Artificial Intelligence) by Wolfgang Bibel in Back Matter
- Automated Reasoning: Introduction and Applications by Larry Wos in Back Matter
- Problem Solving Methods in Artificial Intelligence by Nils J. Nilsson in Back Matter
See all 9 books this book cites
- Automated Theorem Proving in Software Engineering by Johann M. Schumann in Back Matter
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
