Binary encodings of non-binary constraint satisfaction problems: Algorithms and experimental results

Journal of Artificial Intelligence Research

Volumn 24, Issue , 2005, Pages 641-684

  Samaras, Nikolaos ^a   Stergiou, Kostas ^b  

^a UNIVERSITY OF MACEDONIA   (Greece)

^b UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPETITION; CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

CONSTRAINT SATISFACTION PROBLEM (CSP); NON-BINARY REPRESENTATION; SEARCH ALGORITHMS; VARIABLE ENCODINGS;

ENCODING (SYMBOLS);

EID: 31144435836     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1776     Document Type: Article

References (33)

1. Bacchus, F., Chen, X., van Beek, P., & Walsh, T. (2002). Binary vs. Non-binary CSPs. Artificial Intelligence, 140, 1-37.
2. Bacchus, F., & van Beek, P. (1998). On the Conversion between Non-binary and Binary Constraint Satisfaction Problems. In Proceedings of AAAI'98, pp. 310-318.
3. Bater, J. (2000). Non-binary (Higher-Order) Modelling and Solution Techniques for Frequency Assignment in Mobile Communications Networks. Ph.D. thesis, University of London.
4. Beacham, A., Chen, X., Sillito, J., & van Beek, P. (2001). Constraint programming lessons learned from crossword puzzles. In Proceedings of the 14th Canadian Conference in AI.
5. Bessière, C., Freuder, E., & Régin, J. (1995). Using Inference to Reduce Arc Consistency Computation. In Proceedings of IJCAI'95, pp. 592-599.
6. Bessìre, C., Meseguer, P., Freuder, E., & Larrosa, J. (2002). On Forward Checking for Non-binary Constraint Satisfaction. Artificial Intelligence, 141, 205-224.
7. Bessìre, C., & Régin, J. (1996a). Arc Consistency for General Constraint Networks: Preliminary Results. In Proceedings of IJCAI'97, pp. 398-404.
8. Bessìre, C., &: Régin, J. (1996b). MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems. In Proceedings of CP'96, pp. 61-75.
9. Bessière, C., & Régin, J. (2001). Refining the Basic Constraint Propagation Algorithm. In Proceedings of IJCAI'2001, pp. 309-315.
10. Cabon, B., De Givry, S., Lobjois, L., Schiex, T., & Warners, J. (1999). Radio Link Frequency Assignment. Constraints, 4, 79-89.
11. CLib (2005). Configuration Benchmarks Library (http://www.itu.dk/doi/VeCoS/clib/), Maintained by VeCoS group, IT-University of Copenhagen.
12. Debruyne, R., & Bessière, C. (2001). Domain Filtering Consistencies. Journal of Artificial Intelligence Research, 14, 205-230.
13. Dechter, R., & Pearl, J. (1989). Tree Clustering for Constraint Networks. Artificial Intelligence, 38, 353-366.
14. Ginsberg, M., Frank, M., Halpin, M., & Torrance, M. (1990). Search Lessons Learned from Crossword Puzzles. In Proceedings of AAAI-90, pp. 210-215.
15. Haralick, R., & Elliot, G. (1980). Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence, 14, 263-313.
16. Hodge, L., Hurley, S., & Smith, D. (2002). Higher-Order Constraint Techniques for the Frequency Assignment Problem. Tech. rep., University of Cardiff.
17. Jeavons, P., Dunkin, N., & Bater, J. (1998). Why Higher Order Constraints are Necessary to Model Frequency Assignment Problems. In ECAI'98 Workshop on Non-binary constraints.
18. Mackworth, A. (1977). Consistency in Networks of Relations. Artificial Intelligence, 99-118.
19. Mamoulis, N., & Stergiou, K. (2001). Solving Non-Binary CSPs using the Hidden Variable Encoding. In Proceedings of CP-2001, pp. 168-182.
20. Mohr, R., &: Henderson, T. (1986). Arc and Path Consistency Revisited. Artificial Intelligence, 28, 225-233.
21. Mohr, R., & Masini, G. (1988). Good Old Discrete Relaxation. In Proceedings of ECAI-88, pp. 651-656.
22. Peirce, C. (1933) Collected Papers Vol. III. Cited in F. Rossi, C. Petrie, and V. Dhar 1989.
23. Prosser, P., Stergiou, K., & Walsh, T. (2000). Singleton Consistencies. In Proceedings of CP-2000, pp. 353-368.
24. Régin, J. (1994). A Filtering Algorithm for Constraints of Difference in CSPs. In Proceedings of AAAI-94, pp. 362-367.
25. Rossi, F., Petrie, C., & Dhar, V. (1990). On the Equivalence of Constraint Satisfaction Problems. In Proceedings of ECAI-90, pp. 550-556.
26. Smith, B. (2002). A Dual Graph Translation of a Problem in 'Life'. In Proceedings of CP-02, pp. 402-414.
27. Smith, B., Stergiou, K., & Walsh, T. (2000). Using Auxiliary Variables and Implied Constraints to Model Non-binary Problems. In Proceedings of AAAI'2000, pp. 182-187.
28. Stergiou, K., &: Walsh, T. (1999). Encodings of Non-Binary Constraint Satisfaction Problems. In Proceedings of AAAI'99, pp. 163-168.
29. Subbarayan, S., Jensen, R., Hadzic, T., Andersen, H., Hulgaard, H., & Moller, J. (2004). Comparing two Implementations of a Complete and Backtrack-Free Interactive Configurator. In Proceedings of the CP-04 Workshop on CSP Techniques with Immediate Application, pp. 97-111.
30. Van Hentenryck, P. (Ed.). (1989). Constraint Satisfaction in Logic Programming. MIT Press.
31. Van Hentenryck, P., Deville, Y., & Teng, C. (1992). A Generic Arc Consistency Algorithm and its Specializations. Artificial Intelligence, 57, 291-321.
32. Watkins, W., Hurley, S., &: Smith, D. (1998). Area Coverage Frequency Assignment: Evaluation of Models for Area, Coverage. Tech. rep., University of Glamorgan. Also presented in INFORMS-98.
33. Zhang, Y., & Yap, R. (2001). Making AC-3 an Optimal Algorithm. In Proceedings of IJCAI'2001, pp. 316-321.