A Connectionist Approach to Symbolic Constraint Satisfaction
| Title | A Connectionist Approach to Symbolic Constraint Satisfaction |
| Publication Type | Technical Report |
| Year of Publication | 1990 |
| Authors | Guesgen, H. Werner |
| Other Numbers | 582 |
| Abstract | Algorithms for solving constraint satisfaction problems, i.e., for finding one, several, or all solutions for a set of constraints on a set of variables, have been introduced in a variety of papers in the area of Artificial Intelligence. Here, we illustrate how a connectionist network for constraint satisfaction can be implemented.The idea is to use a connectionist node for each value of each variable and for each tuple of each constraint of the constraint satisfaction problem, and to connect them according to the way in which the constraints are related to the variables. Goedel numbers are used as potentials of the nodes that correspond to variables, representing possible paths of solutions. |
| URL | http://www.icsi.berkeley.edu/pubs/techreports/tr-90-18.pdf |
| Bibliographic Notes | ICSI Technical Report TR-90-018 |
| Abbreviated Authors | H. W.Guesgen |
| ICSI Publication Type | Technical Report |