Non-monotonic extensions of logic programming : ICLP '94 workshop, Santa Margherita Ligure, Italy, June 17, 1994 : selected papers
This volume is based on papers presented during the ICLP '94 Workshop on Nonmonotonic Extensions of Logic Programming and on papers solicited afterwards from key researchers participating in the workshop. In total 10 carefully refereed, revised, full research papers on semantics and computation...
Salvato in:
| Autore principale: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science. Lecture notes in artificial intelligence
927 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Actes d'un séminaire tenu à Santa Margherita Ligure le17 juin 1994, 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, ICLP '94 workshop, Santa Margherita Ligure, Italy, June 17, 1994, selected papers, Jürgen Dix, Louis Moniz Pereira, Teodor C. Przymusinski, eds, Berlin, Springer-Verlag, 1995, 1 vol. (VI-229 p.), Lecture notes in computer science, 3-540-59467-1 • Non-Monotonic Extensions of Logic Programming, Texte imprimé, 9783662180822 |
Sommario:
- An argumentation theoretic semantics based on non-refutable falsity
- From disjunctive programs to abduction
- Samantics of normal and disjunctive logic programs a unifying framework
- Every normal program has a nearly-stable model
- Logic programming with assumption denial
- A resolution-based procedure for default theories with extensions
- A general approach to bottom-up computation of disjunctive semantics
- Static semantics as program transformation and well-founded computation
- Magic computation for well-founded semantics
- Computing stable and partial stable models of extended disjunctive logic programs.