Tree clustering for constraint networks (research note)
Artificial Intelligence
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Constraint satisfaction algorithms
Computational Intelligence
Synthesizing constraint expressions
Communications of the ACM
Journal of Artificial Intelligence Research
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Sparse constraint graphs and exceptionally hard problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
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
Bayes networks for estimating the number of solutions of constraint networks
Annals of Mathematics and Artificial Intelligence
Phase Transitions in Relational Learning
Machine Learning
On forward checking for non-binary constraint satisfaction
Artificial Intelligence
Binary vs. non-binary constraints
Artificial Intelligence
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Reformulation of Non-binary Constraints
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
A Constraint Directed Model for Partial Constraint Satisfaction Problems
AI '00 Proceedings of the 13th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Arc Consistency on n-ary Monotonic and Linear Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Constraint Modeling in the Context of Academic Task Assignment
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Dual Graph Translation of a Problem in 'Life'
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Reformulating Propositional Satisfiability as Constraint Satisfaction
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Solving Non-binary CSPs Using the Hidden Variable Encoding
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Disjunction of Non-binary and Numeric Constraint Satisfaction Problems
CCIA '02 Proceedings of the 5th Catalonian Conference on AI: Topics in Artificial Intelligence
Distributed breakout revisited
Eighteenth national conference on Artificial intelligence
A hybrid AI approach for nurse rostering problem
Proceedings of the 2003 ACM symposium on Applied computing
A pre-processing algorithm for solving constraint satisfaction optimisation problems
SAICSIT '03 Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
A framework for resolution of time in natural language
ACM Transactions on Asian Language Information Processing (TALIP) - Special Issue on Temporal Information Processing
The Localization and Correction of Errors in Models: A Constraint-Based Approach
Applied Intelligence
Constraint Models for the Covering Test Problem
Constraints
Framework for Modeling Reordering Heuristics for Asynchronous Backtracking
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Evolving combinatorial problem instances that are difficult to solve
Evolutionary Computation
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Feasible distributed CSP models for scheduling problems
Engineering Applications of Artificial Intelligence
Detecting Patterns of Poor Design Solutions Using Constraint Propagation
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results
Journal of Artificial Intelligence Research
The difference all-difference makes
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Dual encoding using constraint coverings
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Distributed CSPs: why it is assumed a variable per agent?
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Solution directed backjumping for QCSP
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The Knowledge Engineering Review
Diagnosis of coordination failures: a matrix-based approach
Autonomous Agents and Multi-Agent Systems
Adaptive and non-adaptive distribution functions for DSA
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Managing dynamic CSPs with preferences
Applied Intelligence
Understanding design patterns — what is the problem?
Software—Practice & Experience
Improving Asynchronous Partial Overlay
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
| Hi-index | 0.00 |
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph translation and the hidden variable translation. However, there has been little theoretical or experimental work on how well backtracking algorithms perfonn on these binary representations in comparison to their perfonnance on the corresponding non-binary CSP. We present both theoretical and empirical results to help understand the tradeoffs involved. In particular, we show that translating a non-binary CSP into a binary representation can be a viable solution technique in certain circumstances. The ultimate aim of this research is to give guidance for when one should consider translating between non-binary and binary representations. Our results supply some initial answers to this question.