Super-Reparametrizations of Weighted CSPs: Properties and Optimization Perspective
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00366166" target="_blank" >RIV/68407700:21230/23:00366166 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s10601-023-09343-6" target="_blank" >https://doi.org/10.1007/s10601-023-09343-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10601-023-09343-6" target="_blank" >10.1007/s10601-023-09343-6</a>
Alternative languages
Result language
angličtina
Original language name
Super-Reparametrizations of Weighted CSPs: Properties and Optimization Perspective
Original language description
The notion of reparametrizations of Weighted CSPs (WCSPs) (also known as equivalence-preserving transformations of WCSPs) is well-known and finds its use in many algorithms to approximate or bound the optimal WCSP value. In contrast, the concept of super-reparametrizations (which are changes of the weights that keep or increase the WCSP objective for every assignment) was already proposed but never studied in detail. To fill this gap, we present a number of theoretical properties of super-reparametrizations and compare them to those of reparametrizations. Furthermore, we propose a framework for computing upper bounds on the optimal value of the (maximization version of) WCSP using super-reparametrizations. We show that it is in principle possible to employ arbitrary (under some technical conditions) constraint propagation rules to improve the bound. For arc consistency in particular, the method reduces to the known Virtual AC (VAC) algorithm. We implemented the method for singleton arc consistency (SAC) and compared it to other strong local consistencies in WCSPs on a public benchmark. The results show that the bounds obtained from SAC are superior for many instance groups.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
CONSTRAINTS
ISSN
1383-7133
e-ISSN
1572-9354
Volume of the periodical
28
Issue of the periodical within the volume
June
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
43
Pages from-to
277-319
UT code for WoS article
000988361500001
EID of the result in the Scopus database
2-s2.0-85159397356