Domain Reduction for Valued Constraints by Generalising Methods from CSP. / Cohen, David; Cooper, Martin; Jguirim1, Wafa.

2018. 64-80 Paper presented at CP 2018: the 24th International Conference on Principles and Practice of Constraint Programming, Lille, France.

Research output: Contribution to conferencePaper

E-pub ahead of print

Abstract

For classical CSPs, the absence of broken triangles on a pair of values allows the merging of these values without changing the satisfiability of the instance, giving experimentally verified reduction in search time. We generalise the notion of broken triangles to VCSPs to obtain a tractable value-merging rule which preserves the cost of a solution. We then strengthen this value merging rule by using soft arc consistency to remove soft broken triangles and we show that the combined rule generalises known notions of domain value substitutability and interchangeability. Unfortunately the combined rules are no longer tractable to apply, but can still have applications as heuristics for reducing the search space.
Finally we consider the generalisation of another value-elimination rule for CSPs to binary VCSPs. This new rule properly generalises neighbourhood substitutability and so we expect it will also have practical applications.
Original languageEnglish
Pages64-80
Number of pages17
DOIs
Publication statusE-pub ahead of print - 23 Aug 2018
EventCP 2018: the 24th International Conference on Principles and Practice of Constraint Programming - Lille, France
Duration: 27 Aug 201831 Aug 2018
http://cp2018.a4cp.org/

Conference

ConferenceCP 2018: the 24th International Conference on Principles and Practice of Constraint Programming
Abbreviated titleCP 2018
CountryFrance
CityLille
Period27/08/1831/08/18
Internet address
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 30969900