Details
| Original language | English |
|---|---|
| Title of host publication | Theory and Applications of Satisfiability Testing |
| Subtitle of host publication | SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings |
| Editors | Ofer Strichman, Stefan Szeider |
| Pages | 30-43 |
| Number of pages | 14 |
| Publication status | Published - 2010 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 6175 |
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Theory and Applications of Satisfiability Testing: SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings. ed. / Ofer Strichman; Stefan Szeider. 2010. p. 30-43 (Lecture Notes in Computer Science; Vol. 6175).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
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: Research supported in part by DFG grants KO 1053/5-2 and VO 630/6-1, by a grant from the John Templeton Foundation, and by the Marie Curie FP7 Initial Training Network MALOA (no. 238381).
PY - 2010
Y1 - 2010
U2 - 10.1007/978-3-642-14186-75
DO - 10.1007/978-3-642-14186-75
M3 - Conference contribution
T3 - Lecture Notes in Computer Science
SP - 30
EP - 43
BT - Theory and Applications of Satisfiability Testing
A2 - Strichman, Ofer
A2 - Szeider, Stefan
ER -