Extensions Logic Programming 4th (4 results)
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 70.02
US$ 15.11 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In English.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 65.89
US$ 20.73 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
Paperback. Condition: New.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 63.18
US$ 72.08 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.…
- Softcover
Seller: Buchpark, Trebbin, GermanyBuchpark
Contact seller5-star sellerCondition: Used - Fine
US$ 47.81
US$ 120.42 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 376 | Sprache: Englisch | Produktart: Bücher | The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.…
