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.CSL.2016.2
URN: urn:nbn:de:0030-drops-65427
Go to the corresponding LIPIcs Volume Portal

Barto, Libor

Infinite Domain Constraint Satisfaction Problem (Invited Talk)

LIPIcs-CSL-2016-2.pdf (0.2 MB)


The computational and descriptive complexity of finite domain fixed template constraint satisfaction problem (CSP) is a well developed topic that combines several areas in mathematics and computer science. Allowing the domain to be infinite provides a way larger playground which covers many more computational problems and requires further mathematical tools. I will talk about some of the research challenges and recent progress on them.

BibTeX - Entry

  author =	{Libor Barto},
  title =	{{Infinite Domain Constraint Satisfaction Problem (Invited Talk)}},
  booktitle =	{25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
  pages =	{2:1--2:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-022-4},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{62},
  editor =	{Jean-Marc Talbot and Laurent Regnier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-65427},
  doi =		{10.4230/LIPIcs.CSL.2016.2},
  annote =	{Keywords: Descriptive complexity, Constraint Satisfaction Problem}

Keywords: Descriptive complexity, Constraint Satisfaction Problem
Collection: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Issue Date: 2016
Date of publication: 29.08.2016

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