Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Fundamental properties of neighbourhood substitution in constraint satisfaction problems
Artificial Intelligence
Node and arc consistency in weighted CSP
Eighteenth national conference on Artificial intelligence
Reduction operations in fuzzy or valued constraint satisfaction
Fuzzy Sets and Systems - Optimisation and decision
Solving weighted CSP by maintaining arc consistency
Artificial Intelligence
Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Virtual Arc consistency for weighted CSP
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
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
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Abstraction by interchangeability in resource allocation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Soft arc consistency revisited
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
Eliminating interchangeable values in constraint satisfaction problems
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
WCSP is an optimization problem for which many forms of soft local (arc) consistencies have been proposed such as, for example, existential directional arc consistency (EDAC) and virtual arc consistency (VAC). In this paper, we adopt a different perspective by revisiting the well-known property of (soft) substitutability. First, we provide a clear picture of the relationships existing between soft neighborhood substitutability (SNS) and a tractable property called pcost which allows us to compare the cost of two values (through the use of so-called cost pairs). We prove that under certain assumptions, pcost is equivalent to SNS but weaker than SNS in the general case since we show that SNS is coNP-hard. We also show that SNS preserves the property VAC but not the property EDAC. Finally, we introduce an algorithm to enforce pcost that benefits from several optimizations (early breaks, residues, timestamping). The practical interest of maintaining pcost together with AC*, FDAC or EDAC, during search. is shown on various series of WCSP instances.