Artificial Intelligence, vol. 41, No. 3, Jan. 1990, Amsterdam NL, pp. 273-312, "Enhancement Schemes for Constraint Processing: Backjumping . . . ", Rina Dechter. |
Journal of the ACM, vol. 12, No. 4, Oct. 1965, New York, US, pp. 516-524, "Backtrack Programming", Solomon Golomb, et al. |
"Parallel Lookahead Technique for Constraint Satisfaction", IBM Technical Discl. Bulletin, vol. 31, No. 10, Mar. 1989. |
"Estimating the Size of a Backtrack Search During the Search Operation", IBM Technical Disclosure Bulletin, vol. 30, No. 8, Jan. 1988. |
"Efficient Search Technique" IBM Tech. Discl. Bulletin, vol. 30, No. 1, Jun. 1987. |
A. K. Mackworth, "Consistency in Networks of Relations", Artificial Intelligence, vol. 8, pp. 99-118, 1977. |
R. M. Haralick and L. G. Shapiro, "The Consistent Labeling Problem: Part I", IEEE Trans. on Pattern Analysis & Maching Intelligence, vol. PAMI-1 No. 2, Apr. 1979, pp. 173-184. |
R. M. Haralick & L. G. Shapiro, "The Consistent Labeling Problem: Part II", IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 2, May 1980, pp. 193-203. |
B. A. Nudel, "Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory Based Heuristics", Artificial Intelligence (Special Issue on Search & Heuristics), vol. 21, pp. 135-178, 1983. |
E. C. Freuder, "A Sufficient Condition for Backtrack-Free Search", Journal of the ACM, vol. 29, No. 1, 1982, pp. 24-32. |
J. R. Bitner and E. M. Reinhold, "Backtrack Programming Techniques", Comm. of the ACM, vol. 18, pp. 651-656, 1975. |
R. M. Haralick & G. L. Elliott, "Increasing Tree Search Efficiency for Constraint Satisfaction Problems", Artificial Intelligence, pp. 263-313, 1980. |
S. Golomb & L. Baumert, "Backtrack Programming", Jrnl. of the ACM, vol. 12, 1965, pp. 516-524. |
D. E. Knuth, "Estimating the Efficiency of Backtrack Programs", Mathematics of Computation, vol. 29, 1975, pp. 121-136. |