Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Nadia Creignou, Arnaud Durand, and Heribert Vollmer. Enumeration Classes Defined by Circuits. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 38:1-38:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{creignou_et_al:LIPIcs.MFCS.2022.38, author = {Creignou, Nadia and Durand, Arnaud and Vollmer, Heribert}, title = {{Enumeration Classes Defined by Circuits}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {38:1--38:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.38}, URN = {urn:nbn:de:0030-drops-168364}, doi = {10.4230/LIPIcs.MFCS.2022.38}, annote = {Keywords: Computational complexity, enumeration problem, Boolean circuit} }
Published in: Dagstuhl Reports, Volume 6, Issue 9 (2017)
Olaf Beyersdorff, Nadia Creignou, Uwe Egly, and Heribert Vollmer. SAT and Interactions (Dagstuhl Seminar 16381). In Dagstuhl Reports, Volume 6, Issue 9, pp. 74-93, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@Article{beyersdorff_et_al:DagRep.6.9.74, author = {Beyersdorff, Olaf and Creignou, Nadia and Egly, Uwe and Vollmer, Heribert}, title = {{SAT and Interactions (Dagstuhl Seminar 16381)}}, pages = {74--93}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2017}, volume = {6}, number = {9}, editor = {Beyersdorff, Olaf and Creignou, Nadia and Egly, Uwe and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.9.74}, URN = {urn:nbn:de:0030-drops-69116}, doi = {10.4230/DagRep.6.9.74}, annote = {Keywords: Combinatorics, Computational Complexity, P vs. NP, Proof Complexity, Quantified Boolean formulas, SAT-solvers, satisfiability problem} }
Published in: Dagstuhl Reports, Volume 2, Issue 11 (2013)
Nadia Creignou, Nicola Galesi, Oliver Kullmann, and Heribert Vollmer. SAT Interactions (Dagstuhl Seminar 12471). In Dagstuhl Reports, Volume 2, Issue 11, pp. 87-101, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@Article{creignou_et_al:DagRep.2.11.87, author = {Creignou, Nadia and Galesi, Nicola and Kullmann, Oliver and Vollmer, Heribert}, title = {{SAT Interactions (Dagstuhl Seminar 12471)}}, pages = {87--101}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {2}, number = {11}, editor = {Creignou, Nadia and Galesi, Nicola and Kullmann, Oliver and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.87}, URN = {urn:nbn:de:0030-drops-39786}, doi = {10.4230/DagRep.2.11.87}, annote = {Keywords: satisfiability problem, computational complexity, P-NP question, proof complexity, combinatorics, SAT-solvers, quantified Boolean formulas} }
Published in: Dagstuhl Seminar Proceedings, Volume 10061, Circuits, Logic, and Games (2010)
Nadia Creignou, Arne Meier, Michael Thomas, and Heribert Vollmer. The Complexity of Reasoning for Fragments of Autoepistemic Logic. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{creignou_et_al:DagSemProc.10061.6, author = {Creignou, Nadia and Meier, Arne and Thomas, Michael and Vollmer, Heribert}, title = {{The Complexity of Reasoning for Fragments of Autoepistemic Logic}}, booktitle = {Circuits, Logic, and Games}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10061}, editor = {Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien 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.10061.6}, URN = {urn:nbn:de:0030-drops-25234}, doi = {10.4230/DagSemProc.10061.6}, annote = {Keywords: Autoepistemic logic, computational complexity, nonmonotonic reasoning, Post's lattice} }
Published in: Dagstuhl Seminar Proceedings, Volume 6401, Complexity of Constraints (2006)
Nadia Creignou, Phokion Kolaitis, and Heribert Vollmer. 06401 Abstracts Collection – Complexity of Constraints. In Complexity of Constraints. Dagstuhl Seminar Proceedings, Volume 6401, pp. 1-14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6401, Complexity of Constraints (2006)
Nadia Creignou, Phokion Kolaitis, and Heribert Vollmer. 06401 Executive Summary – Complexity of Constraints. In Complexity of Constraints. Dagstuhl Seminar Proceedings, Volume 6401, pp. 1-6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6401, Complexity of Constraints (2006)
David Cohen, Marc Gyssens, and Peter Jeavons. A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems. In Complexity of Constraints. Dagstuhl Seminar Proceedings, Volume 6401, pp. 1-22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6401, Complexity of Constraints (2006)
Oliver Kullmann. Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. In Complexity of Constraints. Dagstuhl Seminar Proceedings, Volume 6401, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6401, Complexity of Constraints (2006)
Hubie Chen and Martin Grohe. Constraint Satisfaction with Succinctly Specified Relations. In Complexity of Constraints. Dagstuhl Seminar Proceedings, Volume 6401, pp. 1-15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6401, Complexity of Constraints (2006)
Henning Schnoor and Ilka Schnoor. Enumerating all Solutions for Constraint Satisfaction Problems. In Complexity of Constraints. Dagstuhl Seminar Proceedings, Volume 6401, pp. 1-25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6401, Complexity of Constraints (2006)
Henning Schnoor and Ilka Schnoor. New Algebraic Tools for Constraint Satisfaction. In Complexity of Constraints. Dagstuhl Seminar Proceedings, Volume 6401, pp. 1-18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@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} }
Feedback for Dagstuhl Publishing