Publicado por Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1989
ISBN 10: 354051533X ISBN 13: 9783540515333
Idioma: Inglés
Librería: Ammareal, Morangis, Francia
EUR 3,67
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoSoftcover. Condición: Bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 1989. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Slight signs of wear on the cover. Edition 1989. Ammareal gives back up to 15% of this item's net price to charity organizations.
Publicado por Springer Berlin Heidelberg, 1989
ISBN 10: 354051533X ISBN 13: 9783540515333
Idioma: Inglés
Librería: Buchpark, Trebbin, Alemania
EUR 6,99
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Sehr gut. Zustand: Sehr gut - Gepflegter, sauberer Zustand. | Seiten: 264 | Sprache: Englisch | Produktart: Bücher.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 43,38
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Springer Berlin Heidelberg, 1989
ISBN 10: 354051533X ISBN 13: 9783540515333
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 37,44
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational logic programming. After generalizing logic programming by augmenting programs with a conditional equational theory, the author defines a unifying framework for logic programming, equation solving, universal unification, and term rewriting. Within this framework many known results are developed. In particular, a presentation of the least model and the fixpoint semantics of equational logic programs is followed by a rigorous proof of the soundness and the strong completeness of various proof techniques: SLDE-resolution, where a universal unification procedure replaces the traditional unification algorithm; linear paramodulation and special forms of it such as rewriting and narrowing; complete sets of transformations for conditional equational theories; and lazy resolution combined with any complete set of inference rules for conditional equational theories.
Publicado por Springer Berlin Heidelberg, 1989
ISBN 10: 354051533X ISBN 13: 9783540515333
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 47,22
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational l.
Publicado por Springer Berlin Heidelberg Okt 1989, 1989
ISBN 10: 354051533X ISBN 13: 9783540515333
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 37,44
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational logic programming. After generalizing logic programming by augmenting programs with a conditional equational theory, the author defines a unifying framework for logic programming, equation solving, universal unification, and term rewriting. Within this framework many known results are developed. In particular, a presentation of the least model and the fixpoint semantics of equational logic programs is followed by a rigorous proof of the soundness and the strong completeness of various proof techniques: SLDE-resolution, where a universal unification procedure replaces the traditional unification algorithm; linear paramodulation and special forms of it such as rewriting and narrowing; complete sets of transformations for conditional equational theories; and lazy resolution combined with any complete set of inference rules for conditional equational theories.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 264 pp. Englisch.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 38,48
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 91,14
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Publicado por Springer Berlin Heidelberg Okt 1989, 1989
ISBN 10: 354051533X ISBN 13: 9783540515333
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 37,44
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational logic programming. After generalizing logic programming by augmenting programs with a conditional equational theory, the author defines a unifying framework for logic programming, equation solving, universal unification, and term rewriting. Within this framework many known results are developed. In particular, a presentation of the least model and the fixpoint semantics of equational logic programs is followed by a rigorous proof of the soundness and the strong completeness of various proof techniques: SLDE-resolution, where a universal unification procedure replaces the traditional unification algorithm; linear paramodulation and special forms of it such as rewriting and narrowing; complete sets of transformations for conditional equational theories; and lazy resolution combined with any complete set of inference rules for conditional equational theories. 264 pp. Englisch.