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
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6542/
Barto, Libor
Infinite Domain Constraint Satisfaction Problem (Invited Talk)
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{barto:LIPIcs:2016:6542,
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 = {http://drops.dagstuhl.de/opus/volltexte/2016/6542},
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 | |
| Seminar: | 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 29.08.2016 |
