A CSP search algorithm with responsibility sets and Kernels

Constraints

Volumn 12, Issue 2, 2007, Pages 151-177

  Razgon, Igor ^a   Meisels, Amnon ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

CSP search algorithm; FC RKP; Kernel; MAC RKP

Indexed keywords

COMPUTER SIMULATION; CONSTRAINT THEORY; PROBLEM SOLVING; RANDOM PROCESSES; TREES (MATHEMATICS);

CSP SEARCH ALGORITHM; FC-RKP; KERNEL; MAC-RKP;

ALGORITHMS;

EID: 34248594667     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-007-9016-x     Document Type: Article

References (20)

1. Bacchus, F. (2000). Extending forward checking. In Principles and practice of constraint programming (pp. 35-51).
2. Choueiry, B., & Noubir, G. (.1998). On the computation of local interchangeability in discrete constraint satisfaction problems. In Proceedings of AAAI (pp. 326-333). Menlo Park, CA: AAAI.
3. Fahle, T., Schamberger, S., & Sellmann, M. (2001). Symmetry breaking. In CP2001 (pp. 93-108). Berlin: Springer.
4. Focacci, F., & Milano, M. (2001). Global cut framework for removing symmetries. In CP200L (pp. 93-108). Berlin: Springer.
5. Frost, D., & Dechter, R. (1995). Look-ahead value ordering for constraint satisfaction problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAl'95 (pp. 572-578). Montreal, Canada.
6. Gent, I., MacIntyre, E., Prosser, P., Smith, B., & Walsh, T. (1996). An empirical study of dynamic variable ordering heuristics. In CP-96 (pp. 179-193).
7. Ginsberg, M. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25-46.
8. Haralick, R. M., & Elliott, G. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14, 263-313.
9. Jussien, N., Debruyne, R., & Boizumault, P. (2000). Maintaining arc-consistency within dynamic backtracking. In Principles and practice of constraint programming (CP 2000) (pp. 249-261). Singapore, Springer
10. Kautz, H., & Selman, B. (2003). Ten challenges redux: Recent progress in propositional reasoning and search. In CP2003 (pp. 1-18). Berlin: Springer.
11. Prosser, P. (1993) Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9, 268-299.
12. Prosser, P. (1995). MAC-CBJ: Maintaining Arc Consistency with Conflict-directed Backjumping. Technical Report, Research Report/95/177, Department of Computer Science, University of Strathclyde.
13. Prosser, P. (1996). An empirical study of phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 81-109.
14. Puget, J. (2005). Symmetry breaking revisited. Constraints, 10(1), 23-46.
15. Quimper, C.-G., Lopez-Ortiz, A., vanBeek, P., & Golynski, A. (2004). Improved algorithms for the global cardinality constraint. In Principles and practice of constraint programming-CP2004, Toronto, Canada (pp. 542-556). Berlin: Springer.
16. Razgon, I., & Meisels, A. (2003). Maintaining dominance consistency. In Principles and practice of constraint programming-CP2003, Kinsale, Ireland (pp. 945-950). Berlin: Springer.
17. Razgon, I., & Meiseis, A. (2004). Pruning by equally constrained variables. In Proceedings of CSCLP2004 (pp. 26-40).
18. Regin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In AAAI '94: Proceedings of the twelfth national conference on artificial intelligence (Vol. 1, pp. 362-367). Menlo Park, CA: American Association for Artificial Intelligence.
19. Sabin, D., & Freuder, E. C. (1994). Contradicting conventional wisdom in constraint satisfaction. In PPCP'94 (pp. 10-20).
20. Wallace, R. (2005). Analysis of heuristic synergies. In CSCLP 2005 (pp. 1-13).