Interchangeability preprocessing can improve forward checking search
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Exploiting interchangeabilities in constraint satisfaction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Extracting constraint satisfaction subproblems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Abstraction by interchangeability in resource allocation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Abstraction and Reformulation in GraphPlan
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Dynamic Bundling: Less Effort for More Solutions
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Exploiting Interchangeabilities for Case Adaptation
ICCBR '01 Proceedings of the 4th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Exploiting the CSP Structure by Interchangeability
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Online customization with configurable standard models
ICEC '04 Proceedings of the 6th international conference on Electronic commerce
An effective customization procedure with configurable standard models
Decision Support Systems
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Domain transmutation in constraint satisfaction problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit
Journal of Artificial Intelligence Research
Applying interchangeability techniques to the distributed breakout algorithm
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
An effective customization procedure with configurable standard models
Decision Support Systems
Context-aware product bundling architecture in ubiquitous computing environments
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Interchangeability in soft CSPs
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Relaxation of qualitative constraint networks
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
An attempt to dynamically break symmetries in the social golfers problem
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Symmetry and search in a network design problem
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Compositional derivation of symmetries for constraint satisfaction
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Pruning by equally constrained variables
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Interchangeability with thresholds and degradation factors for Soft CSPs
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
In. [4], Freuder defines several types of interchangeability to capture the equivalence among the values of a variable in a discrete constraint satisfaction problem (CSP), and provides a procedure for computing one type of local interchangeability. In this paper, we first extend this procedure for computing a weak form of local interchangeability. Second, we show that the modified procedure can be used to generate a conjunctive decomposition of the CSP by localizing, in the CSP, independent subproblems. Third, for the case of constraints of mutual exclusion, we show that locally Interchangeable values can be computed in a straightforward manner, and that the only possible type of ~ocal interchangeability is the one that induces locally Independent subproblems. Finally, we give hints on how to exploit these results in practice, establish a lattice that relates some types of interchangeability, and identify directions for future research.