Knihu momentálně nemáme skladem
Parametry
Kategorie
Více o knize
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.
Nákup knihy
Automated theorem proving, Monroe Newborn
- Jazyk
- Rok vydání
- 2001
Jakmile ji vyčmucháme, pošleme vám e-mail.
Doručení
Platební metody
Navrhnout úpravu
- Titul
- Automated theorem proving
- Jazyk
- anglicky
- Autoři
- Monroe Newborn
- Vydavatel
- Springer
- Rok vydání
- 2001
- ISBN10
- 0387950753
- ISBN13
- 9780387950754
- Kategorie
- Počítače, IT, programování
- Anotace
- 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.