Dynamic variable ordering in graph based backjumping algorithms for csps

References

• Gaschnig , J. 1977 . “ Performance measurement and analysis of certain search algorithms ” . In Ph.D. Thesis CS department , Pittsburgh, PA : Carnegie-Mellon University .
   Google Scholar
• Dechter , R. 1990 . Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition . Artificial Intelligence , 41 : 273 – 312 .
   Google Scholar
• Dechter , R. and Pearl , J. 1987 . Network-based heuristics for constraint-satisfaction problems . Artificial Intelligence , 34 : 1 – 38 .
   Google Scholar
• Dechter , R. and Pearl , J. 1989 . Tree clustering for constraint networks . Artificial Intelligence , 38 : 353 – 366 .
   Web of Science ®Google Scholar
• Kumar , V. 1992 . Algorithms for constraint satisfaction problems: a survey . AI Magazine , 13 : 32 – 44 .
   Web of Science ®Google Scholar
• Haralick , R.M. and Elliott , G.L. 1980 . Increasing tree search efficiency for constraint satisfaction problems . Artificial Intelligence , 14 : 263 – 313 .
   Web of Science ®Google Scholar
• Haralick , R.M. , Davis , L.S. , Rosenfeld , A. and Milgram , D.L. 1978 . Reduction operations for constraint satisfaction . Information Sci , 14 : 199 – 219 .
   Google Scholar
• Waltz , D. 1975 . “ Understanding of drawing with scenes with shadows ” . In Psychology of Computer Vision Edited by: Winston , P.H. 19 – 91 .
   Google Scholar
• Zabih , R. . A rearrangement search strategy for determining propositional satisfiability . Proceedings of the 7th National Conference on AI (AAAI) . pp. 155 – 160 .
   Google Scholar
• Rosenfeld , A. , Hummel , R. and Zucker , S. 1976 . Scene labeling by relaxation operations . IEEE Trans Systems, Man and Cybernetics , SMC-6 : 420 – 433 .
   Web of Science ®Google Scholar
• Purdom , P. 1983 . Search rearrangement backtracking and Polynomial average time . Artificial Intelligence , 21 : 117 – 133 .
   Google Scholar
• Harry , F. 1969 . Graph Theory , Reading, MA : Addison-Wesley .
   Google Scholar
• Mackworth , A.K. and Freuder , E.C. 1985 . The complexity of some polynomial network consistency algorithms for constraint satisfaction problems . Artificial Intelligence , 25 : 65 – 74 .
   Web of Science ®Google Scholar
• Montanary , U. 1974 . Networks of constraints: Fundamental properties and applications to picture processing . Information Sci , 7 : 95 – 132 .
   Google Scholar
• Zahib , R. and Mcauester , D. . A rearrangement search strategy for determining pro-positional satisfiability . Proceedings AAAI-88 . MN. St.Paul .
   Google Scholar
• Freuder , E.C. 1982 . A sufficient condition for backtrack-free search . J. ACM , 29 ( 1 ) : 24 – 32 .
   Web of Science ®Google Scholar
• Bitner , J.R. and Reingold , E. 1975 . Backtrack programming techniques . Comm. ACM , 18 ( 1 ) : 651 – 656 .
   Google Scholar
• Prosser , P. 1993 . Hybrid algorithms for the constraint satisfaction problem . Computational Intelligence , 9 ( 1 ) : 268 – 299 .
   Google Scholar
• Beek , P.V. 1994 . CSP C Function Library , University of Alberta . faculty of Computer Science
   Google Scholar
• Slagle , J.R. 1971 . Artificial Intelligence: The Heuristic Programming Approach , McGraw-Hill .
   Google Scholar
• Knuth , D. 1975 . Estimating the efficiency of backtrack programs . Math. Comp , 29 : 121 – 136 .
   Web of Science ®Google Scholar
• Run , P.V. 1994 . “ Domain independent heuristics in hybrid algorithms for CSPs ” . In M.Sc.Dissertation , Canada : University of Waterloo .
   Google Scholar