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

2018 ◽  
Vol 18 (5-6) ◽  
pp. 722-724
Author(s):  
FERDINANDO FIORETTO ◽  
ENRICO PONTELLI

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

2013 ◽  
Vol 13 (4-5) ◽  
pp. 593-607 ◽  
Author(s):  
GRAEME GANGE ◽  
JORGE A. NAVAS ◽  
PETER SCHACHTE ◽  
HARALD SØNDERGAARD ◽  
PETER J. STUCKEY

AbstractWe present a new execution strategy for constraint logic programs calledFailure Tabled CLP. Similarly toTabled CLPour strategy records certain derivations in order to prune further derivations. However, our method only learns fromfailed derivations. This allows us to computeinterpolantsrather thanconstraint projectionfor generation ofreuse conditions. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions.


2001 ◽  
Vol 19 (3) ◽  
pp. 209-255 ◽  
Author(s):  
Agostino Dovier ◽  
Enrico Pontelli ◽  
Gianfranco Rossi

Sign in / Sign up

Export Citation Format

Share Document