Cantitate/Preț
Produs

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, cartea 1216

Editat de Juergen Dix, Luis Moniz Pereira, Teodor C. Przymusinski
en Limba Engleză Paperback – 9 apr 1997
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32425 lei

Preț vechi: 40531 lei
-20% Nou

Puncte Express: 486

Preț estimativ în valută:
6207 6452$ 5147£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540628439
ISBN-10: 3540628436
Pagini: 244
Ilustrații: XIII, 231 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.35 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.