Publications
- 2010
- Published
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Creignou, N., Meier, A., Thomas, M. & Vollmer, H., 2010, (Dagstuhl Seminar Proceedings).Research output: Working paper/Preprint › Technical report › Research
- Published
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Creignou, N., Meier, A., Thomas, M. & Vollmer, H., 2010, (CoRR).Research output: Working paper/Preprint › Technical report › Research
- Published
The Complexity of Reasoning for Fragments of Autoepistemic Logic∗
Creignou, N., Meier, A., Thomas, M. & Vollmer, H., 2010, Dagstuhl Seminar: Circuits, Logic, and Games 2010. Vol. 10061. (Dagstuhl Seminar Proceedings).Research output: Chapter in book/report/conference proceeding › Contribution to other report › Research › peer review
- 2009
- Published
Model Checking CTL is Almost Always Inherently Sequential
Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H., Mundhenk, M. & Schneider, T., 2009, TIME 2009, 16th International Symposium on Temporal Representation and Reasoning, Bressanone-Brixen, Italy, 23-25 July 2009, Proceedings. Lutz, C. & Raskin, J-F. (eds.). IEEE Computer Society, p. 21-28 8 p.Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Bauland, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 2009, In: Log. Methods Comput. Sci.. 5, 1, 1.Research output: Contribution to journal › Article › Research › peer review
- Published
The complexity of propositional implication
Beyersdorff, O., Meier, A., Thomas, M. & Vollmer, H., 2009, In: Information Processing Letters. 109, 18, p. 1071-1077 7 p.Research output: Contribution to journal › Article › Research › peer review
- Published
The Complexity of Satisfiability for Fragments of CTL and CTL*
Meier, A., Thomas, M., Vollmer, H. & Mundhenk, M., 2009, In: Int. J. Found. Comput. Sci.. 20, 5, p. 901-918Research output: Contribution to journal › Article › Research › peer review
- Published
The complexity of satisfiability problems: Refining Schaefer's theorem.
Allender, E., Bauland, M., Immerman, N., Schnoor, H. & Vollmer, H., 2009, In: J. Comput. Syst. Sci.. 75, 4, p. 245-254 10 p., 4.Research output: Contribution to journal › Article › Research › peer review
- Published
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
Bauland, M., Mundhenk, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 2009, In: Electron. Notes Theor. Comput. Sci.. 231, p. 277-292 16 p.Research output: Contribution to journal › Article › Research › peer review
- 2008
- Published
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Bauland, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 28 Dec 2008, In: Logical Methods in Computer Science, Volume.Research output: Contribution to journal › Article › Research › peer review
- 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
Boolean constraint satisfaction problems: When does post's lattice help?
Creignou, N. & Vollmer, H., 2008Research output: Book/Report › Monograph › Research › peer review
- Published
Extensional uniformity for Boolean circuits
McKenzie, P., Thomas, M. & Vollmer, H., 2008Research output: Book/Report › Monograph › Research › peer review
- Published
On second-order monadic groupoidal quantifiers
Kontinen, J. & Vollmer, H., 2008Research output: Book/Report › Monograph › 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
- 2007
- Published
Circuits, Logic, and Games, 06451
Schwentick, T., Thérien, D. & Vollmer, H., 2007, In: Dagstuhl Seminar Proceedings. 6451Research output: Contribution to journal › Conference article › Research › peer review
- Published
Computational complexity of constraint satisfaction
Vollmer, H., 2007, Computation and Logic in the Real World - Third Conference on Computability in Europe, CiE 2007, Proceedings. p. 748-757 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4497 LNCS).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
The complexity of generalized satisfiability for linear temporal logic
Bauland, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 2007, Foundations of Software Science and Computational Structures - 10th International Conference, FOSSACS 2007. Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007. Springer Verlag, p. 48-62 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4423 LNCS).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- 2006
- Published
Exploiting practical limitations of UML diagrams for model validation and execution
Steimann, F. & Vollmer, H., Apr 2006, In: Software and systems modeling. 5, 1, p. 26-47 22 p.Research output: Contribution to journal › Article › Research › peer review
- Published
Executive Summary of Dagstuhl-Seminar Complexity of Constraints, 06401
Creignou, N., Kolaitis, P. G. & Vollmer, H., 2006, In: Dagstuhl Seminar Proceedings. 6401Research output: Contribution to journal › Conference article › Research › peer review