Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Possibilistic constraint satisfaction problems or “how to handle soft constraints?”
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Interchangeability preprocessing can improve forward checking search
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
On the computation of local interchangeability in discrete constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Compiling constraint satisfaction problems
Artificial Intelligence
Semiring-based constraint logic programming: syntax and semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Soft Concurrent Constraint Programming
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Exploiting interchangeabilities in constraint satisfaction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Interchangeability in Soft CSPs
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Soft interchangeability for case adaptation
ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
WCSP integration of soft neighborhood substitutability
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Computational protein design as a cost function network optimization problem
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this paper, we consider how the same concepts can be extended to soft constraint satisfaction problems (SCSPs). We introduce two notions: threshold α and degradation δ for substitutability and interchangeability, (αsubstitutability/interchangeability and δsubstitutability/interchangeability respectively). We show that they satisfy analogous theorems to the ones already known for hard constraints. In αinterchangeability, values are interchangeable in any solution that is better than a threshold α, thus allowing to disregard differences among solutions that are not sufficiently good anyway. In δinterchangeability, values are interchangeable if their exchange could not degrade the solution by more than a factor of δ. We give efficient algorithms to compute (δ/α)interchangeable sets of values for a large class of SCSPs.