HTML Export for Dagstuhl Seminar Proceedings, Volume 7401

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 7401, </h2>
<ul>
<li>
    <span class="authors">Franz Baader, Byron Cook, Jürgen Giesl, and Robert Nieuwenhuis</span>
    <span class="title">07401 Abstracts Collection – Deduction and Decision Procedures</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07401.1">10.4230/DagSemProc.07401.1</a>
</li>
<li>
    <span class="authors">Franz Baader, Byron Cook, Jürgen Giesl, and Robert Nieuwenhuis</span>
    <span class="title">07401 Executive Summary – Deduction and Decision Procedures</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07401.2">10.4230/DagSemProc.07401.2</a>
</li>
<li>
    <span class="authors">René Thiemann, Jürgen Giesl, and Peter Schneider-Kamp</span>
    <span class="title">Decision Procedures for Loop Detection</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07401.3">10.4230/DagSemProc.07401.3</a>
</li>
<li>
    <span class="authors">Silvio Ghilardi, Silvio Ranise, Enrica Nicolini, and Daniele Zucchelli</span>
    <span class="title">From Non-Disjoint Combination to Satisfiability and Model-Checking of Infinite State Systems</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07401.4">10.4230/DagSemProc.07401.4</a>
</li>
<li>
    <span class="authors">Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, and Harald Zankl</span>
    <span class="title">Implementing RPO and POLO using SAT</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07401.5">10.4230/DagSemProc.07401.5</a>
</li>
<li>
    <span class="authors">Viorica Sofronie-Stokkermans, Carsten Ihlemann, and Swen Jacobs</span>
    <span class="title">Local Theory Extensions, Hierarchical Reasoning and Applications to Verification</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07401.6">10.4230/DagSemProc.07401.6</a>
</li>
<li>
    <span class="authors">Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Daniel De Schreye, and Alexander Serebrenik</span>
    <span class="title">Termination of Programs using Term Rewriting and SAT Solving</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07401.7">10.4230/DagSemProc.07401.7</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