Articoli correlati a From Logic to Logic Programming
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Product Description
Book by Doets Kees
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreMit Pr
- Data di pubblicazione1994
- ISBN 10 0262041421
- ISBN 13 9780262041423
- RilegaturaCopertina rigida
- LinguaInglese
- Numero di pagine228
- Contatto del produttorenon disponibile
Risultati della ricerca per From Logic to Logic Programming
Foto dell'editore
From Logic to Logic Programming (Foundations of Computing) (FOUNDATIONS OF COMPUTING SERIES)
Da: My Dead Aunt's Books, Hyattsville, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: Very Good. Condizione sovraccoperta: NONE. Unmarked hardcover no jacket. Codice articolo 141451
Quantità: 1 disponibili
Foto dell'editore
From logic to logic programming.
Da: Kloof Booksellers & Scientia Verlag, Amsterdam, Paesi Bassi
Valutazione del venditore 4 su 5 stelle
Condizione: 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. Codice articolo 287754
Quantità: 1 disponibili