Titlebook: Parallelization in Inference Systems; International Worksh B. Fronh?fer,G. Wrightson Conference proceedings 1992 Springer-Verlag Berlin Hei

fulcrum

騷擾

創(chuàng)作

Using the Reform inference system for parallel Prolog,amming language Prolog. We retain the sequential left-to-right depth-first backtracking scheme with one exception: the recursion levels of a recursive program, including the head unifications at each level, are computed in parallel. We discuss criteria for when a program is amenable to this kind of

osteocytes

Random competition: A simple, but efficient method for parallelizing inference systems, processors solve the same task without any communication. Their programs only differ in the initialization of the random number generator used for branch selection in depth first backtracking search. This model, called random competition, permits us to calculate analytically the parallel performanc

ALOFT

Parallel and efficient implementation of the compartmentalized connection graph proof procedure: Resolution to unification,heorem prover. Whilst the research has as it main goal the development of a language in which programs can be written with much less explicit control than PROLOG and its existing successors, a secondary goal is to exploit the immense parallelism inherent in the connection graph. This is what is in f

流動(dòng)性

Constraint satisfaction via partially parallel propagation steps,heir finite domains, the admissible combinations of values form a set of .-tuples which represents the globally consistent solution. This article presents a parallel approach to global constraint satisfaction.