+612 9045 4394
 
CHECKOUT
Extensions of Logic Programming : 4th International Workshop, ELP '93, St Andrews, U.K., March 29 - April 1, 1993. Proceedings - Roy Dyckhoff

Extensions of Logic Programming

4th International Workshop, ELP '93, St Andrews, U.K., March 29 - April 1, 1993. Proceedings

By: Roy Dyckhoff (Editor)

Paperback

Published: 20th May 1994
Ships: 15 business days
15 business days
$135.51
or 4 easy payments of $33.88 with Learn more

Other Available Formats (Hide)

  • Paperback View Product Published: 13th March 1996
    Ships: 15 business days
    15 business days
    $125.05

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.

Design for AKL with intelligent pruning.- Contradiction: When avoidance equals removal Part I.- Birkhoff's HSP-theorem for cumulative logic programs.- Finite domains and exclusions as first-class citizens.- Some experimental results in implementing a logic language with multi-head clauses on a Transputer architecture.- A language with finite sets embedded in the CLP-scheme.- Finitary partial inductive definitions as a general logic.- Programming methodologies in GCLA.- Computing cost estimates for proof strategies.- Logic programming with multiple context management schemes.- Non-procedural logic programming.- Axioms in definitional calculi.- A proposal for modules in ?Prolog.- Regular search spaces as a foundation of logic programming.- Answer sets and nonmonotonic S4.- Contradiction: When avoidance equals removal Part II.- Cut formulae and logic programming.- Higher-order aspects of logic programming.- Representation and inference with consistent temporal propositions.- Definitional reflection and the completion.- Linear logic semantics for Concurrent Prolog.

ISBN: 9783540580256
ISBN-10: 3540580255
Series: Lecture Notes in Computer Science / Lecture Notes in Artific
Audience: General
Format: Paperback
Language: English
Number Of Pages: 368
Published: 20th May 1994
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 1.98
Weight (kg): 0.53