Using Symmetry of Global Constraints to Speed up the Resolution of Constraint Satisfaction Problems
暂无分享,去创建一个
[1] Jean-Charles Régin,et al. Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.
[2] Nicolas Beldiceanu,et al. Introducing global constraints in CHIP , 1994 .
[3] Christian Bessiere,et al. Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.
[4] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[5] Javier Larrosa. Merging Constraint Satisfaction Subproblems to Avoid Redundant Search , 1997, IJCAI.
[6] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..
[7] James M. Crawford,et al. Symmetry-Breaking Predicates for Search Problems , 1996, KR.
[8] Patrick Prosser,et al. HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..
[9] Jean-Charles Régin,et al. A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.
[10] Eugene C. Freuder,et al. Extracting Constraint Satisfaction Subproblems , 1995, IJCAI.
[11] François Pachet,et al. Reifying Constraint Satisfaction in Smalltalk , 1997, J. Object Oriented Program..
[12] Pascal Van Hentenryck,et al. An Efficient Arc Consistency Algorithm for a Class of CSP Problems , 1991, IJCAI.
[13] Daniel P. Miranker,et al. An Optimal Backtrack Algorithm for Tree-Structured Constraint Satisfaction problems , 1994, Artif. Intell..
[14] Jean-Louis Laurière,et al. A Language and a Program for Stating and Solving Combinatorial Problems , 1978, Artif. Intell..