Abstract
Constraint Satisfaction Problem (CSP) is an important problem in artificial intelligence and operations research. Many practical problems can be formulated as CSP, i.e., finding a consistent value assignment to variables subject to a set of constraints. In this paper, we give a quantitative approach to solve the CSPs which deals uniformly with binary constraints as well as high order,k-ary (k ≥ 2) constraints. In this quantitative approach, using variable transformation and constraint transformation, a CSP is transformed into a satisfiability (SAT) problem. The SAT problem is then solved within a continuous search space. We will evaluate the performance of this method based on randomly generated SAT problem instances and regularly generatedk-ary (k ≥ 2) CSP problem instances.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bitner, J. R. and Reingold, E. M., “Backtrack Programming Techniques,”Comm. of ACM, 18, 11, pp. 651–656, Nov. 1975.
Cook, S. A., “The Complexity of Theorem-Proving Procedures,” inProceedings of the Third ACM Symposium on Theory of Computing, pp. 151–158, 1971.
Davis, M. and Putnam, H., “A Computing Procedure for Quantification Theory,”J. of ACM, pp. 201–215, 1960.
Dechter, R. and Pearl, J., “Network-Based Heuristics for Constraint-Satisfaction Problems,”Artificial Intelligence, 34, pp. 1–38, 1988.
Freuder, E. C., “A Sufficient Condition for Backtrack-Free Search,”J. ACM, 29, 1, pp. 24–32, Jan. 1982.
Freuder, E. C., “A Sufficient Condition for Backtrack-Bounded Search,”J. ACM, 32, 4, pp. 755–761, Oct. 1985.
Garey, M. R. and Johnson, D. S.,Computers and Intractability: A Guide to the Theory of NP Completeness, W. H. Freeman and Company, San Francisco, 1979.
Gaschnig, J., “Performance Measurements and Analysis of Certain Search Algorithms,”Ph. D thesis, Carnegie-Mellon University, Department of Computer Science, May 1979.
Gu, J., “How to Solve Very Large-Scale Satisfiability (VLSS) Problems,”Technical Report, 1988. (Present in part in, Gu, J., “Benchmarking SAT Algorithms,”Technical Report, UCECE-TR-90-002, 1990).
Gu, J., “The UniSAT Problem Models (Appendix),”IEEE Trans. on Pattern Analysis and Machine Intelligence, 14, 8, p. 865, Aug. 1992.
Gu, J., “Efficient Local Search for Very Large-Scale Satisfiability Problem,”SIGART Bulletin, 3, 1, pp. 8–12, ACM Press, Jan. 1992.
Gu, J., “Local Search for Satisfiability (SAT) Problem,”IEEE Trans. on Systems, Man, and Cybernetics, 23, 4, pp. 1108–1129, July/Aug. 1993.
Gu, J.,Global Optimization for Satisfiability (SAT) Problem, IEEE Trans. on Knowledge and Data Engineering, 6(3): 361–381, June 1994.
Gu, J., “On Optimizing a Search Problem,” inAdvanced Series on Artificial Intelligence Vol. 1, chapter 2, World Scientific, New Jersey, pp. 63–105, Jan. 1992.
Gu, J.Constraint-Based Search, Cambridge University Press, New York, 1995.
Gu, J. and Wang, W., “A Novel Discrete Relaxation Architecture,”IEEE Trans. on Pattern Analysis and Machine Intelligence, 14, 8, pp. 857–865, Aug. 1992.
Gu, J., Wang, W., and Henderson, T. C., “A Parallel Architecture for Discrete Relaxation Algorithm,”IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-9, 6, pp. 816–831, Nov. 1987.
Haralick, R. M. and Elliot, G., “Increasing Tree Search Efficiency for Constraint Satisfaction Problems,”Artificial Intelligence, 14, pp. 263–313, 1980.
Haralick, R. M. and Shapiro, L. G., “The Consistent Labeling Problem: Part 1,”IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-1, 2, pp. 173–184, Apr. 1979.
Hooker, J. N., “A Quantitative Approach to Logical Inference,”Decision Support Systems, 4, pp. 45–69, 1988.
Hooker, J. N., “Resolution vs. Cutting Plane Solution of Inference Problems: Some Computational Experience,”Operations Research Letter, 7, 1, pp. 1–7, 1988.
Horowitz, E. and Sahni, S.,Fundamentals of Computer Algorithms, Computer Science Press, Rockville, 1978.
Jeroslow, R. G., “Computation-Oriented Reductions of Predicate to Propositional Logic,”Decision Support Systems, 4, pp. 183–197, 1988.
Kamath, A. P., Karmarkar, N. K., Ramakrishnan, K. G., and Resende, M. G. C., “Computational Experience with an Interior Point Algorithm on the Satisfiability Problem,”Working Paper, Mathematical Science Research Center, AT&T Bell Laboratories, Oct. 1989.
Kumar, V., “Algorithms for Constraint Satisfaction Problems: A Survey,”Technical Report, TR-91-28, Department of Computer Science, University of Minnesota, 1991.
Kumar, V., “Algorithms for Constraint Satisfaction Problems: A Survey,”The AI Magazine, 13, 1, pp. 32–44, 1992.
Luenberger, D. G.Linear and Nonlinear Programming, Addison-Wesley, Reading, 1984.
Mackworth, A. K., “Consistency in Networks of Relations,”Artificial Intelligence, 8, pp. 99–119, 1977.
Martins, J. P. and Shapiro, S. C., “Theoretical Foundations for Belief Revision,” inProceedings Conference on Theoretical Aspects of Reasoning about Knowledge, pp. 383–398, 1986.
Mohr, R. and Henderson, T. C., “Arc and Path Consistency Revisited,”Artificial Intelligence, 28, pp. 225–233, 1986.
Montanari, U., “Networks of Constraints: Fundamental Properties and Applications to Picture Processing,”Information Sciences, 7, pp. 95–132, 1974.
Nadel, B. A., “Constraint Satisfaction Algorithms,”Computational Intelligence, 5, pp. 188–224, 1989.
Nilsson, N. J.,Principles of Artificial Intelligence, Tioga Publishing Company, Palo Alto, California, 1980.
Papadimitriou, C. H. and Steiglitz, K.,Combinatorial Optimization, Prentice-Hall, Englewood Cliffs, NJ, 1982.
Purdom, P., “A Survey of Average Time Analyses of Satisfiability Algorithms,”J. of Information Processing, 13, 4, pp. 449–455, 1990.
Purdom, P. W., “Search Rearrangement Backtracking and Polynomial Average Time,”Artificial Intelligence, 21, pp. 117–133, 1983.
Robinson, J. A., “A Machine-Oriented Logic Based on the Resolution Principle,”Journal of the ACM, pp. 23–41, 1965.
Waltz, D., “Understanding Line Drawings of Scenes with Shadows,” inThe Psychology of Computer Vision (P. H. Winston), chapter 2, McGraw-Hill Book Company, New York, pp. 19–92, 1975.
Williams, H. P., “Linear and Integer Programming Applied to the Propositional Calculus,”Systems Research and Information Sciences, 2, pp. 81–100, 1987.
Author information
Authors and Affiliations
Additional information
This work was supported in part by 1987 and 1988 ACM/IEEE Academic Scholarship Awards and is presently supported in part by NSERC Strategic Grant MEF0045793 and NSERC Research Grant OGP0046423.
Xiaofei Huang’s address is unknown. This work was present in part in Technical Report UCECE-TR-91-002.
Jun Gu, Ph. D: He is a Professor of Electrical and Computer Engineering at the University of Calgary, Canada, and a Professor of Computer Science at the University of Science and Technology of China (USTC). He received B. S. degree in electrical engineering from USTC in 1982 and Ph. D degree in computer science from the University of Utah in 1989. His present research interest includes operations research and combinatorial optimization, communication systems, computer architecture and parallel processing, and structured techniques for CMOS, GaAs, and MCM system design. In 1987 he gave several discrete and continuous local search algorithms for the satisfiability problem.
Xiaofei Huang, Ph. D: He is working in Omni Vision, California, U. S. He received his Ph. D degree from Tsinghua University, Beijing, in 1990. He was a postdoctoral researcher of the University of Calgary during 1991-1993 and was a visiting researcher at the Institute of Roboties and Intelligent systems, USC, 1994. His present interests are image processing, logic reasoning, machine vision, and neural networks.
Bin Du: He received the B. S. degree in Scientific Instrumentation in 1984 and the M. S. degree in Mechanics in 1987, all from the Zhejiang University, China. He received the M.S. degree in Electrical and Computer Engineering from the University of Calgary, Canada, in 1994. Presently he is a Ph. D candidate in the Department of Electrical and Computer Engineering at the University of Calgary. His current research interest includes instrumentation, VLSI testing, image processing, and optimization techniques.
About this article
Cite this article
Gu, J., Huang, X. & Du, B. A quantitative solution to Constraint Satisfaction Problem (CSP). New Gener Comput 13, 99–115 (1994). https://doi.org/10.1007/BF03038310
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03038310