Mohlo by se vám také líbit

Více informací o knize Automated Theorem Proving

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 406 bodů

Anotace knihy

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. Systemanforderung: The theorem-proving software runs under UNIX or LINUX or under IBM's C++ compiler.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Mathematical foundations

• Plný název: Automated Theorem Proving
• Podnázev: Theory and Practice
• Autor: Monty Newborn
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 231
• EAN: 9780387950754
• ISBN: 0387950753
• ID: 05248009
• Nakladatelství: Springer-Verlag New York Inc.
• Hmotnost: 543 g
• Rozměry: 235 × 155 × 18 mm
• Datum vydání: 15. December 2000

Oblíbené z jiného soudku

---

---

---