default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArne Meier
Person information
- affiliation: Leibniz Universität Hannover, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j27]Johannes Klaus Fichte
, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. J. Artif. Intell. Res. 80 (2024)- [c39]Nicolas Fröhlich, Arne Meier:
Submodel Enumeration for CTL Is Hard. AAAI 2024: 10517-10524 - [c38]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Rejection in Abstract Argumentation: Harder Than Acceptance? ECAI 2024: 3212-3219 - [c37]Markus Hecher, Yasir Mahmood, Arne Meier, Johannes Schmidt:
Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. IJCAI 2024: 3404-3412 - [e1]Arne Meier, Magdalena Ortiz:
Foundations of Information and Knowledge Systems - 13th International Symposium, FoIKS 2024, Sheffield, UK, April 8-11, 2024, Proceedings. Lecture Notes in Computer Science 14589, Springer 2024, ISBN 978-3-031-56939-5 [contents] - [i41]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Rejection in Abstract Argumentation: Harder Than Acceptance? CoRR abs/2408.10683 (2024) - [i40]Jan Gutleben, Arne Meier:
A SUBSET-SUM Characterisation of the A-Hierarchy. CoRR abs/2409.07996 (2024) - [i39]Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Synchronous Team Semantics for Temporal Logics. CoRR abs/2409.18667 (2024) - 2023
- [j26]Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting in Logspace. Algorithmica 85(10): 2923-2961 (2023) - [j25]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework. ACM Trans. Comput. Log. 24(3): 26:1-26:25 (2023) - [c36]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. IJCAI 2023: 3212-3220 - [c35]Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema:
Logics with Probabilistic Team Semantics and the Boolean Negation. JELIA 2023: 665-680 - [i38]Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer:
Parameterized Complexity of Weighted Team Definability. CoRR abs/2302.00541 (2023) - [i37]Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema:
Logics with probabilistic team semantics and the Boolean negation. CoRR abs/2306.00420 (2023) - [i36]Nicolas Fröhlich, Arne Meier:
Submodel Enumeration for CTL Is Hard. CoRR abs/2312.09868 (2023) - 2022
- [j24]Yasir Mahmood, Arne Meier:
Parameterised complexity of model checking and satisfiability in propositional dependence logic. Ann. Math. Artif. Intell. 90(2-3): 271-296 (2022) - [j23]Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer:
Enumerating teams in first-order team logics. Ann. Pure Appl. Log. 173(10): 103163 (2022) - [j22]Juha Kontinen, Arne Meier, Yasir Mahmood:
A parameterized view on the complexity of dependence and independence logic. J. Log. Comput. 32(8): 1624-1644 (2022) - [c34]Nicolas Fröhlich, Arne Meier:
Submodel Enumeration of Kripke Structures in Modal Logic. AiML 2022: 391-406 - [c33]Juha Kontinen, Arne Meier, Yasir Mahmood:
A Parameterized View on the Complexity of Dependence Logic. LFCS 2022: 125-142 - [c32]Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema:
Temporal Team Semantics Revisited. LICS 2022: 44:1-44:13 - 2021
- [j21]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized complexity of abduction in Schaefer's framework. J. Log. Comput. 31(1): 266-296 (2021) - [c31]Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Knowledge-Base Degrees of Inconsistency: Complexity and Counting. AAAI 2021: 6349-6357 - [c30]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. AAAI 2021: 6426-6434 - [c29]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Decomposition-Guided Reductions for Argumentation and Treewidth. IJCAI 2021: 1880-1886 - [c28]Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting in Logspace. STACS 2021: 40:1-40:17 - [i35]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. CoRR abs/2102.11782 (2021) - [i34]Juha Kontinen, Arne Meier, Yasir Mahmood:
A Parameterized View on the Complexity of Dependence Logic. CoRR abs/2109.09342 (2021) - [i33]Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema:
Temporal Team Semantics Revisited. CoRR abs/2110.12699 (2021) - 2020
- [b3]Arne Meier:
Parametrised enumeration. University of Hanover, Germany, 2020 - [j20]Arne Meier:
Incremental FPT Delay. Algorithms 13(5): 122 (2020) - [j19]Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. 21(1): 7:1-7:18 (2020) - [c27]Yasir Mahmood, Arne Meier:
Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. FoIKS 2020: 157-174 - [c26]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterised Complexity of Abduction in Schaefer's Framework. LFCS 2020: 195-213 - [i32]Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer:
Enumerating Teams in First-Order Team Logics. CoRR abs/2006.06953 (2020)
2010 – 2019
- 2019
- [j18]Andreas Krebs, Arne Meier, Martin Mundhenk:
The model checking fingerprints of CTL operators. Acta Informatica 56(6): 487-519 (2019) - [j17]Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler:
Backdoors for Linear Temporal Logic. Algorithmica 81(2): 476-496 (2019) - [j16]Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterised Enumeration for Modification Problems. Algorithms 12(9): 189 (2019) - [j15]Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model checking and validity in propositional and modal inclusion logics. J. Log. Comput. 29(5): 605-630 (2019) - [c25]Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. AAAI 2019: 2827-2834 - [i31]Yasir Mahmood, Arne Meier:
Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. CoRR abs/1904.06107 (2019) - [i30]Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting Classes with Bounded Nondeterminism. CoRR abs/1904.12156 (2019) - [i29]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterised Complexity for Abduction. CoRR abs/1906.00703 (2019) - 2018
- [j14]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83(3-4): 297-320 (2018) - [c24]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Probabilistic Team Semantics. FoIKS 2018: 186-206 - [c23]Arne Meier, Christian Reinbold:
Enumeration Complexity of Poor Man's Propositional Dependence Logic. FoIKS 2018: 303-321 - [c22]Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Team Semantics for the Specification and Verification of Hyperproperties. MFCS 2018: 10:1-10:16 - [i28]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Probabilistic team semantics. CoRR abs/1803.02180 (2018) - [i27]Arne Meier:
Enumeration in Incremental FPT-Time. CoRR abs/1804.07799 (2018) - [i26]Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. CoRR abs/1811.11501 (2018) - 2017
- [j13]Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60(4): 737-758 (2017) - [j12]Martin Lück, Arne Meier, Irena Schindler:
Parametrised Complexity of Satisfiability in Temporal Logic. ACM Trans. Comput. Log. 18(1): 1:1-1:32 (2017) - [c21]Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model Checking and Validity in Propositional and Modal Inclusion Logics. MFCS 2017: 32:1-32:14 - [i25]Arne Meier, Christian Reinbold:
Enumeration Complexity of Poor Man's Propositional Dependence Logic. CoRR abs/1704.03292 (2017) - [i24]Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Team Semantics for the Specification and Verification of Hyperproperties. CoRR abs/1709.08510 (2017) - 2016
- [c20]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Approximation and Dependence via Multiteam Semantics. FoIKS 2016: 271-291 - [c19]Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler:
Backdoors for Linear Temporal Logic. IPEC 2016: 23:1-23:17 - [c18]Johannes Klaus Fichte, Arne Meier, Irina Schindler:
Strong Backdoors for Default Logic. SAT 2016: 45-59 - [i23]Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler:
Strong Backdoors for Linear Temporal Logic. CoRR abs/1602.04934 (2016) - [i22]Johannes Klaus Fichte, Arne Meier, Irina Schindler:
Strong Backdoors for Default Logic. CoRR abs/1602.06052 (2016) - [i21]Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model Checking and Validity in Propositional and Modal Inclusion Logics. CoRR abs/1609.06951 (2016) - 2015
- [b2]Arne Meier, Heribert Vollmer:
Komplexität von Algorithmen. Mathematik für Anwendungen 4, Lehmanns Media 2015, ISBN 978-3-86541-761-9, pp. 1-204 - [j11]Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 54(5-6): 685-710 (2015) - [j10]Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk:
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆. Int. J. Found. Comput. Sci. 26(8): 1189- (2015) - [c17]Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterized Enumeration for Modification Problems. LATA 2015: 524-536 - [c16]Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. LATA 2015: 549-560 - [c15]Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Modal Inclusion Logic: Being Lax is Simpler than Being Strict. MFCS (1) 2015: 281-292 - [c14]Martin Lück, Arne Meier:
LTL Fragments are Hard for Standard Parameterisations. TIME 2015: 59-68 - [c13]Andreas Krebs, Arne Meier, Martin Mundhenk:
The Model Checking Fingerprints of CTL Operators. TIME 2015: 101-110 - [c12]Andreas Krebs, Arne Meier, Jonni Virtema:
A Team Based Variant of CTL. TIME 2015: 140-149 - [i20]Andreas Krebs, Arne Meier, Martin Mundhenk:
The model checking fingerprints of CTL operators. CoRR abs/1504.04708 (2015) - [i19]Martin Lück, Arne Meier:
LTL Fragments are Hard for Standard Parameterisations. CoRR abs/1504.06187 (2015) - [i18]Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR abs/1504.06409 (2015) - [i17]Andreas Krebs, Arne Meier, Jonni Virtema:
Parallel Computational Tree Logic. CoRR abs/1505.01964 (2015) - [i16]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Approximation and Dependence via Multiteam Semantics. CoRR abs/1510.09040 (2015) - 2014
- [i15]Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem. CoRR abs/1410.4044 (2014) - [i14]Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j9]Arne Meier, Thomas Schneider:
Generalized satisfiability for the description logic ALC. Theor. Comput. Sci. 505: 55-73 (2013) - [c11]Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. MFCS 2013: 290-301 - [c10]Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer:
Extended Modal Dependence Logic. WoLLIC 2013: 126-137 - [i13]Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. CoRR abs/1306.2171 (2013) - [i12]Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterized Enumeration with Ordering. CoRR abs/1309.5009 (2013) - 2012
- [j8]Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer:
Complexity of Model Checking for Logics over Kripke models. Bull. EATCS 108: 49-89 (2012) - [j7]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of reasoning for fragments of default logic. J. Log. Comput. 22(3): 587-604 (2012) - [j6]Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13(2): 17:1-17:22 (2012) - [c9]Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß:
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. Advances in Modal Logic 2012: 261-278 - [c8]Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA 2012: 389-400 - [i11]Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss:
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. CoRR abs/1204.1196 (2012) - [i10]Arne Meier:
Generalized Complexity of ALC Subsumption. CoRR abs/1205.0722 (2012) - 2011
- [b1]Arne Meier:
On the Complexity of Modal Logic Variants and their Fragments. University of Hanover, Cuvillier 2011, ISBN 978-3-86955-929-2, pp. I-XVI, 1-125 - [j5]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof complexity of propositional default logic. Arch. Math. Log. 50(7-8): 727-742 (2011) - [j4]Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer:
Model Checking CTL is Almost Always Inherently Sequential. Log. Methods Comput. Sci. 7(2) (2011) - [c7]Arne Meier, Thomas Schneider:
Generalized Satisfiability for the Description Logic ALC - (Extended Abstract). TAMC 2011: 552-562 - [i9]Arne Meier, Thomas Schneider:
Generalized Satisfiability for the Description Logic ALC. CoRR abs/1103.0853 (2011) - [i8]Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. CoRR abs/1110.0623 (2011) - 2010
- [j3]Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The complexity of satisfiability for fragments of hybrid logic - Part I. J. Appl. Log. 8(4): 409-421 (2010) - [c6]Arne Meier, Thomas Schneider:
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. Description Logics 2010 - [c5]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. SAT 2010: 30-43 - [i7]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games 2010 - [i6]Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games 2010 - [i5]Arne Meier, Thomas Schneider:
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. CoRR abs/1001.4255 (2010) - [i4]Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. CoRR abs/1006.0220 (2010)
2000 – 2009
- 2009
- [j2]Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk:
The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. 20(5): 901-918 (2009) - [j1]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of propositional implication. Inf. Process. Lett. 109(18): 1071-1077 (2009) - [c4]Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. MFCS 2009: 587-599 - [c3]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic. SAT 2009: 51-64 - [c2]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider:
Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28 - [i3]Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I. CoRR abs/0906.1489 (2009) - 2008
- [c1]Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer:
The Complexity of Satisfiability for Fragments of CTL and CTL*. RP 2008: 201-213 - [i2]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic. CoRR abs/0808.3884 (2008) - [i1]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Propositional Implication. CoRR abs/0811.0959 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
