Automated Theorem Proving
Theory and Practice
Besorgungstitel - wird vorgemerkt | Lieferzeit: Besorgungstitel - Lieferbar innerhalb von 10 Werktagen I
202,77 €*
Alle Preise inkl. MwSt.|Versandkostenfrei
ISBN-13:
9780387950754
Veröffentl:
2000
Erscheinungsdatum:
15.12.2000
Seiten:
231
Autor:
Monty Newborn
Gewicht:
517 g
Format:
241x162x18 mm
Sprache:
Englisch
Beschreibung:
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.
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.
A 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.
Kunden Rezensionen
Mehr zum Thema
Folgen Sie uns auf:
