A Method of Independent Parallel Processing of Constraint Satisfaction and Other Problems using CCM: A Model for Emergent Computation
Kanada, Y., 49th National Conference, Information Processing Society of Japan, 4-321 - 322, 1994, Published by IPSJ.
[ 日本語のページ ]
[ Paper PDF file (in Japanese) ] [ Paper postscript file: Part 1, Part 2 (in Japanese) ]
[ OHP postscript file: Slides, Handout ] [ OHP PDF ファイル: Slides, Handout ]
Abstract: A computation model called CCM was proposed by the author. CCM is developed toward establishing a problem solving methodology based on emergent computation, which is open to continually varying environment. CCM is a production system with evaluation functions, which are computed using only local information, and CCM works randomly. A computational language called SOOC-94 is used for experiments based on CCM. The features and implementation of SOOC-94 are explained using the magic square problem as an example. The features of SOOC-94 are that the automatic computation of evaluation functions and automatic local backtracking are taken place when applying a rule, that the syntax of the patterns in LHS and RHS are almost unified, the existence of two scheduling strategies, especially the random strategy, on the order of rule applications, that the existence of same name elements in a datum (structure) is allowed, and so on.
Introduction to this research theme: CCM: Chemical-Computation Model