Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-23T11:47:36.104Z Has data issue: false hasContentIssue false
  • English
  • Français

Past and present (and future) of parallel and distributed computation in (constraint) logic programming

Published online by Cambridge University Press:  05 September 2018

FERDINANDO FIORETTO  and
ENRICO PONTELLI Open the ORCID record for ENRICO PONTELLI [Opens in a new window]
FERDINANDO FIORETTO
Affiliation:
University of Michigan, Ann Arbor, MI 48109, USA (e-mail: [email protected])
ENRICO PONTELLI
Affiliation:
New Mexico State University, Las Cruces, NM 88003, USA (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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).

Type
Editorial
Information
Theory and Practice of Logic Programming , Volume 18 , Special Issue 5-6: Special Issue on Parallel and Distributed Logic Programming , September 2018 , pp. 722 - 724
Copyright
Copyright © Cambridge University Press 2018 

References

Dovier, A., Formisano, A. and Pontelli, E. 2018. Parallel answer set programming. In Handbook of Parallel Constraint Reasoning. Hamadi, Y. and Sais, L., Eds. Springer International Publishing: Heidelberg, Germany, 237–282.Google Scholar
Gupta, G., Pontelli, E., Carlsson, M., Hermenegildo, M. and Ali, K. 2001. Parallel execution of prolog programs: A survey. ACM Transactions on Programming Languages and Systems 23, 4, 472–602.Google Scholar
Hyvarinen, A. and Wintersteiger, C. 2018. Parallel satisfiability modulo theories. In Handbook of Parallel Constraint Reasoning. Hamadi, Y. and Sais, L., Eds. Springer: Heidelberg, Germany, 141–178.Google Scholar
Pollard, G. H. 1981. Parallel Execution of Horn Clause Programs. PhD Thesis, Department of Computing, Imperial College, London.Google Scholar