Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof Complexity of Propositional Default Logic
ICST, 2010.
@inproceedings{SAT-2010-BeyersdorffMMTV,
author = "Olaf Beyersdorff and Arne Meier and Sebastian Müller and Michael Thomas and Heribert Vollmer",
booktitle = "{Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing}",
doi = "10.1007/978-3-642-14186-7_5",
isbn = "978-3-642-14185-0",
pages = "30--43",
publisher = "{Springer International Publishing}",
series = "{Lecture Notes in Computer Science}",
title = "{Proof Complexity of Propositional Default Logic}",
volume = 6175,
year = 2010,
}
Tags: