A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results
2005
The Journal of Artificial Intelligence Research
A non-binary Constraint Satisfaction Problem (CSP) can be solved directly using extended versions of binary techniques. Alternatively, the non-binary problem can be translated into an equivalent binary one. In this case, it is generally accepted that the translated problem can be solved by applying well-established techniques for binary CSPs. In this paper we evaluate the applicability of the latter approach. We demonstrate that the use of standard techniques for binary CSPs in the encodings of
doi:10.1613/jair.1776
fatcat:evl2bad6gbhyzpqvobj6mi7ftm