Abstract
Constraint satisfaction problems have wide application in artificial intelligence. They involve finding values for problem variables where the values must be consistent in that they satisfy restrictions on which combinations of values are allowed. Two standard techniques used in solving such problems are backtrack search and consistency inference. Conventional wisdom in the constraint satisfaction community suggests: 1) using consistency inference as preprocessing before search to prune values from consideration reduces subsequent search effort and 2) using consistency inference during search to prune values from consideration is best done at the limited level embodied in the forward checking algorithm. We present evidence contradicting both pieces of conventional wisdom, and suggesting renewed consideration of an approach which fully maintains arc consistency during backtrack search.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Tsang E.: Foundations of Constraint Satisfaction, Academic Press, London (1993).
Haralick R., Elliott G.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14 (1980) 263–313.
Dechter R., Meiri I.: Experimental evaluation of preprocessing techniques in constraint satisfaction problems. Proceedings of the Eleventh International Joint Conference on Artificial Intelligence 1 (1989) 271–277.
Prosser P.: Domain filtering can degrade intelligent backtracking search. Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (1993) 262–267.
Gaschnig J.: A constraint satisfaction method for inference making. Proceedings of the Twelfth Annual Allerton Conference on Circuit and System Theory (1974) 866–874.
Golumb S., Baumert L.: Backtrack programming. Journal of the ACM 12 (1965) 516–524.
Mackworth A.: On reading sketch maps. Proceedings of the Fifth International Joint Conference on Artificial Intelligence (1977) 598–606.
McGregor J.: Relational consistency algorithms and their applications in finding subgraph and graph isomorphism. Information Science 19 (1979) 229–250.
Nadel B.: Constraint satisfaction algorithms. Computational Intelligence 5 (1989) 188–224.
Kumar V.: Algorithms for constraint-satisfaction problems: a survey. AI Magazine 13, 1 (1992) 32–44.
Gevecker K.: Relating the utility of relaxation in costraint satisfaction algorithms to the structure of the problem. Master's thesis. Dept. of Comp. Sci., Univ. of New Hampshire (1991).
Freuder E., Wallace R.: Selective relaxation for constraint satisfaction problems. Proceedings of the Third International IEEE Computer Society Conference on Tools for Artificial Intelligence (1991) 332–339.
Cheeseman P., Kanefsky B., Taylor W.: Where the really hard problems are. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (1991) 331–337.
Williams C., Hogg T.: Using deep structure to locate hard problems. Proceedings of the Tenth National Conference on Artificial Intelligence (1992) 472–477.
Freuder E.: Synthesizing constraint expressions. Communications of the ACM 21 (1978) 958–966.
Mohr R., Henderson T.: Arc and path consistency revisited. Artificial Intelligence 25 (1986) 65–74.
Waltz D.: Understanding line drawings of scenes with shadows. The Psychology of Computer Vision, P. Winston editor, McGraw-Hill, Cambridge, MA. (1975) 19–91.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sabin, D., Freuder, E.C. (1994). Contradicting conventional wisdom in constraint satisfaction. In: Borning, A. (eds) Principles and Practice of Constraint Programming. PPCP 1994. Lecture Notes in Computer Science, vol 874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58601-6_86
Download citation
DOI: https://doi.org/10.1007/3-540-58601-6_86
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58601-2
Online ISBN: 978-3-540-49032-6
eBook Packages: Springer Book Archive