Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The essence of constraint propagation
Theoretical Computer Science
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Range-Based Algorithm for Max-CSP
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Node and arc consistency in weighted CSP
Eighteenth national conference on Artificial intelligence
Meta-constraints on violations for over constrained problems
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Arc consistency for soft constraints
Artificial Intelligence
Solving weighted CSP by maintaining arc consistency
Artificial Intelligence
On global warming: Flow-based soft global constraints
Journal of Heuristics
A unified framework for partial and hybrid search methods in constraint programming
Computers and Operations Research
Virtual Arc consistency for weighted CSP
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
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
Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Finite domain bounds consistency revisited
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Soft arc consistency revisited
Artificial Intelligence
Expert Systems with Applications: An International Journal
DR.FILL: crosswords and an implemented solver for singly weighted CSPs
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
The Weighted Constraint Satisfaction Problem (WCSP) framework allows representing and solving problems involving both hard constraints and cost functions. It has been applied to various problems, including resource allocation, bioinformatics, scheduling, etc. To solve such problems, solvers usually rely on branch-and-bound algorithms equipped with local consistency filtering, mostly soft arc consistency. However, these techniques are not well suited to solve problems with very large domains. Motivated by the resolution of an RNA gene localization problem inside large genomic sequences, and in the spirit of bounds consistency for large domains in crisp CSPs, we introduce soft bounds arc consistency, a new weighted local consistency specifically designed for WCSP with very large domains. Compared to soft arc consistency, BAC provides significantly improved time and space asymptotic complexity. In this paper, we show how the semantics of cost functions can be exploited to further improve the time complexity of BAC. We also compare both in theory and in practice the efficiency of BAC on a WCSP with bounds consistency enforced on a crisp CSP using cost variables. On two different real problems modeled as WCSP, including our RNA gene localization problem, we observe that maintaining bounds arc consistency outperforms arc consistency and also improves over bounds consistency enforced on a constraint model with cost variables.