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.
Author(s): Roy Dyckhoff (eds.)
Series: Lecture Notes in Computer Science 798 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1994
Language: English
Pages: 368
Tags: Artificial Intelligence (incl. Robotics); Programming Techniques; Mathematical Logic and Formal Languages
Introduction....Pages 1-2
Design for AKL with intelligent pruning....Pages 3-10
Contradiction: When avoidance equals removal Part I....Pages 11-23
Birkhoff's HSP-theorem for cumulative logic programs....Pages 24-36
Finite domains and exclusions as first-class citizens....Pages 37-61
Some experimental results in implementing a logic language with multi-head clauses on a Transputer architecture....Pages 62-76
A language with finite sets embedded in the CLP-scheme....Pages 77-93
Finitary partial inductive definitions as a general logic....Pages 94-119
Programming methodologies in GCLA....Pages 120-151
Computing cost estimates for proof strategies....Pages 152-170
Logic programming with multiple context management schemes....Pages 171-182
Non-procedural logic programming....Pages 183-195
Axioms in definitional calculi....Pages 196-205
A proposal for modules in λProlog....Pages 206-221
Regular search spaces as a foundation of logic programming....Pages 222-254
Answer sets and nonmonotonic S4....Pages 255-267
Contradiction: When avoidance equals removal Part II....Pages 268-281
Cut formulae and logic programming....Pages 282-300
Higher-order aspects of logic programming....Pages 301-321
Representation and inference with consistent temporal propositions....Pages 322-332
Definitional reflection and the completion....Pages 333-347
Linear logic semantics for Concurrent Prolog....Pages 348-360
