Details
Original language | Undefined/Unknown |
---|---|
Pages (from-to) | 727-742 |
Journal | Arch. Math. Log. |
Volume | 50 |
Issue number | 7-8 |
Publication status | Published - 2011 |
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Arch. Math. Log., Vol. 50, No. 7-8, 2011, p. 727-742.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Proof complexity of propositional default logic.
AU - Beyersdorff, Olaf
AU - Meier, Arne
AU - Müller, Sebastian
AU - Thomas, Michael
AU - Vollmer, Heribert
N1 - Funding information: An extended abstract of this article appeared in the proceedings of the conference SAT’10 []. Research was supported by DFG grants KO 1053/5-2 and VO 630/6-2, by a grant from the John Templeton Foundation, and by the Marie Curie FP7 Initial Training Network MALOA (no. 238381).
PY - 2011
Y1 - 2011
U2 - 10.1007/S00153-011-0245-8
DO - 10.1007/S00153-011-0245-8
M3 - Article
VL - 50
SP - 727
EP - 742
JO - Arch. Math. Log.
JF - Arch. Math. Log.
SN - 1432-0665
IS - 7-8
ER -