Tree clustering for constraint networks (research note)
Artificial Intelligence
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Constraint satisfaction algorithms
Computational Intelligence
A theoretical evaluation of selected backtracking algorithms
Artificial Intelligence
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
CPlan: a constraint programming approach to planning
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
Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens
IEEE Expert: Intelligent Systems and Their Applications
A theoretical comparison of selected csp solving and modeling techniques
A theoretical comparison of selected csp solving and modeling techniques
Domain filtering consistencies
Journal of Artificial Intelligence Research
Effective redundant constraints for online scheduling
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Knowledge base reuse through constraint relaxation
Proceedings of the 3rd international conference on Knowledge capture
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
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
Dual modelling of permutation and injection problems
Journal of Artificial Intelligence Research
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results
Journal of Artificial Intelligence Research
Non-binary constraints and optimal dual-graph representations
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Trading off solution quality for faster computation in DCOP search algorithms
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the power of structural decompositions of graph-based representations of constraint problems
Artificial Intelligence
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
Maintaining Arc Consistency in Non-Binary Dynamic CSPs using Simple Tabular Reduction
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Revisiting neighborhood inverse consistency on binary CSPs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Many-to-many interchangeable sets of values in CSPs
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Distributed Gibbs: a memory-bounded sampling-based DCOP algorithm
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Eliminating redundancy in CSPs through merging and subsumption of domain values
ACM SIGAPP Applied Computing Review
Hi-index | 0.00 |
There are two well known transformations from non-binary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison of these two transformations. Our comparison focuses on two backtracking algorithms that maintain a local consistency property at each node in their search tree: the forward checking and maintaining arc consistency algorithms. We first compare local consistency techniques such as arc consistency in terms of their inferential power when they are applied to the original (non-binary) formulation and to each of its binary transformations. For example, we prove that enforcing arc consistency on the original formulation is equivalent to enforcing it on the hidden transformation. We then extend these results to the two backtracking algorithms. We are able to give either a theoretical bound on how much one formulation is better than another, or examples that show such a bound does not exist. For example, we prove that the performance of the forward checking algorithm applied to the hidden transformation of a problem is within a polynomial bound of the performance of the same algorithm applied to the dual transformation of the problem. Our results can be used to help decide if applying one of these transformations to all (or part) of a constraint satisfaction model would be beneficial.