Dagstuhl Seminar Proceedings, Volume 10061,

• Benjamin Rossman, Thomas Schwentick, Denis Thérien, and Heribert Vollmer 10061 Abstracts Collection – Circuits, Logic, and Games 10.4230/DagSemProc.10061.1
• Benjamin Rossman, Thomas Schwentick, Denis Thérien, and Heribert Vollmer 10061 Executive Summary – Circuits, Logic, and Games 10.4230/DagSemProc.10061.2
• Peter Lohmann and Heribert Vollmer Complexity Results for Modal Dependence Logic 10.4230/DagSemProc.10061.3
• Olaf Beyersdorff, Nicola Galesi, and Massimo Lauria Hardness of Parameterized Resolution 10.4230/DagSemProc.10061.4
• Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, and Heribert Vollmer Proof Complexity of Propositional Default Logic 10.4230/DagSemProc.10061.5
• Nadia Creignou, Arne Meier, Michael Thomas, and Heribert Vollmer The Complexity of Reasoning for Fragments of Autoepistemic Logic 10.4230/DagSemProc.10061.6