HTML Export for Dagstuhl Seminar Proceedings, Volume 5431

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 5431, </h2>
<ul>
<li>
    <span class="authors">Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, and Andrei Voronkov</span>
    <span class="title">05431 Abstracts Collection – Deduction and Applications</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05431.1">10.4230/DagSemProc.05431.1</a>
</li>
<li>
    <span class="authors">Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, and Andrei Voronkov</span>
    <span class="title">05431 Executive Summary – Deduction and Applications</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05431.2">10.4230/DagSemProc.05431.2</a>
</li>
<li>
    <span class="authors">Deepak Kapur</span>
    <span class="title">Automatically Generating Loop Invariants Using Quantifier Elimination</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05431.3">10.4230/DagSemProc.05431.3</a>
</li>
<li>
    <span class="authors">Viktor Kuncak, Martin Rinard, and Bruno Marnette</span>
    <span class="title">On Algorithms and Complexity for Sets with Cardinality Constraints</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05431.4">10.4230/DagSemProc.05431.4</a>
</li>
<li>
    <span class="authors">Jörg Siekmann</span>
    <span class="title">Proof Presentation</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05431.5">10.4230/DagSemProc.05431.5</a>
</li>
<li>
    <span class="authors">Jürgen Giesl, René Thiemann, and Peter Schneider-Kamp</span>
    <span class="title">Proving and Disproving Termination in the Dependency Pair Framework</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05431.6">10.4230/DagSemProc.05431.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