Infinite Domain Constraint Satisfaction Problem (Invited Talk)

Author Libor Barto

Thumbnail PDF


  • Filesize: 212 kB
  • 1 pages

Document Identifiers

Author Details

Libor Barto

Cite AsGet BibTex

Libor Barto. Infinite Domain Constraint Satisfaction Problem (Invited Talk). In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


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.
  • Descriptive complexity
  • Constraint Satisfaction Problem


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Libor Barto, Jakub Oprsal, and Michael Pinsker. The wonderland of reflections. CoRR, abs/1510.04521, 2015. URL:
  2. Libor Barto and Michael Pinsker. The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems. CoRR, abs/1602.04353, 2016. URL:
  3. Manuel Bodirsky. Complexity classification in infinite-domain constraint satisfaction. CoRR, abs/1201.0856, 2012. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail