Extensions of Logic Programming

Roy Dyckhoff

ISBN 10: 3540580255 / ISBN 13: 9783540580256

Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 1994

About this Item

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.

Seller Inventory # LU-9783540580256

Bibliographic Details

• Title: Extensions of Logic Programming
• Publisher: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE
• Publication Date: 1994
• Language: English
• ISBN 10: 3540580255
• ISBN 13: 9783540580256
• Binding: Paperback
• Edition: 1994 ed.
• Condition: New
• Dimensions: 15.49W x 2.16H x 23.5D centimeters 15.49 centimeters width by 2.16 centimeters height by 23.5 centimeters depth
• Weight: 526 grams

About this title

Synopsis

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.