Binary vs. non-binary constraints
Artificial Intelligence
A Refutation Approach to Neighborhood Interchangeability in CSPs
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Domain transmutation in constraint satisfaction problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results
Journal of Artificial Intelligence Research
A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit
Journal of Artificial Intelligence Research
Exploiting interchangeabilities in constraint satisfaction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A compression algorithm for large arity extensional constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Eliminating interchangeable values in constraint satisfaction problems
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
Onto-substitutability has been shown to be intrinsic to how a domain value is considered redundant. A value is onto-substitutable if any solution involving that value remains a solution when that value is replaced by some other value. We redefine onto-substitutability to accommodate binary relationships and study its implication. Joint interchangeability, an extension of onto-substitutability to its interchangeability counterpart, emerges as one of the results. We propose a new way of removing interchangeable values by constructing a new value as an intermediate step, as well as introduce virtual interchangeability, a local reasoning that leads to joint interchangeability and allows values to be merged together.