Past and present (and future) of parallel and distributed computation in (constraint) logic programming
Declarative languages offer unprecedented opportunities for the use of parallelism to speed up execution. A declarative language, being not procedural, removes the need to perform operations in a strict order and reduces the number of dependencies among operations, thus opening the doors for concurr...
Saved in:
| Published in: | Theory and practice of logic programming Vol. 18; no. 5-6; pp. 722 - 724 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Cambridge, UK
Cambridge University Press
01.09.2018
|
| Subjects: | |
| ISSN: | 1471-0684, 1475-3081 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Declarative languages offer unprecedented opportunities for the use of parallelism to speed up execution. A declarative language, being not procedural, removes the need to perform operations in a strict order and reduces the number of dependencies among operations, thus opening the doors for concurrent execution. The potential for transparent exploitation of parallelism in logic programming emerged almost immediately with the birth of the paradigm (Pollard 1981). |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 content type line 14 ObjectType-Editorial-2 ObjectType-Commentary-1 |
| ISSN: | 1471-0684 1475-3081 |
| DOI: | 10.1017/S1471068418000406 |