Non-Monotonic Extensions of Logic Programming

Second International Workshop NMELP '96, Bad Honnef, Germany September 5 - 6, 1996, Selected Papers
1997
ISBN: 978-3-540-62843-9
Verlag: Springer Berlin Heidelberg

Buch, Englisch, 231 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 376 g

Reihe: Lecture Notes in Artificial Intelligence

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.

Zielgruppe

Research

Autoren/Hrsg.

Dix, Juergen

Przymusinski, Teodor C.

Moniz Pereira, Luis

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Rechnerarchitektur
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen

Inhaltsverzeichnis

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.