License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2015.60
URN: urn:nbn:de:0030-drops-54078
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5407/
Go to the corresponding LIPIcs Volume Portal


Dawar, Anuj ; Wang, Pengming

A Definability Dichotomy for Finite Valued CSPs

pdf-format:
4.pdf (0.5 MB)


Abstract

Finite valued constraint satisfaction problems are a formalism for describing many natural optimisation problems, where constraints on the values that variables can take come with rational weights and the aim is to find an assignment of minimal cost. Thapper and Zivny have recently established a complexity dichotomy for valued constraint languages. They show that each such languages either gives rise to a polynomial-time solvable optimisation problem, or to an NP-hard one, and establish a criterion to distinguish the two cases. We refine the dichotomy by showing that all optimisation problems in the first class are definable in fixed-point language with counting, while all languages in the second class are not definable, even in infinitary logic with counting. Our definability dichotomy is not conditional on any complexity-theoretic assumption.

BibTeX - Entry

@InProceedings{dawar_et_al:LIPIcs:2015:5407,
  author =	{Anuj Dawar and Pengming Wang},
  title =	{{A Definability Dichotomy for Finite Valued CSPs}},
  booktitle =	{24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
  pages =	{60--77},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-90-3},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{41},
  editor =	{Stephan Kreutzer},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5407},
  URN =		{urn:nbn:de:0030-drops-54078},
  doi =		{10.4230/LIPIcs.CSL.2015.60},
  annote =	{Keywords: descriptive complexity, constraint satisfaction, definability, fixed-point logic, optimization}
}

Keywords: descriptive complexity, constraint satisfaction, definability, fixed-point logic, optimization
Seminar: 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
Issue Date: 2015
Date of publication: 04.09.2015


DROPS-Home | Fulltext Search | Imprint Published by LZI