81 - 82 out of 82Page size: 20
Publications
- 2008
- Published
The Complexity of Reasoning for Fragments of Default Logic
Beyersdorff, O., Meier, A., Thomas, M. & Vollmer, H., 28 Aug 2008, Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. Kullmann, O. (ed.). Vol. 5584. p. 51-64 14 p. (Lecture Notes in Computer Science).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
The Complexity of Satisfiability for Fragments of CTL and CTL*
Meier, A., Mundhenk, M., Thomas, M. & Vollmer, H., 2008, Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Vol. 223. p. 201-213 13 p. (Electron. Notes Theor. Comput. Sci.).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review