This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
FREE Two-Day Shipping for Students. 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
Editorial Reviews
From the Back Cover
Mechanical theorem proving is an important subject in artificial intelligence. It has been applied to many areas--program analysis, program synthesis, deductive question-answering systems, problem-solving systems, and robot technology.
This classic text provides a thorough discussion of mechanical theorem proving and its applications as well as an introduction to symbolic logic. A purely model-theoretic approach to first-order logic is adopted, and the book emphasizes efficient computer implementations of proof techniques.
Appropriate for both undergraduates and graduate courses in theorem proving, this text is also suitable as a supplementary textbook in artificial intelligence to provide the student with a background in mechanical theorem proving and application areas.
This classic text provides a thorough discussion of mechanical theorem proving and its applications as well as an introduction to symbolic logic. A purely model-theoretic approach to first-order logic is adopted, and the book emphasizes efficient computer implementations of proof techniques.
Appropriate for both undergraduates and graduate courses in theorem proving, this text is also suitable as a supplementary textbook in artificial intelligence to provide the student with a background in mechanical theorem proving and application areas.
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
8 of 8 people found the following review helpful:
5.0 out of 5 stars
very readable introduction to automated theorem proving,
By
This review is from: Symbolic Logic and Mechanical Theorem Proving (Computer Science and Applied Mathematics) (Hardcover)
Best introductory book on automated theorem proving available. Although it was written in the early 70's, it is written in a very clear, but mathematically precise, manner. It does not drown a reader with an abundance of symbols and definitions. It is a clear and well written exposition on automated theorem proving based on resolution. Unlike some recent text books, it does NOT use sequentzen logic systems. It covers all aspects of resolution-based theorem proving: different forms of resolution, deletion strategies, unification.
7 of 8 people found the following review helpful:
5.0 out of 5 stars
One of the Best in theorem proving...,
By hmpiloni@compuserve.com.mx (Puebla, México) - See all my reviews
This review is from: Symbolic Logic and Mechanical Theorem Proving (Computer Science and Applied Mathematics) (Hardcover)
If you are interested in Artificial Intelligence or you are one of those crazy guys who likes the Computer theory area this is a good book for you, mechanical theorem proving is an important subject into the AI area, all you want to know is Mathematical Logic, first order logic and predicate calculus. Very good book but very hard too (specially if you have to make some Mechanical theorem provers by yourself as a school project :) )
1 of 1 people found the following review helpful:
5.0 out of 5 stars
Superbly written, simultaneously approachable and rigorous,
This review is from: Symbolic Logic and Mechanical Theorem Proving (Computer Science and Applied Mathematics) (Hardcover)
This book provides a complete introduction to mechanical theorem proving, including a lesson in both predicate calculus and first order logic. It is also profoundly readable.
Each concept is presented intuitively, abstractly (rigorously), then practically. Every technique and virtually every definition is proceeded by an example in both predicate calculus and first order logic, the first to show its simplicity, and the second to show its power. Proofs of the validity and completeness of every technique are provided to satisfy any concerns about them (and to interest theorists), but are not essential for comprehension of the book. Furthermore, the algorithms are all presented in a mathematically rigorous way, yet in a way that is quickly implemented on a computer. In short, this book contains everything you need, whether you are interested in the subject or actually want/need to build a theorem prover. Furthermore, it's made as easy as the concepts can possibly be, and very rarely do you have to re-read a section to understand. This is the perfect book on the subject.
Share your thoughts with other customers: Create your own review
|
|
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.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
So You'd Like to...
|
|
