@InProceedings{beyersdorff_et_al:DagSemProc.10061.5,
author = {Beyersdorff, Olaf and Meier, Arne and M\"{u}ller, Sebastian and Thomas, Michael and Vollmer, Heribert},
title = {{Proof Complexity of Propositional Default Logic}},
booktitle = {Circuits, Logic, and Games},
pages = {1--14},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {10061},
editor = {Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10061.5},
URN = {urn:nbn:de:0030-drops-25261},
doi = {10.4230/DagSemProc.10061.5},
annote = {Keywords: Proof complexity, default logic, sequent calculus}
}