This book constitutes the refereed proceedings of the 5th International Workshop on Extensions of Logic Programming, ELP '96, held in Leipzig, Germany in March 1996.
The 18 full papers included were carefully selected by the program committee and are presented together with three invited papers. Among the topics addressed in this book are categorical logic programming, correctness of logic programs, functional-logic languages, implementation issues, linear logic programming, nonmonotonic reasoning, and proof search.
Author(s): Martin Argenius, Andrei Voronkov (auth.), Roy Dyckhoff, Heinrich Herre, Peter Schroeder-Heister (eds.)
Series: Lecture Notes in Computer Science 1050 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1996
Language: English
Pages: 322
Tags: Artificial Intelligence (incl. Robotics); Programming Techniques; Mathematical Logic and Formal Languages
Semantics of constraint logic programs with bounded quantifiers....Pages 1-18
Translating a modal language with embedded implication into Horn clause logic....Pages 19-33
Pruning the search space of logic programs....Pages 35-49
A significant extension of logic programming by adapting model building rules....Pages 51-65
Efficient resource management for linear logic proof search....Pages 67-81
A logic language based on GAMMA-like multiset rewriting....Pages 83-101
Default negated conclusions: Why not?....Pages 103-117
Handling equality in logic programming via basic folding....Pages 119-136
An abstract machine for reasoning about situations, actions, and causality....Pages 137-151
On the computational complexity of propositional logic programs with nested implications....Pages 153-159
Proof-theory for extensions of Logic Programming....Pages 161-175
A fibrational semantics for logic programs....Pages 177-191
Higher Order Babel: Language and implementation....Pages 193-207
A new framework for declarative programming: Categorical perspectives....Pages 209-211
Extending constructive negation for partial functions in lazy functional-logic languages....Pages 213-227
Super logic programs and negation as belief....Pages 229-235
Total correctness of logic programs: A formal approach....Pages 237-254
A declarative semantics for the P rolog cut operator....Pages 255-271
A definitional approach to functional logic programming....Pages 273-287
Soundness and completeness of non-classical extended SLD-resolution....Pages 289-301
Some postulates for nonmonotonic theory revision applied to logic programming....Pages 303-318
