Portrait von Arne Meier

Arne Meier

Professor

Leibniz University Hannover, Institute for Theoretical Computer Science, Research Group Algorithms

meier (at) thi (dot) uni-hannover (dot) de




🔍

Conference Papers

  1. Disjunctions of Two Dependence Atoms
    Fröhlich, Nicolas and Kolaitis, Phokion G. and Meier, Arne
    34th EACSL Annual Conference on Computer Science Logic (CSL 2026), 10:1–10:21 (2026) DOI
    #dependence logic #team semantics #coherence #model checking #first-order logic
  2. When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
    Krebs, Andreas and Meier, Arne
    Foundations of Information and Knowledge Systems (FoIKS 2026), 232–242 (2026) DOI
    #modal logic #satisfiability #affine clones #S5 frames #complexity theory
  3. Facets in Argumentation: A Formal Approach to Argument Significance
    Fichte, Johannes Klaus and Fröhlich, Nicolas and Hecher, Markus and Lagerkvist, Victor and Mahmood, Yasir and Meier, Arne and Persson, Jonathan
    Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2025), 4491–4499 (2025) DOI
    #argumentation #parameterized complexity #facets #complexity theory
  4. A Logic-Based Framework for Database Repairs
    Fröhlich, Nicolas and Meier, Arne and Pardal, Nina and Virtema, Jonni
    22nd International Conference on Principles of Knowledge Representation and Reasoning (KR 2025) (2025) DOI
    #knowledge representation #dependence logic #team semantics #database repairs #semirings #complexity theory
  5. On the Complexity and Properties of Preferential Propositional Dependence Logic
    Sauerwald, Kai and Meier, Arne and Kontinen, Juha
    22nd International Conference on Principles of Knowledge Representation and Reasoning (KR 2025) (2025) DOI
    #dependence logic #knowledge representation #parameterized complexity #non-monotonic reasoning #team semantics #complexity theory #preferential logic
  6. A SUBSET-SUM Characterisation of the A-Hierarchy
    Gutleben, Jan and Meier, Arne
    SOFSEM 2025: Theory and Practice of Computer Science, 31–44 (2025) DOI
    #parameterized complexity #counting complexity #A-hierarchy
  7. Submodel Enumeration for CTL Is Hard
    Fröhlich, Nicolas and Meier, Arne
    Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2024), 10517–10524 (2024) DOI
    #modal logic #CTL #enumeration #complexity theory #model checking
  8. Rejection in Abstract Argumentation: Harder Than Acceptance?
    Fichte, Johannes Klaus and Hecher, Markus and Mahmood, Yasir and Meier, Arne
    ECAI 2024 – 27th European Conference on Artificial Intelligence, 3212–3219 (2024) DOI
    #argumentation #abstract argumentation #parameterized complexity #complexity theory
  9. Quantitative Claim-Centric Reasoning in Logic-Based Argumentation
    Hecher, Markus and Mahmood, Yasir and Meier, Arne and Schmidt, Johannes
    Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (IJCAI 2024), 3404–3412 (2024) Link
    #argumentation #counting complexity #parameterized complexity #logic-based argumentation
  10. Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation
    Fichte, Johannes Klaus and Hecher, Markus and Mahmood, Yasir and Meier, Arne
    Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI 2023), 3212–3220 (2023) DOI
    #argumentation #abstract argumentation #counting complexity #parameterized complexity
  11. Logics with Probabilistic Team Semantics and the Boolean Negation
    Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni
    Logics in Artificial Intelligence (JELIA 2023), 665–680 (2023) DOI
    #team semantics #dependence logic #probabilistic #complexity theory
  12. Submodel Enumeration of Kripke Structures in Modal Logic
    Fröhlich, Nicolas and Meier, Arne
    Advances in Modal Logic (AiML 2022), 391–406 (2022) Link
    #modal logic #enumeration #model checking #complexity theory
  13. A Parameterized View on the Complexity of Dependence Logic
    Kontinen, Juha and Meier, Arne and Mahmood, Yasir
    Logical Foundations of Computer Science (LFCS 2022), 125–142 (2022) DOI
    #dependence logic #parameterized complexity #team semantics #first-order logic
  14. Temporal Team Semantics Revisited
    Gutsfeld, Jens Oliver and Meier, Arne and Ohrem, Christoph and Virtema, Jonni
    37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 44:1–44:13 (2022) DOI
    #team semantics #temporal logic #model checking #complexity theory #modal logic #dependence logic
  15. Knowledge-Base Degrees of Inconsistency: Complexity and Counting
    Fichte, Johannes Klaus and Hecher, Markus and Meier, Arne
    Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2021), 6349–6357 (2021) DOI
    #argumentation #counting complexity #knowledge representation #complexity theory #abstract argumentation
  16. Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework
    Mahmood, Yasir and Meier, Arne and Schmidt, Johannes
    Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2021), 6426–6434 (2021) DOI
    #argumentation #logic-based argumentation #parameterized complexity #satisfiability #Post’s lattice #Schaefer’s framework #complexity theory
  17. Decomposition-Guided Reductions for Argumentation and Treewidth
    Fichte, Johannes Klaus and Hecher, Markus and Mahmood, Yasir and Meier, Arne
    Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI 2021), 1880–1886 (2021) DOI
    #argumentation #abstract argumentation #complexity theory #parameterized complexity
  18. Parameterised Counting in Logspace
    Haak, Anselm and Meier, Arne and Prakash, Om and Rao, B. V. Raghavendra
    38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), 40:1–40:17 (2021) DOI
    #counting complexity #parameterized complexity #logspace #bounded nondeterminism #complexity theory
  19. Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic
    Mahmood, Yasir and Meier, Arne
    Foundations of Information and Knowledge Systems (FoIKS 2020), 157–174 (2020) DOI
    #propositional #dependence logic #parameterized complexity #model checking #satisfiability #complexity theory
  20. Parameterised Complexity of Abduction in Schaefer’s Framework
    Mahmood, Yasir and Meier, Arne and Schmidt, Johannes
    Logical Foundations of Computer Science (LFCS 2020), 195–213 (2020) DOI
    #parameterized complexity #satisfiability #abduction #complexity theory #Post’s lattice #Schaefer’s framework #non-monotonic reasoning
  21. Counting Complexity for Reasoning in Abstract Argumentation
    Fichte, Johannes Klaus and Hecher, Markus and Meier, Arne
    Thirty-Third AAAI Conference on Artificial Intelligence (AAAI 2019), 2827–2834 (2019) DOI
    #argumentation #abstract argumentation #counting complexity #parameterized complexity #complexity theory
  22. Probabilistic Team Semantics
    Durand, Arnaud and Hannula, Miika and Kontinen, Juha and Meier, Arne and Virtema, Jonni
    Foundations of Information and Knowledge Systems (FoIKS 2018), 186–206 (2018) DOI
    #team semantics #probabilistic logic #dependence logic #complexity theory #first-order logic
  23. Enumeration Complexity of Poor Man’s Propositional Dependence Logic
    Meier, Arne and Reinbold, Christian
    Foundations of Information and Knowledge Systems (FoIKS 2018), 303–321 (2018) DOI
    #dependence logic #enumeration #team semantics #complexity theory
  24. Team Semantics for the Specification and Verification of Hyperproperties
    Krebs, Andreas and Meier, Arne and Virtema, Jonni and Zimmermann, Martin
    43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), 10:1–10:16 (2018) DOI
    #team semantics #temporal logic #model checking #complexity theory
  25. Model Checking and Validity in Propositional and Modal Inclusion Logics
    Hella, Lauri and Kuusisto, Antti and Meier, Arne and Virtema, Jonni
    42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 32:1–32:14 (2017) DOI
    #modal logic #inclusion logic #model checking #team semantics #complexity theory #validity
  26. Approximation and Dependence via Multiteam Semantics
    Durand, Arnaud and Hannula, Miika and Kontinen, Juha and Meier, Arne and Virtema, Jonni
    Foundations of Information and Knowledge Systems (FoIKS 2016), 271–291 (2016) DOI
    #team semantics #dependence logic #probabilistic logic #complexity theory #first-order logic
  27. Backdoors for Linear Temporal Logic
    Meier, Arne and Ordyniak, Sebastian and Sridharan, Ramanujan and Schindler, Irena
    11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 23:1–23:17 (2016) DOI
    #temporal logic #parameterized complexity #backdoors #complexity theory #LTL
  28. Strong Backdoors for Default Logic
    Fichte, Johannes Klaus and Meier, Arne and Schindler, Irina
    Theory and Applications of Satisfiability Testing (SAT 2016), 45–59 (2016) DOI
    #default logic #parameterized complexity #backdoors #non-monotonic reasoning #complexity theory
  29. Parameterized Enumeration for Modification Problems
    Creignou, Nadia and Ktari, Raïda and Meier, Arne and Müller, Julian-Steffen and Olive, Frédéric and Vollmer, Heribert
    Language and Automata Theory and Applications (LATA 2015), 524–536 (2015) DOI
    #enumeration #parameterized complexity #complexity theory
  30. Parameterized Complexity of CTL – A Generalization of Courcelle’s Theorem
    Lück, Martin and Meier, Arne and Schindler, Irina
    Language and Automata Theory and Applications (LATA 2015), 549–560 (2015) DOI
    #modal logic #CTL #parameterized complexity
  31. Modal Inclusion Logic: Being Lax is Simpler than Being Strict
    Hella, Lauri and Kuusisto, Antti and Meier, Arne and Vollmer, Heribert
    Mathematical Foundations of Computer Science (MFCS 2015), 281–292 (2015) DOI
    #modal logic #inclusion logic #team semantics #complexity theory
  32. LTL Fragments are Hard for Standard Parameterisations
    Lück, Martin and Meier, Arne
    22nd International Symposium on Temporal Representation and Reasoning (TIME 2015), 59–68 (2015) DOI
    #temporal logic #parameterized complexity #LTL
  33. The Model Checking Fingerprints of CTL Operators
    Krebs, Andreas and Meier, Arne and Mundhenk, Martin
    22nd International Symposium on Temporal Representation and Reasoning (TIME 2015), 101–110 (2015) DOI
    #model checking #CTL #modal logic #complexity theory #Post’s lattice
  34. A Team Based Variant of CTL
    Krebs, Andreas and Meier, Arne and Virtema, Jonni
    22nd International Symposium on Temporal Representation and Reasoning (TIME 2015), 140–149 (2015) DOI
    #team semantics #CTL #temporal logic #complexity theory
  35. Paradigms for Parameterized Enumeration
    Creignou, Nadia and Meier, Arne and Müller, Julian-Steffen and Schmidt, Johannes and Vollmer, Heribert
    Mathematical Foundations of Computer Science (MFCS 2013), 290–301 (2013) DOI
    #enumeration #parameterized complexity #complexity theory #kernelization #self-reducibility #backdoors
  36. Extended Modal Dependence Logic
    Ebbing, Johannes and Hella, Lauri and Meier, Arne and Müller, Julian-Steffen and Virtema, Jonni and Vollmer, Heribert
    Logic, Language, Information, and Computation (WoLLIC 2013), 126–137 (2013) DOI
    #modal logic #dependence logic #team semantics #complexity theory
  37. The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
    Göller, Stefan and Meier, Arne and Mundhenk, Martin and Schneider, Thomas and Thomas, Michael and Weiß, Felix
    Advances in Modal Logic (AiML 2012), 261–278 (2012) Link
    #modal logic #hybrid logic #satisfiability #monotone frames #complexity theory
  38. On the Parameterized Complexity of Default Logic and Autoepistemic Logic
    Meier, Arne and Schmidt, Johannes and Thomas, Michael and Vollmer, Heribert
    Language and Automata Theory and Applications (LATA 2012), 389–400 (2012) DOI
    #default logic #parameterized complexity #non-monotonic reasoning #complexity theory #autoepistemic logic
  39. Generalized Satisfiability for the Description Logic ALC
    Meier, Arne and Schneider, Thomas
    Theory and Applications of Models of Computation (TAMC 2011), 552–562 (2011) DOI
    #description logic #ALC #satisfiability #complexity theory #Post’s lattice
  40. Proof Complexity of Propositional Default Logic
    Beyersdorff, Olaf and Meier, Arne and Müller, Sebastian and Thomas, Michael and Vollmer, Heribert
    Theory and Applications of Satisfiability Testing (SAT 2010), 30–43 (2010) DOI
    #default logic #proof complexity #satisfiability #non-monotonic reasoning
  41. The Complexity of Satisfiability for Fragments of Hybrid Logic – Part I
    Meier, Arne and Mundhenk, Martin and Schneider, Thomas and Thomas, Michael and Weber, Volker and Weiss, Felix
    Mathematical Foundations of Computer Science (MFCS 2009), 587–599 (2009) DOI
    #modal logic #hybrid logic #satisfiability #Post’s lattice #complexity theory
  42. The Complexity of Reasoning for Fragments of Default Logic
    Beyersdorff, Olaf and Meier, Arne and Thomas, Michael and Vollmer, Heribert
    Theory and Applications of Satisfiability Testing (SAT 2009), 51–64 (2009) DOI
    #default logic #satisfiability #non-monotonic reasoning #complexity theory #Post’s lattice
  43. Model Checking CTL is Almost Always Inherently Sequential
    Beyersdorff, Olaf and Meier, Arne and Thomas, Michael and Vollmer, Heribert and Mundhenk, Martin and Schneider, Thomas
    16th International Symposium on Temporal Representation and Reasoning (TIME 2009), 21–28 (2009) DOI
    #model checking #CTL #circuit complexity #complexity theory #Post’s lattice #temporal logic
  44. The Complexity of Satisfiability for Fragments of CTL and CTL*
    Meier, Arne and Mundhenk, Martin and Thomas, Michael and Vollmer, Heribert
    Second Workshop on Reachability Problems in Computational Models (RP 2008), 201–213 (2008) DOI
    #modal logic #CTL #CTL* #satisfiability #complexity theory #Post’s lattice #temporal logic

Journal Articles

  1. Logics with probabilistic team semantics and the Boolean negation
    Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni
    J. Log. Comput. 35(3) (2025) DOI
    #team semantics #dependence logic #probabilistic logic #complexity theory
  2. Counting Complexity for Reasoning in Abstract Argumentation
    Fichte, Johannes Klaus and Hecher, Markus and Meier, Arne
    J. Artif. Intell. Res. 80 (2024) DOI
    #argumentation #abstract argumentation #counting complexity #parameterized complexity #complexity theory
  3. Parameterized complexity of weighted team definability
    Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Vollmer, Heribert
    Math. Struct. Comput. Sci. 34(5), 375–389 (2024) DOI
    #team semantics #parameterized complexity #dependence logic #W-hierarchy #first-order logic
  4. Strong Backdoors for Default Logic
    Fichte, Johannes Klaus and Meier, Arne and Schindler, Irena
    ACM Trans. Comput. Log. 25(3), 1–24 (2024) DOI
    #default logic #parameterized complexity #backdoors #complexity theory #non-monotonic reasoning
  5. Parameterised Counting in Logspace
    Haak, Anselm and Meier, Arne and Prakash, Om and Rao, B. V. Raghavendra
    Algorithmica 85(10), 2923–2961 (2023) DOI
    #counting complexity #parameterized complexity #logspace #bounded nondeterminism #complexity theory
  6. Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework
    Mahmood, Yasir and Meier, Arne and Schmidt, Johannes
    ACM Trans. Comput. Log. 24(3), 26:1–26:25 (2023) DOI
    #argumentation #parameterized complexity #satisfiability #Post’s lattice #Schaefer’s framework #complexity theory #logic-based argumentation
  7. Parameterised complexity of model checking and satisfiability in propositional dependence logic
    Mahmood, Yasir and Meier, Arne
    Ann. Math. Artif. Intell. 90(2-3), 271–296 (2022) DOI
    #propositional #dependence logic #parameterized complexity #model checking #satisfiability #complexity theory
  8. Enumerating teams in first-order team logics
    Haak, Anselm and Meier, Arne and Müller, Fabian and Vollmer, Heribert
    Ann. Pure Appl. Log. 173(10), 103163 (2022) DOI
    #team semantics #enumeration #first-order logic #complexity theory
  9. A parameterized view on the complexity of dependence and independence logic
    Kontinen, Juha and Meier, Arne and Mahmood, Yasir
    J. Log. Comput. 32(8), 1624–1644 (2022) DOI
    #dependence logic #parameterized complexity #team semantics #first-order logic
  10. Parameterized complexity of abduction in Schaefer’s framework
    Mahmood, Yasir and Meier, Arne and Schmidt, Johannes
    J. Log. Comput. 31(1), 266–296 (2021) DOI
    #parameterized complexity #satisfiability #abduction #complexity theory #Post’s lattice #Schaefer’s framework #non-monotonic reasoning
  11. Incremental FPT Delay
    Meier, Arne
    Algorithms 13(5), 122 (2020) DOI
    #enumeration #parameterized complexity #complexity theory #function complexity #FPT #delay
  12. Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics
    Hella, Lauri and Kuusisto, Antti and Meier, Arne and Vollmer, Heribert
    ACM Trans. Comput. Log. 21(1), 7:1–7:18 (2020) DOI
    #modal logic #inclusion logic #team semantics #complexity theory
  13. The model checking fingerprints of CTL operators
    Krebs, Andreas and Meier, Arne and Mundhenk, Martin
    Acta Informatica 56(6), 487–519 (2019) DOI
    #model checking #CTL #modal logic #complexity theory #Post’s lattice
  14. Backdoors for Linear Temporal Logic
    Meier, Arne and Ordyniak, Sebastian and Ramanujan, M. S. and Schindler, Irena
    Algorithmica 81(2), 476–496 (2019) DOI
    #temporal logic #parameterized complexity #backdoors #complexity theory #LTL
  15. Parameterised Enumeration for Modification Problems
    Creignou, Nadia and Ktari, Raïda and Meier, Arne and Müller, Julian-Steffen and Olive, Frédéric and Vollmer, Heribert
    Algorithms 12(9), 189 (2019) DOI
    #enumeration #parameterized complexity #complexity theory
  16. Model checking and validity in propositional and modal inclusion logics
    Hella, Lauri and Kuusisto, Antti and Meier, Arne and Virtema, Jonni
    J. Log. Comput. 29(5), 605–630 (2019) DOI
    #modal logic #inclusion logic #model checking #team semantics #complexity theory #validity
  17. Approximation and dependence via multiteam semantics
    Durand, Arnaud and Hannula, Miika and Kontinen, Juha and Meier, Arne and Virtema, Jonni
    Ann. Math. Artif. Intell. 83(3-4), 297–320 (2018) DOI
    #team semantics #dependence logic #probabilistic logic #complexity theory #first-order logic
  18. Paradigms for Parameterized Enumeration
    Creignou, Nadia and Meier, Arne and Müller, Julian-Steffen and Schmidt, Johannes and Vollmer, Heribert
    Theory Comput. Syst. 60(4), 737–758 (2017) DOI
    #enumeration #parameterized complexity #complexity theory
  19. Parametrised Complexity of Satisfiability in Temporal Logic
    Lück, Martin and Meier, Arne and Schindler, Irena
    ACM Trans. Comput. Log. 18(1), 1:1–1:32 (2017) DOI
    #temporal logic #parameterized complexity #satisfiability #complexity theory
  20. On the parameterized complexity of non-monotonic logics
    Meier, Arne and Schindler, Irina and Schmidt, Johannes and Thomas, Michael and Vollmer, Heribert
    Arch. Math. Log. 54(5-6), 685–710 (2015) DOI
    #default logic #parameterized complexity #non-monotonic reasoning #complexity theory #abduction #autoepistemic logic #circumscription #MSO
  21. Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL*
    Meier, Arne and Thomas, Michael and Vollmer, Heribert and Mundhenk, Martin
    Int. J. Found. Comput. Sci. 26(8), 1189 (2015) DOI
    #modal logic #CTL #satisfiability #complexity theory #Post’s lattice #temporal logic
  22. Generalized satisfiability for the description logic ALC
    Meier, Arne and Schneider, Thomas
    Theor. Comput. Sci. 505, 55–73 (2013) DOI
    #description logic #ALC #satisfiability #complexity theory #Post’s lattice
  23. Complexity of Model Checking for Logics over Kripke models
    Meier, Arne and Müller, Julian-Steffen and Mundhenk, Martin and Vollmer, Heribert
    Bull. EATCS 108, 49–89 (2012) Link
    #model checking #modal logic #CTL #Post’s lattice #complexity theory #temporal logic #hybrid logic #intuistionistic logic #LTL #CTL* #modal dependence logic #modal logic #dependence logic
  24. The complexity of reasoning for fragments of default logic
    Beyersdorff, Olaf and Meier, Arne and Thomas, Michael and Vollmer, Heribert
    J. Log. Comput. 22(3), 587–604 (2012) DOI
    #default logic #satisfiability #non-monotonic reasoning #complexity theory #Post’s lattice
  25. The Complexity of Reasoning for Fragments of Autoepistemic Logic
    Creignou, Nadia and Meier, Arne and Vollmer, Heribert and Thomas, Michael
    ACM Trans. Comput. Log. 13(2), 17:1–17:22 (2012) DOI
    #non-monotonic reasoning #satisfiability #parameterized complexity #complexity theory #autoepistemic logic #Post’s lattice
  26. Proof complexity of propositional default logic
    Beyersdorff, Olaf and Meier, Arne and Müller, Sebastian and Thomas, Michael and Vollmer, Heribert
    Arch. Math. Log. 50(7-8), 727–742 (2011) DOI
    #default logic #proof complexity #satisfiability #non-monotonic reasoning
  27. Model Checking CTL is Almost Always Inherently Sequential
    Beyersdorff, Olaf and Meier, Arne and Mundhenk, Martin and Schneider, Thomas and Thomas, Michael and Vollmer, Heribert
    Log. Methods Comput. Sci. 7(2) (2011) DOI
    #model checking #CTL #circuit complexity #complexity theory #Post’s lattice #temporal logic
  28. The complexity of satisfiability for fragments of hybrid logic - Part I
    Meier, Arne and Mundhenk, Martin and Schneider, Thomas and Thomas, Michael and Weber, Volker and Weiss, Felix
    J. Appl. Log. 8(4), 409–421 (2010) DOI
    #modal logic #hybrid logic #satisfiability #Post’s lattice #complexity theory
  29. The Complexity of Satisfiability for Fragments of CTL and CTL*
    Meier, Arne and Thomas, Michael and Vollmer, Heribert and Mundhenk, Martin
    Int. J. Found. Comput. Sci. 20(5), 901–918 (2009) DOI
    #modal logic #CTL #CTL* #satisfiability #complexity theory #Post’s lattice #temporal logic
  30. The complexity of propositional implication
    Beyersdorff, Olaf and Meier, Arne and Thomas, Michael and Vollmer, Heribert
    Inf. Process. Lett. 109(18), 1071–1077 (2009) DOI
    #satisfiability #proof complexity #implication #Post’s lattice #complexity theory

Theses

  1. Parametrised enumeration
    Meier, Arne
    Habilitation thesis, Leibniz Universität Hannover, Institut für Theoretische Informatik (2020) DOI
    #parameterized complexity #enumeration
  2. Komplexität von Algorithmen
    Meier, Arne and Vollmer, Heribert
    Lehmanns Media (2015)
  3. On the Complexity of Modal Logic Variants and their Fragments
    Meier, Arne
    PhD Thesis, Leibniz Universität Hannover, Institut für Theoretische Informatik (2011)
    #temporal logic #CTL #CTL* #satisfiability #model checking #description logic #ALC #Post’s lattice #complexity theory
  4. Complexity of Temporal Logics
    Meier, Arne
    Master’s Thesis, Leibniz Universität Hannover, Institut für Theoretische Informatik (2007)
    #CTL #CTL* #temporal logic #satisfiability #complexity theory #Post’s lattice
  5. SAT-Algorithmen
    Meier, Arne
    Bachelor Thesis, Leibniz Universität Hannover, Institut für Theoretische Informatik (2005)

Powered by Jekyll and Minimal Light theme.