Verwandte Artikel zu From Logic to Logic Programming (Foundations of Computing)
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Suchergebnisse für From Logic to Logic Programming (Foundations of Computing)
Beispielbild für diese ISBN
From Logic to Logic Programming (Foundations of Computing) (FOUNDATIONS OF COMPUTING SERIES)
Anbieter: My Dead Aunt's Books, Hyattsville, MD, USA
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: Very Good. Zustand des Schutzumschlags: NONE. Unmarked hardcover no jacket. Bestandsnummer des Verkäufers 141451
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
From Logic to Logic Programming (FOUNDATIONS OF COMPUTING SERIES)
Anbieter: book-link, Nufringen, BW, Deutschland
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: Sehr gut. 228 Seiten; *** Top Zustand! M25-07-P-24-VG Sprache: Deutsch Gewicht in Gramm: 1. Bestandsnummer des Verkäufers 35330
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
From logic to logic programming.
Anbieter: Kloof Booksellers & Scientia Verlag, Amsterdam, Niederlande
Verkäuferbewertung 4 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 287754
Anzahl: 1 verfügbar