License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2020.85
URN: urn:nbn:de:0030-drops-127566
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12756/
Go to the corresponding LIPIcs Volume Portal


Viola, Caterina ; Živný, Stanislav

The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains

pdf-format:
LIPIcs-MFCS-2020-85.pdf (0.5 MB)


Abstract

Convex relaxations have been instrumental in solvability of constraint satisfaction problems (CSPs), as well as in the three different generalisations of CSPs: valued CSPs, infinite-domain CSPs, and most recently promise CSPs. In this work, we extend an existing tractability result to the three generalisations of CSPs combined: We give a sufficient condition for the combined basic linear programming and affine integer programming relaxation for exact solvability of promise valued CSPs over infinite-domains. This extends a result of Brakensiek and Guruswami [SODA'20] for promise (non-valued) CSPs (on finite domains).

BibTeX - Entry

@InProceedings{viola_et_al:LIPIcs:2020:12756,
  author =	{Caterina Viola and Stanislav Živn{\'y}},
  title =	{{The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains}},
  booktitle =	{45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
  pages =	{85:1--85:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-159-7},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{170},
  editor =	{Javier Esparza and Daniel Kr{\'a}ľ},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12756},
  URN =		{urn:nbn:de:0030-drops-127566},
  doi =		{10.4230/LIPIcs.MFCS.2020.85},
  annote =	{Keywords: promise constraint satisfaction, valued constraint satisfaction, convex relaxations, polymorphisms}
}

Keywords: promise constraint satisfaction, valued constraint satisfaction, convex relaxations, polymorphisms
Collection: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Issue Date: 2020
Date of publication: 18.08.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI