Details
Original language | Undefined/Unknown |
---|---|
Pages (from-to) | 587-604 |
Journal | J. Log. Comput. |
Volume | 22 |
Issue number | 3 |
Publication status | Published - 2012 |
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: J. Log. Comput., Vol. 22, No. 3, 2012, p. 587-604.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - The complexity of reasoning for fragments of default logic.
AU - Beyersdorff, Olaf
AU - Meier, Arne
AU - Thomas, Michael
AU - Vollmer, Heribert
N1 - Funding information: This work was supported by the German Research Foundation (Deutsche Forschungsgemeinschaft) under grants KO 1053/5-2, VO 630/6-1 and VO 630/6-2.
PY - 2012
Y1 - 2012
U2 - 10.1093/LOGCOM/EXQ061
DO - 10.1093/LOGCOM/EXQ061
M3 - Article
VL - 22
SP - 587
EP - 604
JO - J. Log. Comput.
JF - J. Log. Comput.
SN - 1465-363X
IS - 3
ER -