On the conversion between non-binary constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Encodings of non-binary constraint satisfaction problems
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Constraint Programming Lessons Learned from Crossword Puzzles
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
On Forward Checking for Non-binary Constraint Satisfaction
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A theoretical comparison of selected csp solving and modeling techniques
A theoretical comparison of selected csp solving and modeling techniques
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Making AC-3 an optimal algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
Comparing the notions of optimality in CP-nets, strategic games and soft constraints
Annals of Mathematics and Artificial Intelligence
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
Recent Advances in Constraints
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results
Journal of Artificial Intelligence Research
Artificial Intelligence - Special issue: Distributed constraint satisfaction
| Hi-index | 0.00 |
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-established binary CSP techniques or use extended versions of binary techniques directly on the non-binary problem. Recently, it has been shown that the hidden variable encoding is a promising method of translating non-binary CSPs into binary ones. In this paper we make a theoretical and empirical investigation of arc consistency and search algorithms for the hidden variable encoding. We analyze the potential benefits of applying arc consistency on the hidden encoding compared to generalized arc consistency on the non-binary representation. We also show that search algorithms for non-binary constraints can be emulated by corresponding binary algorithms that operate on the hidden variable encoding and only instantiate original variables. Empirical results on various implementations of such algorithms reveal that the hidden variable is competitive and in many cases better than the non-binary representation for certain classes of non-binary constraints.