Correctness of Specialization-Based Parallel Processing Algorithm for Constraint Satisfaction Problem
Hidemi Ogasawara, Kiyoshi Akama, Hiroshi Mabuchi · Journal of Communications and Information Sciences · 2011
The purpose of this paper is to discuss the correctness of a method for constructing parallel processing programs from a problem description. The framework we adopt for this purpose is Equivalent Transformation Framework (ETF), which regards computation as transformation of definite clauses. In the framework, a problem's domain knowledge and a query are described in definite clauses, and its meaning is defined by a model of the set of definite clauses. Then meaning-preserving transformation rules for the query are generated. We propose a parallel processing method based on “specialization”, a part of operation in the transformations, and discuss new parallel processing method based on the specialization that maintains correctness of the computation. The specialization is generalized notion of substitution in logic programming, and it allows more rich representation. We examine the correctness of our approach based the specialization.