Publications
- 2016
- Published
SAT and Interactions (Dagstuhl Seminar 16381).
Beyersdorff, O., Creignou, N., Egly, U. & Vollmer, H., 2016Research output: Other contribution › Other publication › Research
- Published
Strong Backdoors for Default Logic
Fichte, J. K., Meier, A. & Schindler, I., 2016, Theory and Applications of Satisfiability Testing – SAT 2016 - 19th International Conference, Proceedings. Le Berre, D. & Creignou, N. (eds.). Cham, p. 45-59 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9710).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- 2015
- Published
Dependence logic with a majority quantifier
Durand, A., Ebbing, J., Kontinen, J. & Vollmer, H., Sept 2015, In: Journal of Logic, Language and Information. 24, p. 289-305 17 p.Research output: Contribution to journal › Article › Research › peer review
- Published
Complexity of Propositional Logics in Team Semantic
Hannula, M., Kontinen, J., Virtema, J. & Vollmer, H., 23 Apr 2015.Research output: Working paper/Preprint › Working paper/Discussion paper
- Published
A Team Based Variant of CTL.
Krebs, A., Meier, A. & Virtema, J., 2015, 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. p. 140-149Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
A Van Benthem Theorem for Modal Team Semantics
Kontinen, J., Müller, J., Schnoor, H. & Vollmer, H., 2015, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). p. 277-291Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
Circuits, Logic and Games (Dagstuhl Seminar 15401).
Bojanczyk, M., Mahajan, M., Schwentick, T. & Vollmer, H., 2015Research output: Other contribution › Other publication › Research
- Published
Complexity of Propositional Independence and Inclusion Logic
Hannula, M., Kontinen, J., Virtema, J. & Vollmer, H., 2015, Mathematical Foundations of Computer Science 2015: 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. p. 269-280Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
Dependence Logic with a Majority Quantifier.
Durand, A., Ebbing, J., Kontinen, J. & Vollmer, H., 2015, In: J. Log. Lang. Inf.. 24, 3, p. 289-305Research output: Contribution to journal › Article › Research › peer review
- Published
Komplexität von Algorithmen.
Meier, A. & Vollmer, H., 2015Research output: Book/Report › Textbook › Education
- Published
Logics for Dependence and Independence (Dagstuhl Seminar 15261).
Grädel, E., Kontinen, J., Väänänen, J. & Vollmer, H., 2015Research output: Other contribution › Other publication › Research
- Published
LTL Fragments are Hard for Standard Parameterisations
Lück, M. & Meier, A., 2015, 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. p. 59-68Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
Modal Inclusion Logic - Being Lax is Simpler than Being Strict.
Hella, L., Kuusisto, A., Meier, A. & Vollmer, H., 2015, Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings. p. 281-292Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
On the parameterized complexity of non-monotonic logics.
Meier, A., Schindler, I., Schmidt, J., Thomas, M. & Vollmer, H., 2015, In: Arch. Math. Log.. 54, 5-6, p. 685-710Research output: Contribution to journal › Article › Research › peer review
- Published
Parallel Computational Tree Logic.
Krebs, A., Meier, A. & Virtema, J., 2015, (CoRR).Research output: Working paper/Preprint › Technical report › Research
- Published
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem
Lück, M., Meier, A. & Schindler, I., 2015, Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. Dediu, A.-H., Formenti, E., Martín-Vide, C. & Truthe, B. (eds.). Vol. 8977. p. 549-560 12 p. (Lecture Notes in Computer Science).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
Parameterized Complexity of Weighted Satisfiability Problems - Decision, Enumeration, Counting.
Creignou, N. & Vollmer, H., 2015, In: Fundam. Informaticae. 136, 4, p. 297-316Research output: Contribution to journal › Article › Research › peer review
- Published
Parameterized Enumeration for Modification Problems.
Creignou, N., Ktari, R., Meier, A., Müller, J., Olive, F. & Vollmer, H., 2015, Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe: Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings.. p. 524-536Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
The model checking fingerprints of CTL operators
Krebs, A., Meier, A. & Mundhenk, M., 2015, 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. Grandi, F., Lange, M. & Lomuscio, A. (eds.). IEEE Computer Society, p. 101-110 10 p. (CoRR).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- 2014
- Published
A Fragment of Dependence Logic Capturing Polynomial Time
Ebbing, J., Kontinen, J., Müller, J. & Vollmer, H., 2014, In: Logical Methods in Computer Science, Volume. 10, 3Research output: Contribution to journal › Article › Research › peer review