"synopsis" may belong to another edition of this title.
Shipping:
FREE
Within U.S.A.
Book Description Soft Cover. Condition: new. Seller Inventory # 9783540515333
Book Description Condition: New. Seller Inventory # ABLIING23Mar3113020168896
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783540515333_lsuk
Book Description Taschenbuch. Condition: 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. Seller Inventory # 9783540515333
Book Description Taschenbuch. Condition: 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. Seller Inventory # 9783540515333
Book Description Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. Seller Inventory # 4892010