Published in: Dagstuhl Reports, Volume 14, Issue 3 (2024)
Juha Kontinen, Jonni Virtema, Heribert Vollmer, Fan Yang, and Nicolas Fröhlich. Logics for Dependence and Independence: Expressivity and Complexity (Dagstuhl Seminar 24111). In Dagstuhl Reports, Volume 14, Issue 3, pp. 31-51, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{kontinen_et_al:DagRep.14.3.31, author = {Kontinen, Juha and Virtema, Jonni and Vollmer, Heribert and Yang, Fan and Fr\"{o}hlich, Nicolas}, title = {{Logics for Dependence and Independence: Expressivity and Complexity (Dagstuhl Seminar 24111)}}, pages = {31--51}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {14}, number = {3}, editor = {Kontinen, Juha and Virtema, Jonni and Vollmer, Heribert and Yang, Fan and Fr\"{o}hlich, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.3.31}, URN = {urn:nbn:de:0030-drops-211827}, doi = {10.4230/DagRep.14.3.31}, annote = {Keywords: finite model theory, formal linguistics, hyperproperties, information theory, team semantics} }
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: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, and Fan Yang. Counting of Teams in First-Order Team Logics. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{haak_et_al:LIPIcs.MFCS.2019.19, author = {Haak, Anselm and Kontinen, Juha and M\"{u}ller, Fabian and Vollmer, Heribert and Yang, Fan}, title = {{Counting of Teams in First-Order Team Logics}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {19:1--19:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.19}, URN = {urn:nbn:de:0030-drops-109634}, doi = {10.4230/LIPIcs.MFCS.2019.19}, annote = {Keywords: team-based logics, counting classes, finite model theory, descriptive complexity} }
Published in: Dagstuhl Reports, Volume 9, Issue 1 (2019)
Erich Grädel, Phokion G. Kolaitis, Juha Kontinen, and Heribert Vollmer. Logics for Dependence and Independence (Dagstuhl Seminar 19031). In Dagstuhl Reports, Volume 9, Issue 1, pp. 28-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Article{gradel_et_al:DagRep.9.1.28, author = {Gr\"{a}del, Erich and Kolaitis, Phokion G. and Kontinen, Juha and Vollmer, Heribert}, title = {{Logics for Dependence and Independence (Dagstuhl Seminar 19031)}}, pages = {28--46}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2019}, volume = {9}, number = {1}, editor = {Gr\"{a}del, Erich and Kolaitis, Phokion G. and Kontinen, Juha 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.9.1.28}, URN = {urn:nbn:de:0030-drops-105682}, doi = {10.4230/DagRep.9.1.28}, annote = {Keywords: dependence logic, mathematical logic, computational complexity, finite model theory, game theory} }
Published in: LIPIcs, Volume 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@Proceedings{vollmer_et_al:LIPIcs.STACS.2017, title = {{LIPIcs, Volume 66, STACS'17, Complete Volume}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-028-6}, ISSN = {1868-8969}, year = {2017}, volume = {66}, editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017}, URN = {urn:nbn:de:0030-drops-70366}, doi = {10.4230/LIPIcs.STACS.2017}, annote = {Keywords: Models of Computation, Nonnumerical Algorithms and Problems, Mathematical Logic, Formal Languages, Combinatorics, Graph Theory} }
Published in: LIPIcs, Volume 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{vollmer_et_al:LIPIcs.STACS.2017.0, author = {Vollmer, Heribert and Vall\'{e}e, Brigitte}, title = {{Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-028-6}, ISSN = {1868-8969}, year = {2017}, volume = {66}, editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.0}, URN = {urn:nbn:de:0030-drops-70327}, doi = {10.4230/LIPIcs.STACS.2017.0}, annote = {Keywords: Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers} }
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: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Arnaud Durand, Anselm Haak, Juha Kontinen, and Heribert Vollmer. Descriptive Complexity of #AC^0 Functions. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 20:1-20:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{durand_et_al:LIPIcs.CSL.2016.20, author = {Durand, Arnaud and Haak, Anselm and Kontinen, Juha and Vollmer, Heribert}, title = {{Descriptive Complexity of #AC^0 Functions}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {20:1--20:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.20}, URN = {urn:nbn:de:0030-drops-65601}, doi = {10.4230/LIPIcs.CSL.2016.20}, annote = {Keywords: finite model theory, Fagin's theorem, arithmetic circuits, counting classes, Skolem function} }
Published in: LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Proceedings{ollinger_et_al:LIPIcs.STACS.2016, title = {{LIPIcs, Volume 47, STACS'16, Complete Volume}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016}, URN = {urn:nbn:de:0030-drops-57682}, doi = {10.4230/LIPIcs.STACS.2016}, annote = {Keywords: Software/Program Verification, Models of Computation, Modes of Computation, Complexity Measures and Classes, Nonnumerical Algorithms and Problems, Specifying and Verifying and Reasoning about Programs, Mathematical Logic, Formal Languages} }
Published in: LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{ollinger_et_al:LIPIcs.STACS.2016.0, author = {Ollinger, Nicolas and Vollmer, Heribert}, title = {{Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.0}, URN = {urn:nbn:de:0030-drops-57015}, doi = {10.4230/LIPIcs.STACS.2016.0}, annote = {Keywords: Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents} }
Published in: Dagstuhl Reports, Volume 5, Issue 9 (2016)
Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, and Heribert Vollmer. Circuits, Logic and Games (Dagstuhl Seminar 15401). In Dagstuhl Reports, Volume 5, Issue 9, pp. 105-124, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{bojanczyk_et_al:DagRep.5.9.105, author = {Bojanczyk, Mikolaj and Mahajan, Meena and Schwentick, Thomas and Vollmer, Heribert}, title = {{Circuits, Logic and Games (Dagstuhl Seminar 15401)}}, pages = {105--124}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {5}, number = {9}, editor = {Bojanczyk, Mikolaj and Mahajan, Meena and Schwentick, Thomas 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.5.9.105}, URN = {urn:nbn:de:0030-drops-56872}, doi = {10.4230/DagRep.5.9.105}, annote = {Keywords: computational complexity theory, finite model theory, Boolean circuits, regular languages, finite monoids, Ehrenfeucht-Fraiss\'{e}-games} }
Published in: Dagstuhl Reports, Volume 5, Issue 6 (2016)
Erich Grädel, Juha Kontinen, Jouka Väänänen, and Heribert Vollmer. Logics for Dependence and Independence (Dagstuhl Seminar 15261). In Dagstuhl Reports, Volume 5, Issue 6, pp. 70-85, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{gradel_et_al:DagRep.5.6.70, author = {Gr\"{a}del, Erich and Kontinen, Juha and V\"{a}\"{a}n\"{a}nen, Jouka and Vollmer, Heribert}, title = {{Logics for Dependence and Independence (Dagstuhl Seminar 15261)}}, pages = {70--85}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {5}, number = {6}, editor = {Gr\"{a}del, Erich and Kontinen, Juha and V\"{a}\"{a}n\"{a}nen, Jouka 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.5.6.70}, URN = {urn:nbn:de:0030-drops-55084}, doi = {10.4230/DagRep.5.6.70}, annote = {Keywords: team semantics, dependence logic, mathematical logic, computational complexity, finite model theory, game theory} }
Published in: LIPIcs, Volume 41, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, and Heribert Vollmer. A Van Benthem Theorem for Modal Team Semantics. In 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 41, pp. 277-291, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kontinen_et_al:LIPIcs.CSL.2015.277, author = {Kontinen, Juha and M\"{u}ller, Julian-Steffen and Schnoor, Henning and Vollmer, Heribert}, title = {{A Van Benthem Theorem for Modal Team Semantics}}, booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)}, pages = {277--291}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-90-3}, ISSN = {1868-8969}, year = {2015}, volume = {41}, editor = {Kreutzer, Stephan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.277}, URN = {urn:nbn:de:0030-drops-54206}, doi = {10.4230/LIPIcs.CSL.2015.277}, annote = {Keywords: modal logic, dependence logic, team semantics, expressivity, bisimulation, independence, inclusion, generalized dependence atom} }
Published in: Dagstuhl Reports, Volume 3, Issue 2 (2013)
Samson Abramsky, Juha Kontinen, Jouko Väänanen, and Heribert Vollmer. Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071). In Dagstuhl Reports, Volume 3, Issue 2, pp. 45-54, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{abramsky_et_al:DagRep.3.2.45, author = {Abramsky, Samson and Kontinen, Juha and V\"{a}\"{a}nanen, Jouko and Vollmer, Heribert}, title = {{Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071)}}, pages = {45--54}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {3}, number = {2}, editor = {Abramsky, Samson and Kontinen, Juha and V\"{a}\"{a}nanen, Jouko 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.3.2.45}, URN = {urn:nbn:de:0030-drops-40127}, doi = {10.4230/DagRep.3.2.45}, annote = {Keywords: Data structures, Algorithms, Complexity, Verification, Logic} }
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: LIPIcs, Volume 13, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
Arnaud Durand, Johannes Ebbing, Juha Kontinen, and Heribert Vollmer. Dependence logic with a majority quantifier. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, pp. 252-263, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{durand_et_al:LIPIcs.FSTTCS.2011.252, author = {Durand, Arnaud and Ebbing, Johannes and Kontinen, Juha and Vollmer, Heribert}, title = {{Dependence logic with a majority quantifier}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)}, pages = {252--263}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-34-7}, ISSN = {1868-8969}, year = {2011}, volume = {13}, editor = {Chakraborty, Supratik and Kumar, Amit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.252}, URN = {urn:nbn:de:0030-drops-33467}, doi = {10.4230/LIPIcs.FSTTCS.2011.252}, annote = {Keywords: dependence logic, counting hierarchy, majority quantifier, second order logic, descriptive complexity, finite model theory} }
Published in: Dagstuhl Seminar Proceedings, Volume 10061, Circuits, Logic, and Games (2010)
Benjamin Rossman, Thomas Schwentick, Denis Thérien, and Heribert Vollmer. 10061 Abstracts Collection – Circuits, Logic, and Games. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{rossman_et_al:DagSemProc.10061.1, author = {Rossman, Benjamin and Schwentick, Thomas and Th\'{e}rien, Denis and Vollmer, Heribert}, title = {{10061 Abstracts Collection – Circuits, Logic, and Games}}, booktitle = {Circuits, Logic, and Games}, pages = {1--8}, 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.1}, URN = {urn:nbn:de:0030-drops-25280}, doi = {10.4230/DagSemProc.10061.1}, annote = {Keywords: Computational complexity theory, Finite model theory, Boolean circuits, Regular languages, Finite monoids, Ehrenfeucht-Fra\{\backslash''i\}ss\'{e}-games} }
Published in: Dagstuhl Seminar Proceedings, Volume 10061, Circuits, Logic, and Games (2010)
Benjamin Rossman, Thomas Schwentick, Denis Thérien, and Heribert Vollmer. 10061 Executive Summary – Circuits, Logic, and Games. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{rossman_et_al:DagSemProc.10061.2, author = {Rossman, Benjamin and Schwentick, Thomas and Th\'{e}rien, Denis and Vollmer, Heribert}, title = {{10061 Executive Summary – Circuits, Logic, and Games}}, booktitle = {Circuits, Logic, and Games}, pages = {1--5}, 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.2}, URN = {urn:nbn:de:0030-drops-25279}, doi = {10.4230/DagSemProc.10061.2}, annote = {Keywords: Computational complexity theory, finite model theory, Boolean circuits, regular languages, finite monoids, Ehrenfeucht-Fra\backslash"\backslashi ss\backslash'e-games} }
Published in: Dagstuhl Seminar Proceedings, Volume 10061, Circuits, Logic, and Games (2010)
Peter Lohmann and Heribert Vollmer. Complexity Results for Modal Dependence Logic. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{lohmann_et_al:DagSemProc.10061.3, author = {Lohmann, Peter and Vollmer, Heribert}, title = {{Complexity Results for Modal Dependence Logic}}, booktitle = {Circuits, Logic, and Games}, pages = {1--15}, 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.3}, URN = {urn:nbn:de:0030-drops-25240}, doi = {10.4230/DagSemProc.10061.3}, annote = {Keywords: Dependence logic, satisfiability problem, computational complexity, poor man's logic} }
Published in: Dagstuhl Seminar Proceedings, Volume 10061, Circuits, Logic, and Games (2010)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, and Heribert Vollmer. Proof Complexity of Propositional Default Logic. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{beyersdorff_et_al:DagSemProc.10061.5, author = {Beyersdorff, Olaf and Meier, Arne and M\"{u}ller, Sebastian and Thomas, Michael and Vollmer, Heribert}, title = {{Proof Complexity of Propositional Default Logic}}, booktitle = {Circuits, Logic, and Games}, pages = {1--14}, 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.5}, URN = {urn:nbn:de:0030-drops-25261}, doi = {10.4230/DagSemProc.10061.5}, annote = {Keywords: Proof complexity, default logic, sequent calculus} }
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 6451, Circuits, Logic, and Games (2007)
Thomas Schwentick, Denis Thérien, and Heribert Vollmer. 06451 Abstracts Collection – Circuits, Logic, and Games. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 6451, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{schwentick_et_al:DagSemProc.06451.1, author = {Schwentick, Thomas and Th\'{e}rien, Denis and Vollmer, Heribert}, title = {{06451 Abstracts Collection – Circuits, Logic, and Games }}, booktitle = {Circuits, Logic, and Games}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6451}, editor = {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.06451.1}, URN = {urn:nbn:de:0030-drops-9785}, doi = {10.4230/DagSemProc.06451.1}, annote = {Keywords: Computational complexity theory, finite model theory, Boolean circuits, regular languages, finite monoids, Ehrenfeucht-Fra\backslash"\{\backslashi\}ss\backslash'\{e\} games} }
Published in: Dagstuhl Seminar Proceedings, Volume 6451, Circuits, Logic, and Games (2007)
Thomas Schwentick, Denis Thérien, and Heribert Vollmer. 06451 Executive Summary – Circuits, Logic, and Games. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 6451, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{schwentick_et_al:DagSemProc.06451.2, author = {Schwentick, Thomas and Th\'{e}rien, Denis and Vollmer, Heribert}, title = {{06451 Executive Summary – Circuits, Logic, and Games }}, booktitle = {Circuits, Logic, and Games}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6451}, editor = {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.06451.2}, URN = {urn:nbn:de:0030-drops-9774}, doi = {10.4230/DagSemProc.06451.2}, annote = {Keywords: Circuits, Logics, Games} }
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} }
Feedback for Dagstuhl Publishing