Abstract
The Constraint Satisfaction Problem (CSP) is a mathematical abstraction of the problems in many AI application domains. In many of such applications timely response by a CSP solver is so crucial that to achieve it, the user may be willing to sacrifice completeness to a certain extent. This paper describes a neural network approach for solving CSPs which aims at providing prompt responses. The effectiveness of this model, which is called GENET, in solving CSPs with binary constraints is demonstrated by a simulator. Although the completeness is not guaranteed, as in the case of most of the existing stochastic search techniques, solutions have been found by the GENET simulator in all of our randomly generated problems tested so far. Since the neural network model lends itself to the VLSI implementation of parallel processing architectures, the limited number of cycles required by GENET to find the solutions for the tested problems gives hope for solving large CSPs in a fraction of the time required by conventional methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Waltz, D.L., “Understanding line drawings of scenes with shadows”, in WINSTON, P.H. (ed.) The Psychology of Computer Vision, McGraw-Hill, New York, 1975, 19–91
Tsang, E.P.K., “The consistent labelling problem in temporal reasoning”, Proc. AAAI Conference, Seattle, July, 1987, 251–255
Dechter, R., Meiri, I. and Pearl, J., “Temporal constraint networks”, Artificial Intelligence, 49, 1991, 61–95
Stefik, M., “Planning with Constraints (MOLGEN: part 1)”, Artificial Intelligence 16, 1981, 111–140
Prosser, P., “Distributed asynchronous scheduling”, PhD Thesis, Department of Computer Science, University of Strathclyde, November, 1990
Mackworth, A.K., “Consistency in networks or relations”, Artificial Intelligence 8 (1), 1977, 99–118
Haralick, R.M. and Elliott, G.L., “Increasing tree search efficiency for constraint satisfaction problems”, Artificial Intelligence 14 (1980), 263–313
Dincbas, M., Simonis, H. and Van Hentenryck, P., “Solving car sequencing problem in constraint logic programming”, Proceedings, European Conference on AI, 1988, 290–295
Dincbas, M., Van Hentenryck, P., Simons, H., Aggoun, A. and Graf, T., “Applications of CHIP to industrial and engineering problems”, First International Conference on Industrial and Engineering Applications of AI and Expert Systems, June, 1988
Perrett, M., “Using Constraint Logic Programming Techniques in Container Port Planning”, ICL Technical Journal, May 1991
Saletore, V.A. and Kale, L.V., “Consistent linear speedups to a first solution in parallel state-space search”, Proc. AAAI, 1990, 227–233
Kasif, S., “On the parallel complexity of discrete relaxation in constraint satisfaction networks”, Artificial Intelligence (45) 1990, 275–286
Hopfield, J. J., and Tank, D.W., ‘Neural’ Computation of Decisions in Optimization Problems“, Biol. Cybern. (52) 1985, 141–152
Adorf, H.M. and Johnston, M.D., “A discrete stochastic neural network algorithm for constraint satisfaction problems”, Proceedings, International Joint Conference on Neural Networks, 1990
Minton, S., Johnston, M.D., Philips, A. B. and Laird, P., “Solving large-scale constraint-satisfaction and scheduling problems using a heuristic repair method”, Proc. AAAI, 1990, 17–24
Swain, M.J. and Cooper, P.R., “Parallel hardware for constraint satisfaction”, Proc. AAAI, 1988, 682–686
Cooper, P., “Structure recognition by connectionist relaxation: formal analysis”, Proc. Canadian AI Conference (CSCSI), 1988, 148–155
Guesgen, H.W., “Connectionist networks for constraint satisfaction”, AAAI Spring Symposium on Constraint-based Reasoning, March, 1991, 182–190
Collin Z., Dechter, R. and Katz, S., “On the Feasibility of distributed constraint satisfaction”, Proc. International Joint Conference on AI, 1991, 318–324
Wang, C. J., and Tsang, E. T. K., “Solving constraint satisfaction problems using neural networks”, Proc. TEE Second International Conference on Artificial Neural Networks, 1991
Davis, L. (ed.), “Genetic algorithms and simulated annealing”, Research notes in AI, Pitman/Morgan Kaufmann, 1987
Wang, C.J., “A cascadable parallel architecture for GENET”, Research Notes, Department of Computer Science, University of Essex, forthcoming.
Freuder, E.C., “Partial constraint satisfaction”, Proc., 11th International Joint Conference on AI, 1989, 278–283
Parrello, B.D., Kabat, W.C. and Wos, L., “Job-shop scheduling using automated reasoning: a case study of the car sequencing problem”, Journal of Automatic Reasoning, 2 (1), 1986, 1–42
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London Limited
About this paper
Cite this paper
Tsang, E.P.K., Wang, C.J. (1992). A Generic Neural Network Approach For Constraint Satisfaction Problems. In: Taylor, J.G. (eds) Neural Network Applications. Perspectives in Neural Computing. Springer, London. https://doi.org/10.1007/978-1-4471-2003-2_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2003-2_2
Publisher Name: Springer, London
Print ISBN: 978-3-540-19772-0
Online ISBN: 978-1-4471-2003-2
eBook Packages: Springer Book Archive