Arc and path consistence revisited
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
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
Radio Link Frequency Assignment
Constraints
On forward checking for non-binary constraint satisfaction
Artificial Intelligence
Binary vs. non-binary constraints
Artificial Intelligence
Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A Dual Graph Translation of a Problem in 'Life'
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Solving Non-binary CSPs Using the Hidden Variable Encoding
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Domain filtering consistencies
Journal of Artificial Intelligence Research
Using inference to reduce arc consistency computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
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
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Optimization of Simple Tabular Reduction for Table Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Crossword Puzzles as a Constraint Problem
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Search Space Reduction for Constraint Optimization Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Inverse Consistencies for Non-binary Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Search space reduction and Russian Doll search
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Relational consistency by constraint filtering
Proceedings of the 2010 ACM Symposium on Applied Computing
Extracting microstructure in binary constraint networks
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Many-to-many interchangeable sets of values in CSPs
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Eliminating redundancy in CSPs through merging and subsumption of domain values
ACM SIGAPP Applied Computing Review
Hi-index | 0.00 |
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 non-binary problems is problematic and results in models that are very rarely competitive with the non-binary representation. To overcome this, we propose specialized arc consistency and search algorithms for binary encodings, and we evaluate them theoretically and empirically. We consider three binary representations; the hidden variable encoding, the dual encoding, and the double encoding. Theoretical and empirical results show that, for certain classes of non-binary constraints, binary encodings are a competitive option, and in many cases, a better one than the non-binary representation.