Extensions of Logic Programming : 4th International Workshop, ELP '93 St Andrews, U.K., March 29 April 1, 1993 Proceedings
The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolo...
Guardado en:
| Otros Autores: | |
|---|---|
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science. Lecture notes in artificial intelligence
798 |
| Materias: | |
| Acceso en línea: | 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: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Extensions of logic programming, 4th international workshop, ELP '93, St Andrews, U.K., March 29-April 1, 1993, proceedings, Roy Dyckhoff (ed.), Berlin, Springer-Verlag, 1994, 1 vol. (VIII-360 p.), Lecture notes in computer science, 0-387-58025-5 • Extensions of Logic Programming, Texte imprimé, 9783662201664 |
Tabla de Contenidos:
- Design for AKL with intelligent pruning
- Contradiction: When avoidance equals removal Part I
- Birkhoff's HSP-theorem for cumulative logic programs
- Finite domains and exclusions as first-class citizens
- Some experimental results in implementing a logic language with multi-head clauses on a Transputer architecture
- A language with finite sets embedded in the CLP-scheme
- Finitary partial inductive definitions as a general logic
- Programming methodologies in GCLA
- Computing cost estimates for proof strategies
- Logic programming with multiple context management schemes
- Non-procedural logic programming
- Axioms in definitional calculi
- A proposal for modules in ?Prolog
- Regular search spaces as a foundation of logic programming
- Answer sets and nonmonotonic S4
- Contradiction: When avoidance equals removal Part II
- Cut formulae and logic programming
- Higher-order aspects of logic programming
- Representation and inference with consistent temporal propositions
- Definitional reflection and the completion
- Linear logic semantics for Concurrent Prolog.