Automated theorem proving : theory and practice / Monty Newborn
Tipo de material:
TextoDetalles de publicación: New York : Springer, 2000 Descripción: XIII, 231 + 1 disco compactoISBN: 0-387-95075-3Tema(s): Demostración automática de teoremas | Inteligencia artificialResumen: 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.Resumen: Índice: 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.
| Tipo de ítem | Biblioteca de origen | Signatura | Info Vol | URL | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems |
|---|---|---|---|---|---|---|---|---|
| Monografías | 03. BIBLIOTECA INGENIERÍA PUERTO REAL | Depósito-681.3/NEW/aut (Navegar estantería(Abre debajo)) | Texto completo | Disponible Ubicación en estantería | Bibliomaps® | 3741376501 | |||
| Monografías | 03. BIBLIOTECA INGENIERÍA PUERTO REAL | Depósito-681.3/NEW/aut (Navegar estantería(Abre debajo)) | CD-ROM | Texto completo | Disponible Ubicación en estantería | Bibliomaps® | 3741376388 |
Navegando 03. BIBLIOTECA INGENIERÍA PUERTO REAL Estantes Cerrar el navegador de estanterías (Oculta el navegador de estanterías)
|
|
|
|
|
|
||||
| Depósito-681.3/NAS/pri Principios de las calculadoras numéricas automáticas / P. Naslin. | Depósito-681.3/NAS/teo Teoría de las calculadoras numéricas automáticas / Louis Nashelsky, Versión española de Alfonso Fernández Díaz | Depósito-681.3/NEW/aut Automated theorem proving : theory and practice / Monty Newborn | Depósito-681.3/NEW/aut Automated theorem proving : theory and practice / Monty Newborn | Depósito-681.3/NOR/ibm El iBM PC y PS/2 a fondo : técnicas y programación avanzada / Peter Norton | Depósito-681.3/NOR/int Introducción a la computación Peter Norton ; traducción Jorge Alberto Velázquez Arellano. | Depósito-681.3/NOR/int Introducción a la computación / Peter Norton ; traducción Claudia Fuentes, Héctor Esqueda ; revisión técnica Rosa María Cantón Croda |
Indice
Bibliografía: p. [207]-210
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.
Índice: 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.
No hay comentarios en este titulo.