Non-monotonic extensions of logic programming : Second International Workshop, NMELP '96, Bad Honnef, Germany, September 5 6, 1996 : selected papers
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 r...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science. Lecture notes in artificial intelligence
1216 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Actes d'un séminaire tenu à Bad Honnef du 5 au 6 septembre 1996, d'après l écran-titre Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Non-monotonic extensions of logic programming, Second International Workshop, NMELP '96, Bad Honnef, Germany, September 5-6, 1996, selected papers, Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski, eds, 1997, Berlin, Springer, 1 vol. (XII-224 p.), Lecture notes in computer science, 3-540-62843-6 • Non-Monotonic Extensions of Logic Programming, Texte imprimé, 9783662164006 |
Obsah:
- 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.