@InProceedings{creignou_et_al:DagSemProc.06401.1,
author = {Creignou, Nadia and Kolaitis, Phokion and Vollmer, Heribert},
title = {{06401 Abstracts Collection – Complexity of Constraints}},
booktitle = {Complexity of Constraints},
pages = {1--14},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6401},
editor = {Nadia Creignou and Phokion Kolaitis and Heribert Vollmer},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06401.1},
URN = {urn:nbn:de:0030-drops-8067},
doi = {10.4230/DagSemProc.06401.1},
annote = {Keywords: Constraint satisfaction problems, computational complexity, universal algebra, mathematical logic, finite model theory}
}
@InProceedings{creignou_et_al:DagSemProc.06401.2,
author = {Creignou, Nadia and Kolaitis, Phokion and Vollmer, Heribert},
title = {{06401 Executive Summary – Complexity of Constraints}},
booktitle = {Complexity of Constraints},
pages = {1--6},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6401},
editor = {Nadia Creignou and Phokion Kolaitis and Heribert Vollmer},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06401.2},
URN = {urn:nbn:de:0030-drops-8001},
doi = {10.4230/DagSemProc.06401.2},
annote = {Keywords: Constraint satisfaction problems, complexity}
}
@InProceedings{cohen_et_al:DagSemProc.06401.3,
author = {Cohen, David and Gyssens, Marc and Jeavons, Peter},
title = {{A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems}},
booktitle = {Complexity of Constraints},
pages = {1--22},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6401},
editor = {Nadia Creignou and Phokion Kolaitis and Heribert Vollmer},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06401.3},
URN = {urn:nbn:de:0030-drops-8017},
doi = {10.4230/DagSemProc.06401.3},
annote = {Keywords: Structural decomposition, spread cut}
}
@InProceedings{kullmann:DagSemProc.06401.4,
author = {Kullmann, Oliver},
title = {{Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities}},
booktitle = {Complexity of Constraints},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6401},
editor = {Nadia Creignou and Phokion Kolaitis and Heribert Vollmer},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06401.4},
URN = {urn:nbn:de:0030-drops-8030},
doi = {10.4230/DagSemProc.06401.4},
annote = {Keywords: Signed CNF, autarkies, minimal unsatisfiable, hypergraph colouring, block designs}
}
@InProceedings{chen_et_al:DagSemProc.06401.5,
author = {Chen, Hubie and Grohe, Martin},
title = {{Constraint Satisfaction with Succinctly Specified Relations}},
booktitle = {Complexity of Constraints},
pages = {1--15},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6401},
editor = {Nadia Creignou and Phokion Kolaitis and Heribert Vollmer},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06401.5},
URN = {urn:nbn:de:0030-drops-8022},
doi = {10.4230/DagSemProc.06401.5},
annote = {Keywords: Constraint satisfaction, complexity, succinct representations}
}
@InProceedings{schnoor_et_al:DagSemProc.06401.6,
author = {Schnoor, Henning and Schnoor, Ilka},
title = {{Enumerating all Solutions for Constraint Satisfaction Problems}},
booktitle = {Complexity of Constraints},
pages = {1--25},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6401},
editor = {Nadia Creignou and Phokion Kolaitis and Heribert Vollmer},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06401.6},
URN = {urn:nbn:de:0030-drops-8040},
doi = {10.4230/DagSemProc.06401.6},
annote = {Keywords: Complexity, constraint satisfaction, enumeration}
}
@InProceedings{schnoor_et_al:DagSemProc.06401.7,
author = {Schnoor, Henning and Schnoor, Ilka},
title = {{New Algebraic Tools for Constraint Satisfaction}},
booktitle = {Complexity of Constraints},
pages = {1--18},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6401},
editor = {Nadia Creignou and Phokion Kolaitis and Heribert Vollmer},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06401.7},
URN = {urn:nbn:de:0030-drops-8057},
doi = {10.4230/DagSemProc.06401.7},
annote = {Keywords: Constraints, Partial Clones, Galois Correspondence}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing