Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Compiling constraint satisfaction problems
Artificial Intelligence
Semiring-based constraint logic programming: syntax and semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint Solving and Programming: What Next?
Constraints
Exploiting Interchangeabilities for Case Adaptation
ICCBR '01 Proceedings of the 4th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
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
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
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Studying Interchangeability in Constraint Satisfaction Problems
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Semiring-Based Soft Constraints
Concurrency, Graphs and Models
Soft interchangeability for case adaptation
ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
Interchangeability with thresholds and degradation factors for Soft CSPs
Annals of Mathematics and Artificial Intelligence
| 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 the notions of threshold 驴 and degradation 驴 for substitutability and interchangeability. 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 驴.Theorems, algorithms to compute (驴/驴)interchangeable sets of values, and a more general treatment of all the ideas presented in this paper can be found in [2].