Non-monotonic extensions of logic programming : Second International Workshop, NMELP '96, Bad Honnef, Germany, September 5-6, 1996 : selected papers
Author(s)
Bibliographic Information
Non-monotonic extensions of logic programming : Second International Workshop, NMELP '96, Bad Honnef, Germany, September 5-6, 1996 : selected papers
（Lecture notes in computer science, 1216 . Lecture notes in artificial intelligence）
Springer, c1997
- : kart
Available at / 47 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||121697007066
-
University of Tsukuba Library, Library on Library and Information Science
007.08:L-49:1216971001850
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references
Description and Table of Contents
Description
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.
Table of Contents
Prolegomena to logic programming for non-monotonic reasoning.- On logics and semantics for general logic programs.- A new logical characterisation of stable models and answer sets.- Aggregation and well-founded semantics+.- Nonmonotonic reasoning by monotonic inferences with priority constraints.- Update-programms can update programs.- An abductive proof procedure for reasoning about actions in modal logic programming.- Update programs versus revision programs.- Transformation-based bottom-up computation of the well-founded model.- Computation of non-ground disjunctive well-founded semantics with constraint logic programming.
by "Nielsen BookData"