Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs

Authors:
Anagh Lal;Berthe Y. Choueiry;Eugene C. Freuder
Affiliations:
Constraint Systems Laboratory, University of Nebraska-Lincoln;Constraint Systems Laboratory, University of Nebraska-Lincoln;Cork Constraint Computation Center, University College Cork
Venue:
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Year:
2005

Citing 8
Cited 7

Interchangeability preprocessing can improve forward checking search

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Supermodels and robustness

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On forward checking for non-binary constraint satisfaction

Artificial Intelligence
Dynamic Bundling: Less Effort for More Solutions

Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search

AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
A genetic algorithm approach to automated custom document assembly

Second international workshop on Intelligent systems design and application
Applying interchangeability techniques to the distributed breakout algorithm

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Interchangeability supports abstraction and reformulation for multi-dimensional constraint satisfaction

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Directional Interchangeability for Enhancing CSP Solving

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A domain decomposition algorithm for constraint satisfaction

Journal of Experimental Algorithmics (JEA)
A Refutation Approach to Neighborhood Interchangeability in CSPs

AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit

Journal of Artificial Intelligence Research
WCSP integration of soft neighborhood substitutability

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
Eliminating redundancy in CSPs through merging and subsumption of domain values

ACM SIGAPP Applied Computing Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Neighborhood Interchangeability (NI) identifies the equivalent values in the domain of a variable of a Constraint Satisfaction Problem (CSP) by considering only the constraints that directly apply to the variable. Freuder described an algorithm for efficiently computing NI values in binary CSPs. In this paper, we show that the generalization of this algorithm to non-binary CSPs is not straightforward, and introduce an efficient algorithm for computing. NI values in the presence of non-binary constraints. Further, we show how to interleave this mechanism with search for solving CSPs, thus yielding a dynamic bundling strategy. While the goal of dynamic bundling is to produce multiple robust solutions, we empirically show that it does not increase (but significantly decreases) the cost of search.