HTML Export for Dagstuhl Seminar Proceedings, Volume 10061

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 10061, </h2>
<ul>
<li>
    <span class="authors">Benjamin Rossman, Thomas Schwentick, Denis Thérien, and Heribert Vollmer</span>
    <span class="title">10061 Abstracts Collection – Circuits, Logic, and Games</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.10061.1">10.4230/DagSemProc.10061.1</a>
</li>
<li>
    <span class="authors">Benjamin Rossman, Thomas Schwentick, Denis Thérien, and Heribert Vollmer</span>
    <span class="title">10061 Executive Summary – Circuits, Logic, and Games</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.10061.2">10.4230/DagSemProc.10061.2</a>
</li>
<li>
    <span class="authors">Peter Lohmann and Heribert Vollmer</span>
    <span class="title">Complexity Results for Modal Dependence Logic</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.10061.3">10.4230/DagSemProc.10061.3</a>
</li>
<li>
    <span class="authors">Olaf Beyersdorff, Nicola Galesi, and Massimo Lauria</span>
    <span class="title">Hardness of Parameterized Resolution</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.10061.4">10.4230/DagSemProc.10061.4</a>
</li>
<li>
    <span class="authors">Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, and Heribert Vollmer</span>
    <span class="title">Proof Complexity of Propositional Default Logic</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.10061.5">10.4230/DagSemProc.10061.5</a>
</li>
<li>
    <span class="authors">Nadia Creignou, Arne Meier, Michael Thomas, and Heribert Vollmer</span>
    <span class="title">The Complexity of Reasoning for Fragments of Autoepistemic Logic</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.10061.6">10.4230/DagSemProc.10061.6</a>
</li>
</ul>

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