Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer. The Complexity of Reasoning for Fragments of Default Logic. In Oliver Kullmann, editor, Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. Volume 5584 of Lecture Notes in Computer Science, pages 51-64, Springer, 2009. [doi]
@inproceedings{BeyersdorffMTV09, title = {The Complexity of Reasoning for Fragments of Default Logic}, author = {Olaf Beyersdorff and Arne Meier and Michael Thomas and Heribert Vollmer}, year = {2009}, doi = {10.1007/978-3-642-02777-2_7}, url = {http://dx.doi.org/10.1007/978-3-642-02777-2_7}, tags = {logic}, researchr = {https://researchr.org/publication/BeyersdorffMTV09}, cites = {0}, citedby = {0}, pages = {51-64}, booktitle = {Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings}, editor = {Oliver Kullmann}, volume = {5584}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-02776-5}, }