LIPIcs.CSL.2016.2.pdf
- Filesize: 212 kB
- 1 pages
Document
Infinite Domain Constraint Satisfaction Problem (Invited Talk)
Author
-
Part of:
Volume:
25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computer Science Logic (CSL) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-08-29
Cite As Get 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)
https://doi.org/10.4230/LIPIcs.CSL.2016.2
Abstract
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.
Subject Classification
Keywords
- Descriptive complexity
- Constraint Satisfaction Problem
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Libor Barto, Jakub Oprsal, and Michael Pinsker. The wonderland of reflections. CoRR, abs/1510.04521, 2015. URL: http://arxiv.org/abs/1510.04521.
- Libor Barto and Michael Pinsker. The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems. CoRR, abs/1602.04353, 2016. URL: http://arxiv.org/abs/1602.04353.
- Manuel Bodirsky. Complexity classification in infinite-domain constraint satisfaction. CoRR, abs/1201.0856, 2012. URL: http://arxiv.org/abs/1201.0856.