Artículos relacionados a From Logic to Logic Programming (Foundations of Computing)

From Logic to Logic Programming (Foundations of Computing) - Tapa dura

 
9780262041423: From Logic to Logic Programming (Foundations of Computing)

Sinopsis

This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic.

"Sobre este título" puede pertenecer a otra edición de este libro.

  • EditorialMIT Press
  • Año de publicación1994
  • ISBN 10 0262041421
  • ISBN 13 9780262041423
  • EncuadernaciónTapa dura
  • IdiomaInglés
  • Número de páginas228
  • Contacto del fabricanteno disponible

Comprar usado

Condición: Como Nuevo
Cambridge, Mass. : MIT Press, 1994...
Ver este artículo

EUR 12,00 gastos de envío desde Holanda a España

Destinos, gastos y plazos de envío

Resultados de la búsqueda para From Logic to Logic Programming (Foundations of Computing)

Imagen de archivo

Doets, Kees.
Publicado por Mit Pr, 1994
ISBN 10: 0262041421 ISBN 13: 9780262041423
Antiguo o usado Tapa blanda

Librería: Kloof Booksellers & Scientia Verlag, Amsterdam, Holanda

Calificación del vendedor: 4 de 5 estrellas Valoración 4 estrellas, Más información sobre las valoraciones de los vendedores

Condición: as new. Cambridge, Mass. : MIT Press, 1994. Hardcover. 228 pp. - This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described.No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic. Condition : as new copy. ISBN 9780262041423. Keywords : COMPUTER STUDIES, Logic programming. Nº de ref. del artículo: 287754

Contactar al vendedor

Comprar usado

EUR 55,95
Convertir moneda
Gastos de envío: EUR 12,00
De Holanda a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito