Add to ORKGThis thesis studies the adequacy of parallel logic programming languages for the purpose of parallel symbolic computation. We conclude that the languages of the guarded Horn clause type are best suited for parallel Symbolic Computation. Various programming examples show that the usage of logic languages is a major step forward in parallel programming. In a case study we describe a novel approach to the parallelization of Buchberger's Grobner bases algorithm using a medium grain pipe-line principle for the polynomial reduction. The approach is implemented in STRAND88 on a 17 transputer distributed memory system and shows a remarkable speed-up
Since the early days of logic programming, researchers in the field realized the potential for ex-pl...
It is proposed that Normal Logic Programs with an explicit time ordering are a suitable basis for a ...
We investigate the claim that functional languages offer low-cost parallelism in the context of symb...
This thesis studies the adequacy of parallel logic programming languages for the purpose of parallel...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
Projet CHLOEParallelizing logic programming has attracted much interest in the research community, b...
Since the early days of logic programming, researchers in the field realised the potential for explo...
. We propose an alternate approach to the usual introduction of parallelism in logic programming. In...
Multi-core and highly connected architectures have become ubiquitous, and this has brought renewed i...
AbstractWe address the problem of parallelizing the evaluation of logic programs in data intensive a...
With the advent of symbolic mathematical software packages such as Maple, Mathematics, and Macsyma, ...
This paper shows the advantages of implementing an abstract intermediate machine for a parallel logi...
This report continues to document the development of a logic programming paradigm with implicit cont...
A language for a parallel, logic graph reduction system is described in this dissertation. The langu...
Shared Prolog is a language for symbolic computing that combines distributed coordination based on a...
Since the early days of logic programming, researchers in the field realized the potential for ex-pl...
It is proposed that Normal Logic Programs with an explicit time ordering are a suitable basis for a ...
We investigate the claim that functional languages offer low-cost parallelism in the context of symb...
This thesis studies the adequacy of parallel logic programming languages for the purpose of parallel...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
Projet CHLOEParallelizing logic programming has attracted much interest in the research community, b...
Since the early days of logic programming, researchers in the field realised the potential for explo...
. We propose an alternate approach to the usual introduction of parallelism in logic programming. In...
Multi-core and highly connected architectures have become ubiquitous, and this has brought renewed i...
AbstractWe address the problem of parallelizing the evaluation of logic programs in data intensive a...
With the advent of symbolic mathematical software packages such as Maple, Mathematics, and Macsyma, ...
This paper shows the advantages of implementing an abstract intermediate machine for a parallel logi...
This report continues to document the development of a logic programming paradigm with implicit cont...
A language for a parallel, logic graph reduction system is described in this dissertation. The langu...
Shared Prolog is a language for symbolic computing that combines distributed coordination based on a...
Since the early days of logic programming, researchers in the field realized the potential for ex-pl...
It is proposed that Normal Logic Programs with an explicit time ordering are a suitable basis for a ...
We investigate the claim that functional languages offer low-cost parallelism in the context of symb...