Sorry, this item is not available in
Image not available for
Color:
Image not available

To view this video download Flash Player

 


or
Sign in to turn on 1-Click ordering
Sell Us Your Item
For a $2.00 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Symbolic Logic and Mechanical Theorem Proving (Computer Science and Applied Mathematics) [Hardcover]

Chin-Liang Chang , Richard Char-Tung Lee
5.0 out of 5 stars  See all reviews (4 customer reviews)

List Price: $72.95
Price: $68.60 & FREE Shipping. Details
You Save: $4.35 (6%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Only 2 left in stock (more on the way).
Ships from and sold by Amazon.com. Gift-wrap available.
Want it Tuesday, July 15? Choose One-Day Shipping at checkout. Details
Free Two-Day Shipping for College Students with Amazon Student

Formats

Amazon Price New from Used from
Hardcover $68.60  
Paperback --  
Shop the New Digital Design Bookstore
Check out the Digital Design Bookstore, a new hub for photographers, art directors, illustrators, web developers, and other creative individuals to find highly rated and highly relevant career resources. Shop books on web development and graphic design, or check out blog posts by authors and thought-leaders in the design industry. Shop now

Book Description

June 11, 1973 0121703509 978-0121703509 1
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.

Frequently Bought Together

Symbolic Logic and Mechanical Theorem Proving (Computer Science and Applied Mathematics) + Implementing Programming Languages. an Introduction to Compilers and Interpreters (Texts in Computing)
Price for both: $84.80

Buy the selected items 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.

Product Details

  • Series: Computer Science and Applied Mathematics
  • Hardcover: 331 pages
  • Publisher: Academic Press; 1 edition (June 11, 1973)
  • Language: English
  • ISBN-10: 0121703509
  • ISBN-13: 978-0121703509
  • Product Dimensions: 1 x 6.3 x 9.2 inches
  • Shipping Weight: 1.7 pounds (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (4 customer reviews)
  • Amazon Best Sellers Rank: #1,615,425 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

5.0 out of 5 stars
(4)
5.0 out of 5 stars
4 star
0
3 star
0
2 star
0
1 star
0
Share your thoughts with other customers
Most Helpful Customer Reviews
9 of 9 people found the following review helpful
5.0 out of 5 stars very readable introduction to automated theorem proving October 11, 2000
Format: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.
Comment | 
Was this review helpful to you?
7 of 8 people found the following review helpful
5.0 out of 5 stars One of the Best in theorem proving... November 26, 1998
Format: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 :) )
Comment | 
Was this review helpful to you?
1 of 1 people found the following review helpful
5.0 out of 5 stars the best introduction to resolution and FOL October 3, 2010
Format:Hardcover
If you're a beginner who wants to build a FOL theorem prover, this is the first book you must get. The exposition is exemplary in clarity.

Though published in 1973, the material is not outdated. Many newer books talk about essentially the same basics, only harder to read.

It also explains answer extraction (ie, how to answer "what", "where", "when", "who" questions via resolution and unification).
Comment | 
Was this review helpful to you?
1 of 1 people found the following review helpful
Format: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.
Comment | 
Was this review helpful to you?
Search Customer Reviews
Search these reviews only

What Other Items Do Customers Buy After Viewing This Item?


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

Forums

There are no discussions about this product yet.
Be the first to discuss this product with the community.
Start a new discussion
Topic:
First post:
Prompts for sign-in
 



Look for Similar Items by Category