Wechler Wolfgang (71 results)

Paperback. Condition: Very Good. Sorry, No international shipping on this item.0387531629 Ex-library paperback in very nice condition with the usual markings and attachments.

Condition: Good. *Price HAS BEEN REDUCED by 10% until Monday, Sept. 28 (weekend SALE item)* 278 pp., Paperback, ex library, some wear to cover, else textually clean and tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Paperback. Condition: New.

PF. Condition: New.

Paperback. Condition: New. 1990 ed.

Condition: New. In English.

Condition: New. In English.

Condition: New. pp. 284.

hardcover. Condition: Sehr gut. 351 Seiten; 9783540542803.2 Gewicht in Gramm: 1.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the proceedings of the First International Workshop on Algebraic and Logic Programming held in Gaussig (German Democratic Republic) from November 14 to 18, 1988. The workshop was devoted to Algebraic Programming, in the sense of programming by algebraic specifications and rewrite rule systems, and Logic Programming, in the sense of Horn clause specifications and resolution systems. This includes combined algebraic/logic programming systems, mutual relations and mutual implementation of programming paradigms, completeness and efficiency considerations in both fields, as well as related topics.…

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Proving and rewriting.- Proving correctness w.r.t. specifications with hidden parts.- Hybrid implementations of algebraic specifications.- Multi-modal logic programming using equational and order-sorted logic.- Logic programs with equational type specifications.- Higher-order order-sorted algebras.- Axiomatization of a functional logic language.- Fourier algorithm revisited.- Fixpoint techniques for non-monotone maps.- Domain theory for nonmonotonic functions.- On the strong completion of logic programs.- An equivalence preserving first order unfold/fold transformation system.- Propositional calculus problems in CHIP.- Unfolding and fixpoint semantics of concurrent constraint logic programs.- Eliminating negation from normal logic programs.- On logic programming interpretations of Dislog: Programming long-distance dependencies in logic.- Recursive query processing in predicate-goal graph.- Implementation of completion by transition rules + control: ORME.- A matching process modulo a theory of categorical products.- Equation solving in conditional AC-theories.- Lazy narrowing in a graph machine.- An abstract concurrent machine for rewriting.- Applying term rewriting methods to finite groups.- Termination proofs by multiset path orderings imply primitive recursive derivation lengths.- Optimization of rewriting and complexity of rewriting.- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering.…

HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Condition: New.

Hardback. Condition: New. Reprint 2022.

Condition: New. In English.

Condition: New.

Condition: new.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: New. 1990 ed.

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: New. pp. 356.

Condition: New. In English.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - A new model-theoretic approach to universal algebra is offered in this book. Written for computer scientists, it presents a systematic development of the methods and results of universal algebra that are useful in a variety of applications in computer science. The notation is simple and the concepts are clearly presented. The book concerns the algebraic characterization of axiomatic classes of algebras (equational, implicational, and universal Horn classes) by closure operators generalizing the famous Birkhoff Variety Theorem, and the algebraic characterization of the related theories. The book also presents a thorough study of term rewriting systems. Besides basic notions, the Knuth-Bendix completion procedure and termination proof methods are considered. A third main topic is that of fixpoint techniques and complete ordered algebras. Algebraic specifications of abstract data types and algebraic semantics of recursive program schemes are treated as applications. The book is self-contained and suitable both as a textbook for graduate courses and as a reference for researchers.…

Condition: New.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: Brand New. reprint edition. 284 pages. 6.69x0.69x9.61 inches. In Stock.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - No detailed description available for 'Algebraic and Logic Programming'.

Condition: New. Reprint 2022 edition NO-PA16APR2015-KAP.

Paperback. Condition: Brand New. reprint edition. 356 pages. 9.50x6.60x0.90 inches. In Stock.

Hardback. Condition: New. Reprint 2022.