Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Automated Theorem Proving : Theory and Practice by Monty Newborn (2000, Hardcover)
AlibrisBooks (451008)
98.5% positive feedback
Price:
US $205.06
(inclusive of GST)
ApproximatelyS$ 268.14
+ $42.19 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherSpringer New York
ISBN-100387950753
ISBN-139780387950754
eBay Product ID (ePID)1806559
Product Key Features
Number of PagesXiv, 231 Pages
LanguageEnglish
Publication NameAutomated Theorem Proving : Theory and Practice
SubjectIntelligence (Ai) & Semantics, Computer Science, Logic
Publication Year2000
TypeTextbook
Subject AreaMathematics, Computers
AuthorMonty Newborn
FormatHardcover
Dimensions
Item Height0.3 in
Item Weight19.2 Oz
Item Length9.3 in
Item Width6.1 in
Additional Product Features
Intended AudienceScholarly & Professional
LCCN00-056315
Dewey Edition21
Number of Volumes1 vol.
IllustratedYes
Dewey Decimal004/.01/5113
Table Of ContentA brief introduction to COMPILE, HERBY and THEO.- Predicate calculus, well-formed formulas and theorems.- COMPILE: transforming well-formed formulas to clauses.- Inference procedures.- Proving theorems by constructing closed semantic trees.- Resolution-refutation proofs.- HERBY: A semantic tree theorem prover.- Using HERBY.- THEO: A resolution-refutation theorem prover.- Using THEO.- A look at HERBY's source code.- A look at THEO's source code.- Other theorem provers.- References.
SynopsisAs the 21st century begins, the power of our magical new tool and partner, the computer, is increasing at an astonishing rate. Computers that perform billions of operations per second are now commonplace. Multiprocessors with thousands of little computers - relatively little -can now carry out parallel computations and solve problems in seconds that only a few years ago took days or months. Chess-playing programs are on an even footing with the world's best players. IBM's Deep Blue defeated world champion Garry Kasparov in a match several years ago. Increasingly computers are expected to be more intelligent, to reason, to be able to draw conclusions from given facts, or abstractly, to prove theorems-the subject of this book. Specifically, this book is about two theorem-proving programs, THEO and HERBY. The first four chapters contain introductory material about automated theorem proving and the two programs. This includes material on the language used to express theorems, predicate calculus, and the rules of inference. This also includes a description of a third program included with this package, called COMPILE. As described in Chapter 3, COMPILE transforms predicate calculus expressions into clause form as required by HERBY and THEO. Chapter 5 presents the theoretical foundations of seman- tic tree theorem proving as performed by HERBY. Chapter 6 presents the theoretical foundations of resolution-refutation theorem proving as per- formed by THEO. Chapters 7 and 8 describe HERBY and how to use it., This new book carefully describes how automated reasoning is performed. It introduces all necessary analytical and mathematical tools to discuss basic inference rules of binary resolution and binary factoring. Two computer programs and source code are provided to use as examples. Advanced students, professionals and researchers in computer science, computer engineering, artificial intelligence and logic programming will find the book a useful text/reference., As the 21st century begins, the power of our magical new tool and partner, the computer, is increasing at an astonishing rate. Computers that perform billions of operations per second are now commonplace. Multiprocessors with thousands of little computers - relatively little! -can now carry out parallel computations and solve problems in seconds that only a few years ago took days or months. Chess-playing programs are on an even footing with the world's best players. IBM's Deep Blue defeated world champion Garry Kasparov in a match several years ago. Increasingly computers are expected to be more intelligent, to reason, to be able to draw conclusions from given facts, or abstractly, to prove theorems-the subject of this book. Specifically, this book is about two theorem-proving programs, THEO and HERBY. The first four chapters contain introductory material about automated theorem proving and the two programs. This includes material on the language used to express theorems, predicate calculus, and the rules of inference. This also includes a description of a third program included with this package, called COMPILE. As described in Chapter 3, COMPILE transforms predicate calculus expressions into clause form as required by HERBY and THEO. Chapter 5 presents the theoretical foundations of seman tic tree theorem proving as performed by HERBY. Chapter 6 presents the theoretical foundations of resolution-refutation theorem proving as per formed by THEO. Chapters 7 and 8 describe HERBY and how to use it., This book/software package introduces the reader to automated theorem proving and provides two approaches implemented as easy-to-use programs. The author shows how the two approaches, semantic tree theorem proving and resolution-refutation theorem proving, work and provides numerous examples for readers to try their hand at theorem-proving experiments. Each chapter provides exercises that will familiarize readers with both the ideas and the software.
LC Classification NumberQA8.9-10.3
All listings for this product
Be the first to write a review
