The purpose of this paper is to propose a framework for constructing correct parallel processing programs based on Equivalent Transformation Framework (ETF). ETF regards computation as In the framework, a problem’s domain knowledge and a query are described in definite clauses, and computation is regarded as transformation of the definite clauses. Its meaning is defined by a model of the set of definite clauses, and the transformation rules generated must preserve meaning. We have proposed a parallel processing method based on “specialization”, a part of operation in the transformations, which resembles substitution in logic programming. The method requires “Memo-tree”, a history of specialization to maintain correctness. In this paper we proposes the new method for the specialization-base parallel processing without Memo-tree. Keywords—Parallel processing, Program correctness, Equivalent transformation, Specializer generation rule
[1]
Kiyoshi Akama,et al.
Formalization of the Equivalent Transformation Computation Model
,
2006,
J. Adv. Comput. Intell. Intell. Informatics.
[2]
Willem Jan van Hoeve,et al.
Global Constraints
,
2006,
Handbook of Constraint Programming.
[3]
Mats Carlsson,et al.
Parallel execution of prolog programs: a survey
,
2001,
TOPL.
[4]
Laxmikant V. Kalé,et al.
Machine Independent AND and OR Parallel Execution of Logic Programs: Part I-The Binding Environment
,
1994,
IEEE Trans. Parallel Distributed Syst..
[5]
Jacques Chassin de Kergommeaux,et al.
Parallel logic programming systems
,
1994,
CSUR.