Mutually linked HASPs: A solution for constraint-satisfaction problems by associative processing

A model of a human associative processor (HASP) is applied to constraint-satisfaction problems. The structure of a problem is represented by an associative linkage structure between HASP'S. A solution is represented by a set of response patterns of HASP's, all of which satisfy the relationships specified between them. Relational structures between HASP's are divided into three classes according to the difficulty in solving problems. Several causes of the difficulty are analyzed in detail, and their solutions are discussed. A series of simulation studies has shown that HASP can solve problems very efficiently by its associative and parallel processing capabilities.