A logic language for combinatorial optimization
Annals of Operations Research
New Programming Languages for Artificial Intelligence Research
ACM Computing Surveys (CSUR)
Synthesizing constraint expressions
Communications of the ACM
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Reduction operations in fuzzy or valued constraint satisfaction
Fuzzy Sets and Systems - Optimisation and decision
Exploiting functional dependencies in declarative problem specifications
Artificial Intelligence
Task-dependent qualitative domain abstraction
Artificial Intelligence - Special volume on reformulation
Reasoning by dominance in not-equals binary constraint networks
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Integrating CSP decomposition techniques and BDDs for compiling configuration problems
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
Dynamic SAT with decision change costs: formalization and solutions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
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
Interchangeability with thresholds and degradation factors for Soft CSPs
Annals of Mathematics and Artificial Intelligence
Maintaining alternative values in constraint-based configuration
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Constraint satisfaction problems (CSPs) involve finding values for variables subject to constraints on which combinations of values are permitted. This paper develops a concept of interchangeability of CSP values. Fully Interchangeable values can be substituted for one another in solutions to the problem. Removing all but one of a set of fully interchangeable values can simplify the search space for the problem without effectively losing solutions. Refinements of the interchangeability concept extend its applicability. Basic properties of interchangeablity and complexity parameters are established. A hierarchy of local interchangeability is defined that permits recognition of some interchangeable values with polynomial time local computation. Computing local interchangeability at any level in this hierarchy to remove values before backtrack search is guaranteed to be cost effective for some CSPs. Several forms of weak interchangeability are defined that permit eliminating values without losing all solutions. Interchangeability can be introduced by grouping values or variables, and can be recalculated dynamically during search. The idea of interchangeability can be abstracted to encompass any means of recovering the solutions involving one value from the solutions involving another.