By Topic

Applying specialization-based parallel processing in constraint satisfaction problem solving

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hidemi Ogasawara ; School of Information Science and Technology, Chukyo University, Toyota, Aichi 470-0393, Japan ; Kiyoshi Akama ; Hiroshi Mabuchi

The purpose of this paper is to propose a method for constructing correct 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 demonstrate the advantage of using specialization rather than substitution in constraint satisfaction problem solving.

Published in:

Computer Sciences and Convergence Information Technology (ICCIT), 2010 5th International Conference on

Date of Conference:

Nov. 30 2010-Dec. 2 2010