<h2>Dagstuhl Seminar Proceedings, Volume 7441, </h2> <ul> <li> <span class="authors">Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, and Moshe Y. Vardi</span> <span class="title">07441 Abstracts Collection – Algorithmic-Logical Theory of Infinite Structures</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07441.1">10.4230/DagSemProc.07441.1</a> </li> <li> <span class="authors">Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, and Moshe Y. Vardi</span> <span class="title">07441 Summary – Algorithmic-Logical Theory of Infinite Structures</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07441.2">10.4230/DagSemProc.07441.2</a> </li> <li> <span class="authors">Markus Lohrey</span> <span class="title">Application of verification techniques to inverse monoids</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07441.3">10.4230/DagSemProc.07441.3</a> </li> <li> <span class="authors">Dietrich Kuske</span> <span class="title">Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07441.4">10.4230/DagSemProc.07441.4</a> </li> <li> <span class="authors">Stefan Göller, Markus Lohrey, and Carsten Lutz</span> <span class="title">PDL with Intersection and Converse is 2EXP-complete</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07441.5">10.4230/DagSemProc.07441.5</a> </li> <li> <span class="authors">Thierry Cachat</span> <span class="title">Tree Automata Make Ordinal Theory Easy</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07441.6">10.4230/DagSemProc.07441.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
Feedback for Dagstuhl Publishing