Zeige Ergebnisse 1 - 217 von 217
2025
Barlag, T, Fröhlich, N, Hankala, T, Hannula, M, Hirvonen, M, Holzapfel, V, Kontinen, J, Meier, A & Strieker, L 2025 'Logic and Computation Through the Lens of Semirings'. https://doi.org/10.48550/arXiv.2502.12939
Gutleben, J & Meier, A 2025, A SUBSET-SUM Characterisation of the A-Hierarchy. in R Královič & V Kůrková (Hrsg.), SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 15539 LNCS, Springer Science and Business Media Deutschland GmbH, S. 31-44, 50th International Conference on Current Trends in Theory and Practice of Computer Science, Bratislava, Slowakei, 20 Jan. 2025. https://doi.org/10.1007/978-3-031-82697-9_3, https://doi.org/10.48550/arXiv.2409.07996
2024
Barlag, T, Holzapfel, V, Strieker, L, Virtema, J & Vollmer, H 2024, 'Graph Neural Networks and Arithmetic Circuits', Advances in Neural Information Processing Systems, Jg. 37. https://doi.org/10.48550/arXiv.2402.17805
Barlag, T, Chudigiewitsch, F & Gaube, SA 2024, 'Logical characterizations of algebraic circuit classes over integral domains', Mathematical Structures in Computer Science, Jg. 34, Nr. 5, S. 346-374. https://doi.org/10.1017/S0960129524000136
Fichte, JK, Hecher, M & Meier, A 2024, 'Counting Complexity for Reasoning in Abstract Argumentation', Journal of Artificial Intelligence Research, Jg. 80, S. 805–834. https://doi.org/10.1613/jair.1.16210
Fichte, JK, Hecher, M, Mahmood, Y & Meier, A 2024, Rejection in Abstract Argumentation: Harder Than Acceptance? in U Endriss, FS Melo, K Bach, A Bugarin-Diz, JM Alonso-Moral, S Barro & F Heintz (Hrsg.), ECAI 2024 - 27th European Conference on Artificial Intelligence, Including 13th Conference on Prestigious Applications of Intelligent Systems, PAIS 2024, Proceedings. Frontiers in Artificial Intelligence and Applications, Bd. 392, IOS Press BV, S. 3212-3219, 27th European Conference on Artificial Intelligence, ECAI 2024, Santiago de Compostela, Spanien, 19 Okt. 2024. https://doi.org/10.48550/arXiv.2408.10683, https://doi.org/10.3233/FAIA240867
Fichte, JK, Meier, A & Schindler, I 2024, 'Strong Backdoors for Default Logic', ACM Transactions on Computational Logic, Jg. 25, Nr. 3, 15. https://doi.org/10.1145/3655024
Fröhlich, N & Meier, A 2024, Submodel Enumeration for CTL Is Hard. in M Wooldridge, J Dy & S Natarajan (Hrsg.), AAAI Proceedings. Proceedings of the AAAI Conference on Artificial Intelligence, Nr. 9, Bd. 38, AAAI Press/International Joint Conferences on Artificial Intelligence, S. 10517-10524. https://doi.org/10.48550/arXiv.2312.09868, https://doi.org/10.1609/aaai.v38i9.28921
Hecher, M, Mahmood, Y, Meier, A & Schmidt, J 2024, Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. in K Larson (Hrsg.), Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024. IJCAI International Joint Conference on Artificial Intelligence, S. 3404-3412. <https://www.ijcai.org/proceedings/2024/377>
Kontinen, J, Mahmood, Y, Meier, A & Vollmer, H 2024, 'Parameterized complexity of weighted team definability', Mathematical Structures in Computer Science, Jg. 34, Nr. 5, S. 375-389. https://doi.org/10.1017/S0960129524000033, https://doi.org/10.48550/arXiv.2302.00541
Krebs, A, Meier, A, Virtema, J & Zimmermann, M 2024 'Synchronous Team Semantics for Temporal Logics.'. https://doi.org/10.48550/arXiv.2409.18667
Mahmood, Y, Virtema, J, Barlag, T & Ngomo, ACN 2024, Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. in A Meier & M Ortiz (Hrsg.), Foundations of Information and Knowledge Systems : 13th International Symposium, FoIKS 2024. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 14589 LNCS, Springer Science and Business Media Deutschland GmbH, S. 23-42, 13th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2024, Sheffield, Großbritannien / Vereinigtes Königreich, 8 Apr. 2024. https://doi.org/10.48550/arXiv.2312.01973, https://doi.org/10.1007/978-3-031-56940-1_2
Meier, A & Ortiz, M (Hrsg.) 2024, Foundations of Information and Knowledge Systems: 13th International Symposium, FoIKS 2024, Sheffield, UK, April 8-11, 2024, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 14589 LNCS, 1 Aufl., Springer, Cham, Cham. https://doi.org/10.1007/978-3-031-56940-1
Müller, F 2024, 'Counting and enumerating in first-order team logics', Doctor rerum naturalium, Gottfried Wilhelm Leibniz Universität Hannover, Hannover. https://doi.org/10.15488/16831
2023
Barlag, T, Hannula, M, Kontinen, J, Pardal, N & Virtema, J 2023, Unified Foundations of Team Semantics via Semirings. in P Marquis, TC Son & G Kern-Isberner (Hrsg.), Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023. Proceedings of the International Conference on Knowledge Representation and Reasoning, Association for the Advancement of Artificial Intelligence, S. 75-85, 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023, Rhodes, Griechenland, 2 Sept. 2023. https://doi.org/10.48550/arXiv.2303.07926, https://doi.org/10.24963/kr.2023/8
Chandoo, M 2023, 'Logical labeling schemes', Discrete mathematics, Jg. 346, Nr. 10, 113565. https://doi.org/10.15488/11960, https://doi.org/10.1016/j.disc.2023.113565
Fichte, JK, Hecher, M, Mahmood, Y & Meier, A 2023, Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. in E Elkind (Hrsg.), Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI 2023. IJCAI International Joint Conference on Artificial Intelligence, Bd. 2023-August, S. 3212-3220. https://doi.org/10.24963/ijcai.2023/358
Haak, A, Meier, A, Prakash, O & Rao, BVR 2023, 'Parameterised Counting in Logspace', ALGORITHMICA, Jg. 85, Nr. 10, 10, S. 2923-2961. https://doi.org/10.1007/s00453-023-01114-2
Hannula, M, Hirvonen, M, Kontinen, J, Mahmood, Y, Meier, A & Virtema, J 2023, Logics with Probabilistic Team Semantics and the Boolean Negation. in S Gaggl, MV Martinez, M Ortiz & M Ortiz (Hrsg.), JELIA 2023: Logics in Artificial Intelligence. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 14281 LNAI, Springer, Cham, S. 665-680, JELIA 2023 - 18th Edition of the European Conference on Logics in Artificial Intelligence, Dresden, Deutschland, 20 Sept. 2023. https://doi.org/10.48550/arXiv.2306.00420, https://doi.org/10.1007/978-3-031-43619-2_45
Mahmood, Y, Meier, A & Schmidt, J 2023, 'Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework', ACM Trans. Comput. Log., Jg. 24, Nr. 3, 26, S. 26:1-26:25. https://doi.org/10.1145/3582499
2022
Creignou, N, Durand, A & Vollmer, H 2022, Enumeration Classes Defined by Circuits. in S Szeider, R Ganian & A Silva (Hrsg.), 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022., 39, Leibniz International Proceedings in Informatics, LIPIcs, Bd. 241, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, Vienna, Österreich, 22 Aug. 2022. https://doi.org/10.48550/arXiv.2205.00539, https://doi.org/10.4230/LIPIcs.MFCS.2022.38
Fröhlich, N & Meier, A 2022, Submodel Enumeration of Kripke Structures in Modal Logic. in D Fernandez-Duque, A Palmigiano, A Palmigiano & S Pinchinat (Hrsg.), AiML. Advances in Modal Logic, Bd. 14, S. 391-406.
Gaube, SA & Schober, B 2022, 'Algorithmic local monomialization of a binomial: a comparison of different approaches', International Journal of Algebra and Computation, Jg. 33, Nr. 1, S. 161-195. https://doi.org/10.48550/arXiv.2012.14910, https://doi.org/10.1142/S0218196723500108
Gutsfeld, JO, Meier, A, Ohrem, C & Virtema, J 2022, Temporal Team Semantics Revisited. in LICS 22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science., 3533360, Association for Computing Machinery (ACM), New York, S. 44:1-44:13. https://doi.org/10.1145/3531130.3533360
Haak, A, Meier, A, Müller, F & Vollmer, H 2022, 'Enumerating teams in first-order team logics', Annals of Pure and Applied Logic, Jg. 173, Nr. 10, 103163. https://doi.org/10.1016/j.apal.2022.103163
Kontinen, J, Meier, A & Mahmood, Y 2022, 'A parameterized view on the complexity of dependence and independence logic', J. Log. Comput., Jg. 32, Nr. 8, S. 1624-1644. https://doi.org/10.1093/logcom/exac070
Kontinen, J, Meier, A & Mahmood, Y 2022, A Parameterized View on the Complexity of Dependence Logic. in S Artemov & A Nerode (Hrsg.), Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings.. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 13137 LNCS, Cham, S. 125-142, International Symposium on Logical Foundations of Computer Science, LFCS 2020, Deerfield Beach, USA / Vereinigte Staaten, 4 Jan. 2020. https://doi.org/10.1007/978-3-030-93100-1_9
Mahmood, Y & Meier, A 2022, 'Parameterised complexity of model checking and satisfiability in propositional dependence logic', Annals of Mathematics and Artificial Intelligence, Jg. 90, Nr. 2-3, S. 271-296. https://doi.org/10.48550/arXiv.1904.06107, https://doi.org/10.1007/s10472-021-09730-w
2021
Barlag, T & Vollmer, H 2021, A Logical Characterization of Constant-Depth Circuits over the Reals. in A Silva, R Wassermann & R de Queiroz (Hrsg.), Logic, Language, Information, and Computation: 27th International Workshop, WoLLIC 2021, Virtual Event, October 5–8, 2021, Proceedings. Bd. abs/2005.04916, Lecture Notes in Computer Science (LNCS), Bd. 13038, Springer, Cham, S. 16-30. https://doi.org/10.1007/978-3-030-88853-4_2
Durand, A, Haak, A, Kontinen, JA & Vollmer, H 2021, 'Descriptive complexity of #P functions: A new perspective', Journal of Computer and System Sciences, Jg. 116, S. 40-54. https://doi.org/10.1016/j.jcss.2020.04.002
Fichte, JK, Hecher, M, Mahmood, Y & Meier, A 2021, Decomposition-Guided Reductions for Argumentation and Treewidth. in Z-H Zhou (Hrsg.), Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021.. IJCAI International Joint Conference on Artificial Intelligence, S. 1880-1886, Thirty-Fifth AAAI Conference on Artificial Intelligence, 2 Feb. 2021. https://doi.org/10.24963/ijcai.2021/259
Fichte, JK, Hecher, M & Meier, A 2021, Knowledge-Base Degrees of Inconsistency - Complexity and Counting. in 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI-21 Technical Tracks, Nr. 7, Bd. 35, S. 6349-6357, Thirty-Fifth AAAI Conference on Artificial Intelligence, 2 Feb. 2021. https://doi.org/10.1609/aaai.v35i7.16788
Haak, A 2021, 'Descriptive Complexity of Circuit-Based Counting Classes', Doctor rerum naturalium, Gottfried Wilhelm Leibniz Universität Hannover, Hannover. https://doi.org/10.15488/11353
Haak, A, Meier, A, Prakash, O & Rao, BVR 2021, Parameterised Counting in Logspace. in M Blaser & B Monmege (Hrsg.), 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021., 40, Leibniz International Proceedings in Informatics, LIPIcs, Bd. 187, S. 1-17, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Deutschland, 16 März 2021. https://doi.org/10.48550/arXiv.1904.12156, https://doi.org/10.4230/LIPICS.STACS.2021.40
Mahmood, Y, Meier, A & Schmidt, J 2021, 'Parameterized complexity of abduction in Schaefer's framework', J. Log. Comput., Jg. 31, Nr. 1, 1, S. 266-296. https://doi.org/10.1093/logcom/exaa079
Mahmood, Y, Meier, A & Schmidt, J 2021, Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. in 35th AAAI Conference on Artificial Intelligence, AAAI 2021. S. 6426-6434. https://doi.org/10.1609/aaai.v35i7.16797
2020
Hella, L, Kuusisto, A, Meier, A & Vollmer, H 2020, 'Satisfiability of modal inclusion logic: Lax and strict semantics', ACM Transactions on Computational Logic, Jg. 21, Nr. 1, 7, S. 1-18. https://doi.org/10.1145/3356043
Lück, M 2020, 'Team Logic: Axioms, Expressiveness, Complexity', Doctor rerum naturalium, Gottfried Wilhelm Leibniz Universität Hannover, Hannover. https://doi.org/10.15488/9376
Mahmood, Y, Meier, A & Schmidt, J 2020, Parameterised Complexity of Abduction in Schaefer’s Framework. in S Artemov & A Nerode (Hrsg.), Logical Foundations of Computer Science (LFCS 2020): International Symposium, LFCS 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 11972 LNCS, Springer, Cham, S. 195-213, International Symposium on Logical Foundations of Computer Science, LFCS 2020, Deerfield Beach, USA / Vereinigte Staaten, 4 Jan. 2020. https://doi.org/10.48550/arXiv.1906.00703, https://doi.org/10.1007/978-3-030-36755-8_13
Mahmood, Y & Meier, A 2020, Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. in A Herzig & J Kontinen (Hrsg.), Foundations of Information and Knowledge Systems - 11th International Symposium, FoIKS 2020, Dortmund, Germany, February 17-21, 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 12012 LNCS, Springer, S. 157-174. https://doi.org/10.1007/978-3-030-39951-1_10, https://doi.org/10.15488/12823
Meier, A 2020, 'Incremental FPT delay', Algorithms, Jg. 13, Nr. 5, 122. https://doi.org/10.3390/A13050122
Meier, A 2020, 'Parametrised enumeration', Doctor habilitatus, Gottfried Wilhelm Leibniz Universität Hannover, Hannover. https://doi.org/10.15488/9427
2019
Creignou, N, Kröll, M, Pichler, R, Skritek, S & Vollmer, H 2019, 'A complexity theory for hard enumeration problems', Discrete applied mathematics, Jg. 268, S. 191-209. https://doi.org/10.1016/j.dam.2019.02.025
Creignou, N, Ktari, R, Meier, A, Müller, JS, Olive, F & Vollmer, H 2019, 'Parameterised Enumeration for Modification Problems', Algorithms, Jg. 12, Nr. 9, 9, S. 189. https://doi.org/10.3390/a12090189, https://doi.org/10.15488/10960
Fichte, JK, Hecher, M & Meier, A 2019, Counting complexity for reasoning in abstract argumentation. in AAAI-19, IAAI-19, EAAI-19 Proceedings. Bd. 1, Proceedings of the AAAI Conference on Artificial Intelligence, Bd. 33, AAAI Press/International Joint Conferences on Artificial Intelligence, S. 2827-2834, 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Annual Conference on Innovative Applications of Artificial Intelligence, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, USA / Vereinigte Staaten, 27 Jan. 2019. https://doi.org/10.48550/arXiv.1811.11501, https://doi.org/10.1609/aaai.v33i01.33012827
Greenyer, J, Gritzner, D, Harel, D & Marron, A 2019, Towards Automated Defect Analysis Using Execution Traces of Scenario-Based Models. in LF Pires, B Selic & S Hammoudi (Hrsg.), Model-Driven Engineering and Software Development: 6th International Conference, MODELSWARD 2018, Revised Selected Papers. Communications in Computer and Information Science, Bd. 991, Springer Verlag, S. 335-354, 6th International Conference on Model-Driven Engineering and Software Development, MODELSWARD 2018, Funchal, Portugal, 22 Jan. 2018. https://doi.org/10.1007/978-3-030-11030-7_15
Haak, A & Vollmer, H 2019, 'A model-theoretic characterization of constant-depth arithmetic circuits', Annals of Pure and Applied Logic, Jg. 170, Nr. 9, S. 1008-1029. https://doi.org/10.48550/arXiv.1603.09531, https://doi.org/10.1016/j.apal.2019.04.006
Haak, A, Kontinen, J, Müller, F, Vollmer, H & Yang, F 2019, Counting of teams in first-order team logics. in P Rossmanith, P Heggernes & J-P Katoen (Hrsg.), 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Bd. abs/1902.00246, 19, Leibniz International Proceedings in Informatics, LIPIcs, Bd. 138, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, S. 19:1-19:15, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Deutschland, 26 Aug. 2019. https://doi.org/10.4230/LIPIcs.MFCS.2019.19, https://doi.org/10.48550/arXiv.1902.00246
Hella, L, Kuusisto, A, Meier, A & Virtema, J 2019, 'Model checking and validity in propositional and modal inclusion logics', Journal of logic and computation, Jg. 29, Nr. 5, S. 605-630. https://doi.org/10.1093/logcom/exz008, https://doi.org/10.15488/3364
Krebs, A, Meier, A & Mundhenk, M 2019, 'The model checking fingerprints of CTL operators', Acta informatica, Jg. 56, Nr. 6, S. 487-519. https://doi.org/10.48550/arXiv.1504.04708, https://doi.org/10.1007/s00236-018-0326-9
Meier, A, Ordyniak, S, Ramanujan, MS & Schindler, I 2019, 'Backdoors for Linear Temporal Logic', ALGORITHMICA, Jg. 81, Nr. 2, S. 476-496. https://doi.org/10.1007/s00453-018-0515-5, https://doi.org/10.15488/1267
Vollmer, H & Vallée, B 2019, 'Guest Editorial: Special Issue on Theoretical Aspects of Computer Science', Theory of computing systems, Jg. 63, Nr. 5, 5, S. 923-925. https://doi.org/10.1007/s00224-019-09934-y
Vollmer, H 2019, 'Künstlicher Geist?', Christ in der Gegenwart, Jg. 2019, Nr. 1, S. 17-18. <https://www.herder.de/cig/cig-ausgaben/archiv/2019/1-2019/kuenstlicher-geist/>
Vollmer, H, Kontinen, J, Grädel, E & Kolaitis, PG 2019, 'Logics for Dependence and Independence: Report from Dagstuhl Seminar 19031', Dagstuhl Reports, Jg. 9, Nr. 1, S. 28-46. https://doi.org/10.4230/DagRep.9.1.28
2018
Chandoo, M 2018, 'Computational complexity aspects of implicit graph representations', Doctor rerum naturalium, Gottfried Wilhelm Leibniz Universität Hannover, Hannover. https://doi.org/10.15488/3569
Durand, A, Hannula, M, Kontinen, J, Meier, A & Virtema, J 2018, 'Approximation and dependence via multiteam semantics', Annals of Mathematics and Artificial Intelligence, Jg. 83, Nr. 3-4, S. 297-320. https://doi.org/10.1007/s10472-017-9568-4, https://doi.org/10.48550/arXiv.1510.09040
Durand, A, Haak, A & Vollmer, H 2018, Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. in LICS '18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. Proceedings - Symposium on Logic in Computer Science, Association for Computing Machinery (ACM), New York, S. 354-363, 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, Großbritannien / Vereinigtes Königreich, 9 Juli 2018. https://doi.org/https://arxiv.org/pdf/1710.01934.pdf, https://doi.org/10.1145/3209108.3209179
Durand, A, Hannula, M, Kontinen, J, Meier, A & Virtema, J 2018, Probabilistic team semantics. in S Woltran & F Ferrarotti (Hrsg.), Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 10833 LNCS, Springer Verlag, S. 186-206, 10th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2018, Budapest, Ungarn, 14 Mai 2018. https://doi.org/10.1007/978-3-319-90050-6_11
Dürr, C & Vollmer, H 2018, 'Preface of STACS 2016 Special Issue', Theory of Computing Systems, Jg. 62, Nr. 1, S. 1-3. https://doi.org/10.1007/s00224-017-9830-5
Fichte, JK, Hecher, M & Schindler, I 2018, Default Logic and Bounded Treewidth. in C Martin-Vide, ST Klein & D Shapira (Hrsg.), Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 10792 LNCS, Springer Verlag, S. 130-142, 12th International Conference on Language and Automata Theory and Applications, LATA 2018, Ramat Gan, Israel, 9 Apr. 2018. https://doi.org/10.48550/arXiv.1706.09393, https://doi.org/10.1007/978-3-319-77313-1_10
Greenyer, J, Gritzner, D, Harel, D & Marron, A 2018, Towards systematic and automatic handling of execution traces associated with scenario-based models. in S Hammoudi, LF Pires & B Selic (Hrsg.), MODELSWARD 2018 - Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development. SciTePress, S. 560-566, 6th International Conference on Model-Driven Engineering and Software Development, MODELSWARD 2018, Funchal, Portugal, 22 Jan. 2018. https://doi.org/10.5220/0006671105600566
Krebs, A, Meier, A, Virtema, J & Zimmermann, M 2018, Team semantics for the specification and verification of hyperproperties. in I Potapov, J Worrell & P Spirakis (Hrsg.), 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018., 10, Leibniz International Proceedings in Informatics, LIPIcs, Bd. 117, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, Großbritannien / Vereinigtes Königreich, 27 Aug. 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.10
Meier, A & Reinbold, C 2018, Enumeration complexity of poor man’s propositional dependence logic. in S Woltran & F Ferrarotti (Hrsg.), Foundations of Information and Knowledge Systems: 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14–18, 2018, Proceedings. 1. Aufl., Lecture Notes in Computer Science (LNCS), Bd. 10833, Information Systems and Applications, incl. Internet/Web, and HCI (LNISA), Springer Verlag, S. 303-321, 10th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2018, Budapest, Ungarn, 14 Mai 2018. https://doi.org/10.48550/arXiv.1704.03292, https://doi.org/10.1007/978-3-319-90050-6_17
Schindler, I 2018, 'Parameterized complexity of decision problems in non-classical logics', Doctor rerum naturalium, Gottfried Wilhelm Leibniz Universität Hannover, Hannover. https://doi.org/10.15488/3570
Steinberg, S, Greenyer, J, Gritzner, D, Harel, D, Katz, G & Marron, A 2018, Efficient distributed execution of multi-component scenario-based models. in B Selic, LF Pires & S Hammoudi (Hrsg.), Model-Driven Engineering and Software Development. Communications in Computer and Information Science, Bd. 880, Springer Verlag, S. 449-483, 5th International Conference on Model-Driven Engineering and Software Development, MODELSWARD 2017, Porto, Portugal, 19 Feb. 2017. https://doi.org/10.1007/978-3-319-94764-8_19
Vollmer, H, Hannula, M, Kontinen, J & Virtema, J 2018, 'Complexity of propositional logics in team semantic', ACM Transactions on Computational Logic, Jg. 19, Nr. 1, 2, S. 2:1-2:14. https://doi.org/10.1145/3157054
Vollmer, H 2018, 'Die Zukunft der Menschheit: Pierre Teilhard de Cardin und die Künstliche Intelligenz', Herder-Korrespondenz, Jg. 2018, Nr. 11, S. 28-32.
2017
Creignou, N, Kröll, M, Pichler, R, Skritek, S & Vollmer, H 2017, On the complexity of hard enumeration problems. in Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 10168 LNCS, Springer Verlag, S. 183-195, 11th International Conference on Language and Automata Theory and Applications, LATA 2017, Umea, Schweden, 6 März 2017. https://doi.org/10.1007/978-3-319-53733-7_13
Creignou, N, Meier, A, Müller, JS, Schmidt, J & Vollmer, H 2017, 'Paradigms for Parameterized Enumeration', Theory of Computing Systems, Jg. 60, Nr. 4, S. 737-758. https://doi.org/10.1007/s00224-016-9702-4
Durand, A, Haak, A & Vollmer, H 2017, Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth.. <https://dblp.org/rec/journals/corr/abs-1710-01934>
Hella, L, Kuusisto, A, Meier, A & Virtema, J 2017, Model checking and validity in propositional and modal inclusion logics. in KG Larsen, J-F Raskin & HL Bodlaender (Hrsg.), 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Leibniz International Proceedings in Informatics, LIPIcs, Bd. 83, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aalborg, Dänemark, 21 Aug. 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.32
Luck, M, Meier, A & Schindler, I 2017, 'Parametrised complexity of satisfiability in temporal logic', ACM Transactions on Computational Logic, Jg. 18, Nr. 1, 1. https://doi.org/10.1145/3001835
Vollmer, H & Vallée, B 2017, '34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany', Leibniz International Proceedings in Informatics, LIPIcs (Print), Jg. 66. <https://dblp.org/rec/conf/stacs/2017>
2016
Abramsky, S, Kontinen, J, Väänänen, J & Vollmer, H 2016, Dependence Logic, Theory and Applications. in Dependence Logic: Theory and Applications. Logics for Dependence and Independence, Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-31803-5
Abramsky, S, Kontinen, J, Väänänen, J & Vollmer, H 2016, Introduction. in Logics for Dependence and Independence. Birkhäuser, Cham, S. 1-3. https://doi.org/10.1007/978-3-319-31803-5_1
Beyersdorff, O, Creignou, N, Egly, U & Vollmer, H 2016, SAT and Interactions (Dagstuhl Seminar 16381).. https://doi.org/10.4230/DAGREP.6.9.74
Durand, A, Hannula, M, Kontinen, J, Meier, A & Virtema, J 2016, Approximation and Dependence via Multiteam Semantics. in M Gyssens & G Simari (Hrsg.), Foundations of Information and Knowledge Systems: 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 9616, Springer, Cham, S. 271-291. https://doi.org/10.1007/978-3-319-30024-5_15, https://doi.org/10.1007/s10472-017-9568-4
Durand, A, Haak, A, Kontinen, J & Vollmer, H 2016, Descriptive complexity of #AC0 functions. in J-M Talbot & L Regnier (Hrsg.), Computer Science Logic 2016, CSL 2016. Leibniz International Proceedings in Informatics, LIPIcs, Bd. 62. https://doi.org/10.4230/LIPIcs.CSL.2016.20
Durand, A, Kontinen, J & Vollmer, H 2016, Expressivity and Complexity of Dependence Logic. in Logics for Dependence and Independence. Birkhäuser, Cham, S. 5-32. https://doi.org/10.1007/978-3-319-31803-5_2
Fichte, JK, Meier, A & Schindler, I 2016, Strong Backdoors for Default Logic. in D Le Berre & N Creignou (Hrsg.), Theory and Applications of Satisfiability Testing – SAT 2016 - 19th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 9710, Springer, Cham, S. 45-59, 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, Bordeaux, Frankreich, 5 Juli 2016. https://doi.org/10.1007/978-3-319-40970-2_4
Haak, A & Vollmer, H 2016, A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. in J Väänänen, Å Hirvonen & R de Queiroz (Hrsg.), Logic, Language, Information, and Computation: 23rd International Workshop, WoLLIC 2016, Puebla, Mexico, August 16-19th, 2016. Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 9803 LNCS, Springer Verlag, Berlin, S. 234-248. https://doi.org/10.48550/arXiv.1603.09531, https://doi.org/10.1007/978-3-662-52921-8_15
Hella, L, Kuusisto, A, Meier, A & Virtema, J 2016 'Model Checking and Validity in Propositional and Modal Inclusion Logics' CoRR. <http://arxiv.org/abs/1609.06951>
Kontinen, J, Müller, JS, Schnoor, H & Vollmer, H 2016, 'Modal independence logic', Journal of Logic and Computation, Jg. 27, Nr. 5, S. 1333-1352. https://doi.org/10.1093/logcom/exw019
Meier, A, Ordyniak, S, Sridharan, R & Schindler, I 2016, Backdoors for Linear Temporal Logic. in J Guo & D Hermelin (Hrsg.), 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark. Bd. 63, 23, Leibniz International Proceedings in Informatics, LIPIcs, Bd. 63, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, S. 23:1-23:17. https://doi.org/10.4230/LIPIcs.IPEC.2016.23
Ollinger, N & Vollmer, H 2016, '33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France', Leibniz International Proceedings in Informatics, LIPIcs (Print), Jg. 47. <https://dblp.org/rec/conf/stacs/2016>
2015
Bojanczyk, M, Mahajan, M, Schwentick, T & Vollmer, H 2015, Circuits, Logic and Games (Dagstuhl Seminar 15401).. https://doi.org/10.4230/DAGREP.5.9.105
Creignou, N & Vollmer, H 2015, 'Parameterized Complexity of Weighted Satisfiability Problems - Decision, Enumeration, Counting.', Fundam. Informaticae, Jg. 136, Nr. 4, S. 297-316. https://doi.org/10.3233/FI-2015-1159
Creignou, N, Ktari, R, Meier, A, Müller, J-S, Olive, F & Vollmer, H 2015, Parameterized Enumeration for Modification Problems. in 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.. S. 524-536. https://doi.org/10.1007/978-3-319-15579-1_41
Durand, A, Ebbing, J, Kontinen, J & Vollmer, H 2015, 'Dependence logic with a majority quantifier', Journal of Logic, Language and Information, Jg. 24, S. 289-305. https://doi.org/10.48550/arXiv.1109.4750, https://doi.org/10.1007/s10849-015-9218-3
Durand, A, Ebbing, J, Kontinen, J & Vollmer, H 2015, 'Dependence Logic with a Majority Quantifier.', J. Log. Lang. Inf., Jg. 24, Nr. 3, S. 289-305. https://doi.org/10.1007/S10849-015-9218-3
Grädel, E, Kontinen, J, Väänänen, J & Vollmer, H 2015, Logics for Dependence and Independence (Dagstuhl Seminar 15261).. https://doi.org/10.4230/DAGREP.5.6.70
Hannula, M, Kontinen, J, Virtema, J & Vollmer, H 2015, Complexity of Propositional Independence and Inclusion Logic. in Mathematical Foundations of Computer Science 2015: 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. S. 269-280. https://doi.org/10.1007/978-3-662-48057-1_21
Hannula, M, Kontinen, J, Virtema, J & Vollmer, H 2015 'Complexity of Propositional Logics in Team Semantic'. https://doi.org/10.48550/arXiv.1504.06135
Hella, L, Kuusisto, A, Meier, A & Vollmer, H 2015, Modal Inclusion Logic: Being Lax is Simpler than Being Strict. in Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings. S. 281-292. https://doi.org/10.1007/978-3-662-48057-1_22
Kontinen, J, Müller, J-S, Schnoor, H & Vollmer, H 2015, A Van Benthem Theorem for Modal Team Semantics. in 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). S. 277-291. https://doi.org/10.4230/LIPICS.CSL.2015.277
Krebs, A, Meier, A & Virtema, J 2015, A Team Based Variant of CTL. in 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. S. 140-149. https://doi.org/10.1109/TIME.2015.11
Krebs, A, Meier, A & Virtema, J 2015 'Parallel Computational Tree Logic.' CoRR. <https://dblp.org/db/journals/corr/corr1505.html#KrebsMV15>
Krebs, A, Meier, A & Mundhenk, M 2015, The model checking fingerprints of CTL operators. in F Grandi, M Lange & A Lomuscio (Hrsg.), 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. CoRR, IEEE Computer Society, S. 101-110. https://doi.org/10.1109/TIME.2015.13
Lück, M & Meier, A 2015, LTL Fragments are Hard for Standard Parameterisations. in 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. S. 59-68. https://doi.org/10.1109/TIME.2015.9
Lück, M, Meier, A & Schindler, I 2015, Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. in A-H Dediu, E Formenti, C Martín-Vide & B Truthe (Hrsg.), Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. Bd. 8977, Lecture Notes in Computer Science, Springer, S. 549-560. https://doi.org/10.1007/978-3-319-15579-143
Meier, A & Vollmer, H 2015, Komplexität von Algorithmen. Bd. 4, Lehmanns Media. <https://dblp.org/rec/books/daglib/0038950>
Meier, A, Schindler, I, Schmidt, J, Thomas, M & Vollmer, H 2015, 'On the parameterized complexity of non-monotonic logics.', Arch. Math. Log., Jg. 54, Nr. 5-6, S. 685-710. https://doi.org/10.1007/S00153-015-0435-X
2014
Aschinger, M, Drescher, C, Gottlob, G & Vollmer, H 2014, 'LoCo - A Logic for Configuration Problems.', ACM Trans. Comput. Log., Jg. 15, Nr. 3, S. 20:1-20:25. https://doi.org/10.1145/2629454
Ebbing, J, Kontinen, J, Müller, J-S & Vollmer, H 2014, 'A Fragment of Dependence Logic Capturing Polynomial Time', Logical Methods in Computer Science, Volume, Jg. 10, Nr. 3. https://doi.org/10.2168/LMCS-10(3:3)2014
Kontinen, J, Müller, J-S, Schnoor, H & Vollmer, H 2014, Modal Independence Logic. in R Goré, BP Kooi & A Kurucz (Hrsg.), Advances in Modal Logic 10, invited and contributed papers from the tenth conference on "Advances in Modal Logic," held in Groningen, The Netherlands, August 5-8, 2014. College Publications, S. 353-372. <http://www.aiml.net/volumes/volume10/Kontinen-Mueller-Schnoor-Vollmer.pdf>
Lück, M, Meier, A & Schindler, I 2014, 'Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies', Electronic colloquium on computational complexity (ECCC), Jg. 2014, 134. <https://eccc.weizmann.ac.il/report/2014/134/download>
2013
Abramsky, S, Kontinen, J, Väänänen, JA & Vollmer, H 2013, Dependence Logic - Theory and Applications (Dagstuhl Seminar 13071).. https://doi.org/10.4230/DAGREP.3.2.45
Beyersdorff, O, Datta, S, Krebs, A, Mahajan, M, Scharfenberger-Fabian, G, Sreenivasaiah, K, Thomas, M & Vollmer, H 2013, 'Verifying proofs in constant depth.', ACM Trans. Comput. Theory, Jg. 5, Nr. 1, S. 2:1-2:23. https://doi.org/10.1145/2462896.2462898
Creignou, N, Meier, A, Müller, J-S, Schmidt, J & Vollmer, H 2013, Paradigms for Parameterized Enumeration. in K Chatterjee & J Sgall (Hrsg.), Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Lecture Notes in Computer Science (LNCS), Bd. 8087, Springer Berlin Heidelberg, S. 290-301, 38th International Symposium on Mathematical Foundations of Computer Science, Klosterneuburg, Österreich, 26 Aug. 2013. https://doi.org/10.1007/978-3-642-40313-2_27
Creignou, N, Meier, A, Müller, J-S, Schmidt, J & Vollmer, H 2013 'Paradigms for Parameterized Enumeration' CoRR. <http://arxiv.org/abs/1306.2171>
Creignou, N, Ktari, R, Meier, A, Müller, J-S, Olive, F & Vollmer, H 2013 'Parameterized Enumeration with Ordering.'. <https://dblp.org/rec/journals/corr/CreignouKMMOV13>
Ebbing, J, Hella, L, Meier, A, Müller, J-S, Virtema, J & Vollmer, H 2013, Extended Modal Dependence Logic. in Logic, Language, Information, and Computation - 20th International Workshop, WoLLIC 2013, Darmstadt, Germany, August 20-23, 2013. Proceedings. S. 126-137. https://doi.org/10.1007/978-3-642-39992-3_13
Lohmann, P & Vollmer, H 2013, 'Complexity Results for Modal Dependence Logic.', STUD LOGICA, Jg. 101, Nr. 2, S. 343-366. https://doi.org/10.1007/S11225-013-9483-6
Meier, A & Schneider, T 2013, 'Generalized satisfiability for the description logic ALC', Theor. Comput. Sci., Jg. 505, S. 55-73. https://doi.org/10.1016/J.TCS.2013.02.009
Müller, J-S & Vollmer, H 2013, Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice. in Logic, Language, Information, and Computation. S. 238-250. https://doi.org/10.1007/978-3-642-39992-3_21
2012
Aschinger, M, Drescher, C & Vollmer, H 2012, 'LoCo - A Logic for Configuration Problems.', S. 73-78. https://doi.org/10.3233/978-1-61499-098-7-73
Beyersdorff, O, Meier, A, Thomas, M & Vollmer, H 2012, 'The complexity of reasoning for fragments of default logic.', J. Log. Comput., Jg. 22, Nr. 3, S. 587-604. https://doi.org/10.1093/LOGCOM/EXQ061
Beyersdorff, O, Datta, S, Krebs, A, Mahajan, M, Scharfenberger-Fabian, G, Sreenivasaiah, K, Thomas, M & Vollmer, H 2012, 'Verifying Proofs in Constant Depth', Electronic colloquium on computational complexity (ECCC), Jg. TR12-079. <https://eccc.weizmann.ac.il/report/2012/079>
Creignou, N & Vollmer, H 2012, 'Parameterized Complexity of Weighted Satisfiability Problems.', S. 341-354. https://doi.org/10.1007/978-3-642-31612-8_26
Creignou, N, Galesi, N, Kullmann, O & Vollmer, H 2012, SAT Interactions (Dagstuhl Seminar 12471).. https://doi.org/10.4230/DAGREP.2.11.87
Creignou, N, Meier, A, Vollmer, H & Thomas, M 2012, 'The Complexity of Reasoning for Fragments of Autoepistemic Logic.', ACM Trans. Comput. Log., Jg. 13, Nr. 2, S. 17:1-17:22. https://doi.org/10.1145/2159531.2159539
Datta, S, Mahajan, M, Rao, BVR, Thomas, M & Vollmer, H 2012, 'Counting classes and the fine structure between NC1 and L.', Theor. Comput. Sci., Jg. 417, S. 36-49. https://doi.org/10.1016/J.TCS.2011.05.050
Göller, S, Meier, A, Mundhenk, M, Schneider, T, Thomas, M & Weiß, F 2012, The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. in Advances in Modal Logic 9, papers from the ninth conference on "Advances in Modal Logic," held in Copenhagen, Denmark, 22-25 August 2012. S. 261-278, Advances in Modal Logic 2012, 22 Aug. 2012. <http://arxiv.org/abs/1204.1196>
Meier, A, Müller, J-S, Mundhenk, M & Vollmer, H 2012, 'Complexity of Model Checking for Logics over Kripke models.', Bull. EATCS, Jg. 108, S. 49-89. <https://dblp.org/rec/journals/eatcs/MeierMMV12>
Meier, A 2012 'Generalized Complexity of ALC Subsumption' CoRR. <https://dblp.org/db/journals/corr/corr1205.html#abs-1205-0722>
Meier, A, Schmidt, J, Thomas, M & Vollmer, H 2012, On the Parameterized Complexity of Default Logic and Autoepistemic Logic. in Language and Automata Theory and Applications: 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings. S. 389-400. https://doi.org/10.1007/978-3-642-28332-1_33
2011
Bauland, M, Mundhenk, M, Schneider, T, Schnoor, H, Schnoor, I & Vollmer, H 2011, 'The tractability of model checking for LTL - The good, the bad, and the ugly fragments.', ACM Trans. Comput. Log., Jg. 12, Nr. 2, S. 13:1-13:28. https://doi.org/10.1145/1877714.1877719
Beyersdorff, O, Meier, A, Mundhenk, M, Schneider, T, Thomas, M & Vollmer, H 2011, 'Model Checking CTL is Almost Always Inherently Sequential', Log. Methods Comput. Sci., Jg. 7, Nr. 2. https://doi.org/10.2168/LMCS-7(2:12)2011
Beyersdorff, O, Meier, A, Müller, S, Thomas, M & Vollmer, H 2011, 'Proof complexity of propositional default logic.', Arch. Math. Log., Jg. 50, Nr. 7-8, S. 727-742. https://doi.org/10.1007/S00153-011-0245-8
Beyersdorff, O, Datta, S, Mahajan, M, Scharfenberger-Fabian, G, Sreenivasaiah, K, Thomas, M & Vollmer, H 2011, Verifying Proofs in Constant Depth. in Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. S. 84-95. https://doi.org/10.1007/978-3-642-22993-0_11
Durand, A, Ebbing, J, Kontinen, J & Vollmer, H 2011, Dependence logic with a majority quantifier. in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Bd. abs/1109.4750, S. 252-263. https://doi.org/10.4230/LIPICS.FSTTCS.2011.252
Meier, A & Schneider, T 2011, Generalized Satisfiability for the Description Logic ALC - (Extended Abstract). in M Ogihara & J Tarui (Hrsg.), Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings. Bd. 6648, Lecture Notes in Computer Science, Springer, S. 552-562. https://doi.org/10.1007/978-3-642-20877-553
Meier, A 2011, 'On the Complexity of Modal Logic Variants and their Fragments'. <https://dblp.org/rec/books/daglib/0030205>
Vöcking, B, Alt, H, Dietzfelbinger, M, Reischuk, R, Scheideler, C, Vollmer, H & Wagner, D 2011, Algorithms Unplugged. Fachbuch. https://doi.org/10.1007/978-3-642-15328-0
2010
Bauland, M, Böhler, E, Creignou, N, Reith, S, Schnoor, H & Vollmer, H 2010, 'The Complexity of Problems for Quantified Constraints.', Theory Comput. Syst., Jg. 47, Nr. 2, S. 454-490. https://doi.org/10.1007/S00224-009-9194-6
Beyersdorff, O, Meier, A, Müller, S, Thomas, M & Vollmer, H 2010, Proof Complexity of Propositional Default Logic. in O Strichman & S Szeider (Hrsg.), Theory and Applications of Satisfiability Testing: SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings. Lecture Notes in Computer Science, Bd. 6175, Springer, S. 30-43. https://doi.org/10.1007/978-3-642-14186-75
Beyersdorff, O, Meier, A, Müller, S, Thomas, M & Vollmer, H 2010, Proof Complexity of Propositional Default Logic. in Dagstuhl Seminar: Circuits, Logic, and Games 2010. Bd. 10061, Dagstuhl Seminar Proceedings (DSP), Dagstuhl Seminar: Circuits, Logic, and Games 2010, Wadern, Deutschland, 7 Feb. 2010.
Böhler, E, Creignou, N, Galota, M, Reith, S, Schnoor, H & Vollmer, H 2010, 'Boolean Circuits as a Data Structure for Boolean Functions - Efficient Algorithms and Hard Problems', Log. Methods Comput. Sci., Jg. 8, Nr. 3. https://doi.org/10.2168/LMCS-8(3:31)2012, https://doi.org/10.2168/LMCS-8(3:27)2012
Creignou, N, Meier, A, Thomas, M & Vollmer, H 2010 'The Complexity of Reasoning for Fragments of Autoepistemic Logic' Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. <http://drops.dagstuhl.de/opus/volltexte/2010/2523/>
Creignou, N, Meier, A, Thomas, M & Vollmer, H 2010 'The Complexity of Reasoning for Fragments of Autoepistemic Logic' CoRR. <https://dblp.org/db/journals/corr/corr1006.html#abs-1006-0220>
Creignou, N, Meier, A, Thomas, M & Vollmer, H 2010, The Complexity of Reasoning for Fragments of Autoepistemic Logic∗. in Dagstuhl Seminar: Circuits, Logic, and Games 2010. Bd. 10061, Dagstuhl Seminar Proceedings, Dagstuhl Seminar: Circuits, Logic, and Games 2010, Wadern, Deutschland, 7 Feb. 2010.
Datta, S, Mahajan, M, Rao, BVR, Thomas, M & Vollmer, H 2010, Counting classes and the fine structure between NC1 and L. in MFCS. S. 306-317. https://doi.org/10.1007/978-3-642-15155-2_28
Datta, S, Mahajan, M, Rao, BVR, Thomas, M & Vollmer, H 2010, 'Counting classes and the fine structure between NC1 and L.', Electronic colloquium on computational complexity (ECCC), Jg. TR10. <https://dblp.org/db/journals/eccc/eccc17.html#DattaMRTV10>
Kontinen, J & Vollmer, H 2010, 'On Second-Order Monadic Monoidal and Groupoidal Quantifiers', Log. Methods Comput. Sci., Jg. 6, Nr. 3. https://doi.org/10.2168/LMCS-6(3:25)2010
Lohmann, P & Vollmer, H 2010, Complexity Results for Modal Dependence Logic. in A Dawar & H Veith (Hrsg.), Computer Science Logic: 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings. Lecture Notes in Computer Science, Springer, S. 411-425. https://doi.org/10.48550/arXiv.1104.0607, https://doi.org/10.1007/978-3-642-15205-4_32
McKenzie, P, Thomas, M & Vollmer, H 2010, 'Extensional Uniformity for Boolean Circuits', SIAM J. Comput., Jg. 39, Nr. 7, 7, S. 3186-3206. https://doi.org/10.48550/arXiv.0805.4072, https://doi.org/10.1137/080741811
Meier, A, Mundhenk, M, Schneider, T, Thomas, M, Weber, V & Weiss, F 2010, 'The complexity of satisfiability for fragments of hybrid logic - Part I.', IMA Journal of Applied Mathematics, Jg. 8, Nr. 4, S. 409-421. https://doi.org/10.1016/J.JAL.2010.08.001
Meier, A & Schneider, T 2010, The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. in Proceedings of the 23rd International Workshop on Description Logics (DL 2010). 24th International Workshop on Description Logics, Waterloo, Ontario, Kanada, 4 Mai 2010. <https://arxiv.org/abs/1001.4255>
Rossman, B, Schwentick, T, Thérien, D & Vollmer, H 2010, 10061 Abstracts Collection - Circuits, Logic, and Games. in Circuits, Logic, and Games. <https://dblp.org/db/conf/dagstuhl/P10061.html#RossmanSTV10>
Rossman, B, Schwentick, T, Thérien, D & Vollmer, H 2010, 10061 Executive Summary - Circuits, Logic, and Games. in Circuits, Logic, and Games. <https://dblp.org/db/conf/dagstuhl/P10061.html#RossmanSTV10a>
Rossman, B, Schwentick, T, Thérien, D & Vollmer, H 2010, 'Circuits, Logic, and Games', Dagstuhl Seminar Proceedings (DSP), Jg. 10061.
Thomas, M & Vollmer, H 2010, 'Complexity of Non-Monotonic Logics', Bull. EATCS, Jg. 102, S. 53-82. <https://dblp.org/rec/journals/eatcs/ThomasV10>
2009
Allender, E, Bauland, M, Immerman, N, Schnoor, H & Vollmer, H 2009, 'The complexity of satisfiability problems: Refining Schaefer's theorem.', J. Comput. Syst. Sci., Jg. 75, Nr. 4, 4, S. 245-254. https://doi.org/10.1016/j.jcss.2008.11.001
Bauland, M, Schneider, T, Schnoor, H, Schnoor, I & Vollmer, H 2009, 'The Complexity of Generalized Satisfiability for Linear Temporal Logic', Log. Methods Comput. Sci., Jg. 5, Nr. 1, 1. <https://dblp.org/db/journals/lmcs/lmcs5.html#abs-0812-4848>
Bauland, M, Mundhenk, M, Schneider, T, Schnoor, H, Schnoor, I & Vollmer, H 2009, 'The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments', Electronic Notes in Theoretical Computer Science (ENTCS), Jg. 231, S. 277-292. https://doi.org/10.1016/j.entcs.2009.02.041, https://doi.org/10.15488/1519
Beyersdorff, O, Meier, A, Thomas, M, Vollmer, H, Mundhenk, M & Schneider, T 2009, Model Checking CTL is Almost Always Inherently Sequential. in C Lutz & J-F Raskin (Hrsg.), TIME 2009, 16th International Symposium on Temporal Representation and Reasoning, Bressanone-Brixen, Italy, 23-25 July 2009, Proceedings. IEEE Computer Society, S. 21-28. https://doi.org/10.1109/TIME.2009.12
Beyersdorff, O, Meier, A, Thomas, M & Vollmer, H 2009, 'The complexity of propositional implication', Information Processing Letters, Jg. 109, Nr. 18, S. 1071-1077. https://doi.org/10.1016/j.ipl.2009.06.015
Meier, A, Thomas, M, Vollmer, H & Mundhenk, M 2009, 'The Complexity of Satisfiability for Fragments of CTL and CTL*', Int. J. Found. Comput. Sci., Jg. 20, Nr. 5, S. 901-918. https://doi.org/10.1016/j.entcs.2008.12.040, https://doi.org/10.1142/S0129054109006954, https://doi.org/10.1142/S012905411592001X
Meier, A, Mundhenk, M, Schneider, T, Thomas, M, Weber, V & Weiss, F 2009, The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. in R Královic & D Niwinski (Hrsg.), Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. Bd. 5734, Lecture Notes in Computer Science, Springer, S. 587-599. https://doi.org/10.1007/978-3-642-03816-750
2008
Bauland, M, Schneider, T, Schnoor, H, Schnoor, I & Vollmer, H 2008, 'The Complexity of Generalized Satisfiability for Linear Temporal Logic', Logical Methods in Computer Science, Volume. https://doi.org/10.2168/LMCS-5(1:1)2009
Beyersdorff, O, Meier, A, Thomas, M & Vollmer, H 2008, The Complexity of Reasoning for Fragments of Default Logic. in O Kullmann (Hrsg.), Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. Bd. 5584, Lecture Notes in Computer Science, Springer, S. 51-64. https://doi.org/10.1007/978-3-642-02777-27
Creignou, N & Vollmer, H 2008, Boolean constraint satisfaction problems: When does post's lattice help?. https://doi.org/10.1007/978-3-540-92800-3_2
Kontinen, J & Vollmer, H 2008, On second-order monadic groupoidal quantifiers. https://doi.org/10.1007/978-3-540-69937-8_21
McKenzie, P, Thomas, M & Vollmer, H 2008, Extensional uniformity for Boolean circuits. https://doi.org/10.1007/978-3-540-87531-4_7
Meier, A, Mundhenk, M, Thomas, M & Vollmer, H 2008, The Complexity of Satisfiability for Fragments of CTL and CTL*. in Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Bd. 223, Electron. Notes Theor. Comput. Sci., S. 201-213. https://doi.org/10.1016/j.entcs.2008.12.040
2007
Bauland, M, Schneider, T, Schnoor, H, Schnoor, I & Vollmer, H 2007, The complexity of generalized satisfiability for linear temporal logic. in 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 4423 LNCS, Springer Verlag, S. 48-62, 10th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2007, Braga, Portugal, 24 März 2007. https://doi.org/10.1007/978-3-540-71389-0_5
Schwentick, T, Thérien, D & Vollmer, H 2007, 'Circuits, Logic, and Games, 06451', Dagstuhl Seminar Proceedings (DSP), Jg. 6451.
Vollmer, H 2007, Computational complexity of constraint satisfaction. in Computation and Logic in the Real World - Third Conference on Computability in Europe, CiE 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 4497 LNCS, S. 748-757, 3rd Conference on Computability in Europe, CiE 2007, Siena, Italien, 18 Juni 2007. https://doi.org/10.1007/978-3-540-73001-9_80
2006
Creignou, N, Kolaitis, PG & Vollmer, H 2006, 'Executive Summary of Dagstuhl-Seminar Complexity of Constraints, 06401', Dagstuhl Seminar Proceedings (DSP), Jg. 6401.
McKenzie, P, Schwentick, T, Thérien, D & Vollmer, H 2006, 'The many faces of a translation', Journal of Computer and System Sciences. https://doi.org/10.1016/j.jcss.2005.08.003
Steimann, F & Vollmer, H 2006, 'Exploiting practical limitations of UML diagrams for model validation and execution', Software and systems modeling, Jg. 5, Nr. 1, S. 26-47. https://doi.org/10.1007/s10270-005-0097-y
2005
Allender, E, Bauland, M, Immerman, N, Schnoor, H & Vollmer, H 2005, 'The complexity of satisfiability problems: Refining Schaefer's theorem', Lecture Notes in Computer Science, Jg. 3618, S. 71-82. https://doi.org/10.1007/11549345_8
Bauland, M, Chapdelaine, P, Creignou, N, Hermann, M & Vollmer, H 2005, 'An algebraic approach to the complexity of generalized conjunctive queries', Lecture Notes in Computer Science, Jg. 3542, S. 30-45. https://doi.org/10.1007/11527695_3
Böhler, E, Reith, S, Schnoor, H & Vollmer, H 2005, 'Bases for Boolean co-clones', Information processing letters, Jg. 96, Nr. 2, S. 59-66. https://doi.org/10.1016/j.ipl.2005.06.003
Galota, M & Vollmer, H 2005, 'Functions computable in polynomial space', Information and computation. https://doi.org/10.1016/j.ic.2005.02.002
Glaßer, C, Reith, S & Vollmer, H 2005, 'The complexity of base station positioning in cellular networks', Discrete applied mathematics, Jg. 148, Nr. 1, S. 1-12. https://doi.org/10.1016/j.dam.2004.07.005
2004
Böhler, E, Hemaspaandra, E, Reith, S & Vollmer, H 2004, The complexity of Boolean constraint isomorphism. in V Diekert & M Habib (Hrsg.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 2996, Springer Verlag, S. 164-175. https://doi.org/10.1007/978-3-540-24749-4_15
Mckenzie, P, Vollmer, H & Wagner, KW 2004, 'Arithmetic circuits and polynomial replacement systems', SIAM journal on computing. https://doi.org/10.1137/S009753970139207X
2003
Ebert, T, Merkle, W & Vollmer, H 2003, 'On the autoreducibility of random sequences', SIAM journal on computing. https://doi.org/10.1137/S0097539702415317
Galota, M, Kosub, S & Vollmer, H 2003, 'Generic separations and leaf languages', Mathematical logic quarterly. https://doi.org/10.1002/malq.200310037
Reith, S & Vollmer, H 2003, 'Optimal satisfiability for propositional calculi and constraint satisfaction problems', Inf. Comput., Jg. 186, Nr. 1, S. 1-19. https://doi.org/10.1016/S0890-5401(03)00092-0
Vollmer, H 2003, Complexity theory made easy: The formal language approach to the definition of complexity classes.
2002
Böhler, E, Hemaspaandra, E, Reith, S & Vollmer, H 2002, Equivalence and isomorphism for boolean constraint satisfaction.
Schwentick, T, Therien, D & Vollmer, H 2002, Partially-ordered two-way automata: A new characterization of DA.
2001
Galota, M & Vollmer, H 2001, 'A generalization of the Büchi-Elgot-Trakhtenbrot theorem', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).
Galota, M, Glaßer, C, Reith, S & Vollmer, H 2001, A polynomial-time approximation scheme for base station positioning in UMTS networks. in Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), Rome, Italy, July 21, 2001. Association for Computing Machinery (ACM), S. 52-59. https://doi.org/10.1145/381448.381455
Lautemann, C, McKenzie, P, Schwentick, T & Vollmer, H 2001, 'The descriptive complexity approach to LOGCFL', Journal of Computer and System Sciences. https://doi.org/10.1006/jcss.2000.1742
2000
Ebert, T & Vollmer, H 2000, On the autoreducibility of random sequences. https://doi.org/10.1007/3-540-44612-5_29
Hertrampf, U, Reith, S & Vollmer, H 2000, 'Note on closure properties of logspace MOD classes', Information processing letters. https://doi.org/10.1016/S0020-0190(00)00091-0
Kosub, S, Schmitz, H, Vollmer, H & Cai, J 2000, 'Uniform characterizations of complexity classes of functions', International Journal of Foundations of Computer Science. https://doi.org/10.1142/S0129054100000326
McKenzie, P, Vollmer, H & Wagner, KW 2000, Arithmetic circuits and polynomial replacement systems.
McKenzie, P, Schwentick, T, Thérien, D & Vollmer, H 2000, The many faces of a translation.
Reith, S & Vollmer, H 2000, Optimal satisfiability for propositional calculi and constraint satisfaction problems. https://doi.org/10.1007/3-540-44612-5_59
1999
Lautemann, C, McKenzie, P, Schwentick, T & Vollmer, H 1999, The descriptive complexity approach to LOGCFL.
Peichl, T & Vollmer, H 1999, Finite automata with generalized acceptance criteria.
Vollmer, H 1999, A generalized quantifier concept in computational complexity theory. https://doi.org/10.1007/3-540-46583-9_5
1998
Book, RV, Vollmer, H & Wagner, KW 1998, 'Probabilistic type-2 operators and "almost"-classes', Computational complexity. https://doi.org/10.1007/s000370050012
Caussinus, H, McKenzie, P, Thérien, D & Vollmer, H 1998, 'Nondeterministic NC1 Computation', Journal of Computer and System Sciences. https://doi.org/10.1006/jcss.1998.1588
Cronauer, K, Hertrampf, U, Vollmer, H & Wagner, KW 1998, 'The chain method to separate counting classes', Theory of computing systems. https://doi.org/10.1007/s002240000080
Kosub, S, Schmitz, H & Vollmer, H 1998, Uniformly defining complexity classes of functions. https://doi.org/10.1007/BFb0028595
Lautemann, C, McKenzie, P, Schwentick, T & Vollmer, H 1998 'The descriptive complexity approach to LOGCFL'.
Reith, S & Vollmer, H 1998 'The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae'.
Vollmer, H 1998, A Generalized Quantifier Concept in Computational Complexity Theory. in f. Annals of Pure and Applied Logic.
Vollmer, H 1998, 'Relating polynomial time to constant depth', Theoretical computer science. https://doi.org/10.1016/S0304-3975(98)00061-9
1997
Regan, KW & Vollmer, H 1997, 'Gap-languages and log-time complexity classes', Theoretical computer science. https://doi.org/10.1016/S0304-3975(96)00288-5
Vollmer, H & Wagner, KW 1997, On operators of higher types. in Proceedings of the Annual IEEE Conference on Computational Complexity. https://doi.org/10.1109/CCC.1997.612313
1996
Book, RV, Vollmer, H & Wagner, KW 1996, On type-2 probabilistic quantifiers.
Fenner, S, Green, F, Homer, S, Selman, AL, Thierauf, T & Vollmer, H 1996, Complements of multivalued functions. in Proceedings of the Annual IEEE Conference on Computational Complexity.
Hertrampf, U, Vollmer, H & Wagner, KW 1996, 'On balanced versus unbalanced computation trees', Theory of computing systems. https://doi.org/10.1007/BF01192696
Vollmer, H & Wagner, KW 1996, 'Recursion theoretic characterizations of complexity classes of counting functions', Theoretical computer science. https://doi.org/10.1016/0304-3975(95)00237-5
Vollmer, H 1996, Relations among parallel and sequential computation models.
1995
Hertrampf, U, Vollmer, H & Wagner, KW 1995, On the power of number-theoretic operations with respect to counting. in Proceedings of the IEEE Annual Structure in Complexity Theory Conference.
Vollmer, H & Wagner, KW 1995, 'Complexity classes of optimization functions', Information and computation. https://doi.org/10.1006/inco.1995.1109
1994
Vollmer, H 1994, On different reducibility notions for function classes.
1993
Hertrampf, U, Lautemann, C, Schwentick, T, Vollmer, H & Wagner, KW 1993, On the power of polynomial time bit-reductions. in Proceedings of the Eighth Annual Structure in Complexity Theory Conference.
