HTML Export for Dagstuhl Reports, Volume 11, Issue 8

Copy to Clipboard Download

<h2>Dagstuhl Reports, Volume 11, Issue 8, </h2>
<ul>
<li>
    <span class="title">Dagstuhl Reports, Volume 11, Issue 8, September 2021, Complete Issue</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.11.8">10.4230/DagRep.11.8</a>
</li>
<li>
    <span class="title">Dagstuhl Reports, Table of Contents, Volume 11, Issue 8, 2021</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.11.8.i">10.4230/DagRep.11.8.i</a>
</li>
<li>
    <span class="authors">Joao Marques-Silva, Rafael Peñaloza, and Uli Sattler</span>
    <span class="title">Extending the Synergies Between SAT and Description Logics (Dagstuhl Seminar 21361)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.11.8.1">10.4230/DagRep.11.8.1</a>
</li>
<li>
    <span class="authors">Tiansi Dong, Achim Rettinger, Jie Tang, Barbara Tversky, and Frank van Harmelen</span>
    <span class="title">Structure and Learning (Dagstuhl Seminar 21362)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.11.8.11">10.4230/DagRep.11.8.11</a>
</li>
<li>
    <span class="authors">Maria Paola Bonacina, Philipp Rümmer, and Renate A. Schmidt</span>
    <span class="title">Integrated Deduction (Dagstuhl Seminar 21371)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.11.8.35">10.4230/DagRep.11.8.35</a>
</li>
<li>
    <span class="authors">Mariangiola Dezani, Roland Kuhn, Sam Lindley, and Alceste Scalas</span>
    <span class="title">Behavioural Types: Bridging Theory and Practice (Dagstuhl Seminar 21372)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.11.8.52">10.4230/DagRep.11.8.52</a>
</li>
<li>
    <span class="authors">Effie Lai-Chong Law, Asbjørn Følstad, Jonathan Grudin, and Björn Schuller</span>
    <span class="title">Conversational Agent as Trustworthy Autonomous System (Trust-CA) (Dagstuhl Seminar 21381)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.11.8.76">10.4230/DagRep.11.8.76</a>
</li>
<li>
    <span class="authors">Daniel Král’, Michał Pilipczuk, Sebastian Siebertz, and Blair D. Sullivan</span>
    <span class="title">Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.11.8.115">10.4230/DagRep.11.8.115</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