A tight, practical integration of relations and functions
As in other fields, in computer science certain objects of study can be synthesized from different basic elements, in different ways, and with different resulting stabilities. In subfields such as artificial intelligence, computational logic, and programming languages various relational and function...
Salvato in:
| Autore principale: | |
|---|---|
| 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
1712 |
| 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: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • A tight, practical integration of relations and functions, Harold Boley, 1999, Berlin, Springer, 1 vol. (XI-169 p.), Lecture notes in computer science, 3-540-66644-3 • A Tight, Practical Integration of Relations and Functions, Texte imprimé, 9783662200636 |
Sommario:
- An overview of the relational-functional language RELFUN
- Extended logic-plus-functional programming
- A direct semantic characterization of RELFUN
- Finite domains and exclusions as first-class citizens
- Multiple-valued Horn clauses and their WAM compilation.