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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Dix, Juergen (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Moniz Pereira, Luis (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Przymusinski, Teodor C. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
• Έκδοση: 1st ed. 1997.
• Σειρά: Lecture Notes in Artificial Intelligence ; 1216
• Θέματα: Architecture, Computer.; Programming languages (Electronic computers).; Artificial intelligence.; Mathematical logic.; Computer programming.; Computer System Implementation.; Programming Languages, Compilers, Interpreters.; Artificial Intelligence.; Mathematical Logic and Formal Languages.; Programming Techniques.

 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. 

 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.