Arc and path consistence revisited
Artificial Intelligence
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Radio Link Frequency Assignment
Constraints
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Discrete Applied Mathematics
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
Arc consistency for soft constraints
Artificial Intelligence
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Structural Tractability of Propagated Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A domain decomposition algorithm for constraint satisfaction
Journal of Experimental Algorithmics (JEA)
Exploiting tree decomposition and soft local consistency in weighted CSP
AAAI'06 Proceedings of the 21st 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
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
In the quest of the best form of local consistency for weighted CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Temporal constraint reasoning with preferences
IJCAI'01 Proceedings of the 17th 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
Soft arc consistency revisited
Artificial Intelligence
Structural tractability of constraint optimization
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The effect of constraint representation on structural tractability
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
This paper addresses combinatorial problems that can be expressed as Valued Constraint Satisfaction Problems (VCSPs). In the VCSP framework, the constraints are defined by valuation functions to reflect several constraint violation levels. Despite the NP-hardness of VCSPs, tractable versions can be obtained by forcing the allowable valuation functions to have specific mathematical properties. This is the case of VCSPs with submodular valuation functions only. In this paper, we propose a problem decomposition scheme for binary VCSPs that takes advantage of modular valuation functions even when the studied problem is not limited to these functions. Modular functions are less frequent than submodular ones but, in compensation, they are easier to process. The proposed scheme works within a backtrack-based search and consists in decomposing the original problem into a set of modular, and then tractable, subproblems. Our decomposition scheme is distinguished by the possibility of instantiating variables by assigning to them subsets of values instead of single values.