Abstract
The weighted constraint satisfaction problem (WCSP) framework is a soft constraint framework which can model many real life optimization or over-constrained problems.While there are many local consistency notions available to speed up WCSP solving, in this paper, we investigate how to effectively combine and channel mutually redundant WCSP models to increase constraint propagation. This successful technique for reducing search space in classical constraint satisfaction has been shown non-trivial when adapted for the WCSP framework. We propose a parameterized local consistency LB(m, φ), which can be instantiated with any local consistency φ for single models and applied to a combined model with m sub-models, and also provide a simple algorithm to enforce it. We instantiate LB(2, φ) with different state-of-the-art local consistencies AC*, FDAC*, and EDAC*, and demonstrate empirically the efficiency of the algorithm using different benchmark problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
