Non-Monotonic Extensions of Logic Programming: Second International Workshop, NMELP '96 Bad Honnef, Germany, September 5–6, 1996 Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the thoroughly refereed post-workshop proceedings of the 6th International Workshop on Non-Monotonic Extensions of Logic Programming, NMELP '96, held in Bad Honnef, Germany, in September 1996.
The nine full papers presented in the volume in revised version were carefully reviewed and selected from a total of 18 submissions; the set of papers addresses theoretical, applicational and implementational issues and reflects the current state of the art in the area of non-monotonic extensions of logic programming. An introductory survey by the volume editors entitled "Prolegomena to Logic Programming for Non-Monotonic Reasoning" deserves special mentioning; it contains a bibliography listing 136 entries.

Author(s): Jürgen Dix, Luís Moniz Pereira (auth.), Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski (eds.)
Series: Lecture Notes in Computer Science 1216 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997

Language: English
Pages: 231
Tags: Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Programming Techniques

Prolegomena to logic programming for non-monotonic reasoning....Pages 1-36
On logics and semantics for general logic programs....Pages 37-56
A new logical characterisation of stable models and answer sets....Pages 57-70
Aggregation and well-founded semantics+....Pages 71-90
Nonmonotonic reasoning by monotonic inferences with priority constraints....Pages 91-109
Update-programms can update programs....Pages 110-131
An abductive proof procedure for reasoning about actions in modal logic programming....Pages 132-150
Update programs versus revision programs....Pages 151-170
Transformation-based bottom-up computation of the well-founded model....Pages 171-201
Computation of non-ground disjunctive well-founded semantics with constraint logic programming....Pages 202-224