Extensions of Logic Programming

5th International Workshop, ELP '96, Leipzig, Germany, March 28 - 30, 1996. Proceedings.

AvRoy Dyckhoff,Heinrich Herre

Häftad, Engelska, 1996

Del i serien Lecture Notes in Computer Science

552 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:1996-03-13
Mått:155 x 235 x 19 mm
Vikt:505 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:322
Upplaga:1996
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540609834

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Programspråk inom Data och IT

Innehållsförteckning

Semantics of constraint logic programs with bounded quantifiers.- Translating a modal language with embedded implication into Horn clause logic.- Pruning the search space of logic programs.- A significant extension of logic programming by adapting model building rules.- Efficient resource management for linear logic proof search.- A logic language based on GAMMA-like multiset rewriting.- Default negated conclusions: Why not?.- Handling equality in logic programming via basic folding.- An abstract machine for reasoning about situations, actions, and causality.- On the computational complexity of propositional logic programs with nested implications.- Proof-theory for extensions of Logic Programming.- A fibrational semantics for logic programs.- Higher Order Babel: Language and implementation.- A new framework for declarative programming: Categorical perspectives.- Extending constructive negation for partial functions in lazy functional-logic languages.- Super logic programs and negation as belief.- Total correctness of logic programs: A formal approach.- A declarative semantics for the Prolog cut operator.- A definitional approach to functional logic programming.- Soundness and completeness of non-classical extended SLD-resolution.- Some postulates for nonmonotonic theory revision applied to logic programming.