The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Arne Meier" ( http://dblp.L3S.de/Authors/Arne_Meier )

URL (Homepage):  https://www.thi.uni-hannover.de/meier.html  Author page on DBLP  Author page in RDF  Community of Arne Meier in ASPL-2

Publication years (Num. hits)
2008-2010 (16) 2011-2013 (18) 2014-2015 (16) 2016-2018 (18) 2019 (7)
Publication types (Num. hits)
article(47) book(2) inproceedings(26)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 7 occurrences of 6 keywords

Results
Found 76 publication records. Showing 75 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Andreas Krebs, Arne Meier, Martin Mundhenk The model checking fingerprints of CTL operators. Search on Bibsonomy Acta Inf. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler Backdoors for Linear Temporal Logic. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yasir Mahmood 0002, Arne Meier, Johannes Schmidt 0001 Parameterised Complexity for Abduction. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Yasir Mahmood 0002, Arne Meier Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Anselm Haak, Arne Meier, Om Prakash 0002, B. V. Raghavendra Rao Parameterised Counting Classes with Bounded Nondeterminism. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema Model checking and validity in propositional and modal inclusion logics. Search on Bibsonomy J. Log. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Markus Hecher, Arne Meier Counting Complexity for Reasoning in Abstract Argumentation. Search on Bibsonomy AAAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arnaud Durand 0001, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema Approximation and dependence via multiteam semantics. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Arnaud Durand 0001, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema Probabilistic team semantics. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Johannes Klaus Fichte, Markus Hecher, Arne Meier Counting Complexity for Reasoning in Abstract Argumentation. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Arne Meier Enumeration in Incremental FPT-Time. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann 0002 Team Semantics for the Specification and Verification of Hyperproperties. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Arne Meier, Christian Reinbold Enumeration Complexity of Poor Man's Propositional Dependence Logic. Search on Bibsonomy FoIKS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Arnaud Durand 0001, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema Probabilistic Team Semantics. Search on Bibsonomy FoIKS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Lück, Arne Meier, Irena Schindler Parametrised Complexity of Satisfiability in Temporal Logic. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt 0001, Heribert Vollmer Paradigms for Parameterized Enumeration. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Arne Meier, Christian Reinbold Enumeration Complexity of Poor Man's Propositional Dependence Logic. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann 0002 Team Semantics for the Specification and Verification of Hyperproperties. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema Model Checking and Validity in Propositional and Modal Inclusion Logics. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Arne Meier, Irina Schindler Strong Backdoors for Default Logic. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema Model Checking and Validity in Propositional and Modal Inclusion Logics. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler Strong Backdoors for Linear Temporal Logic. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Johannes Klaus Fichte, Arne Meier, Irina Schindler Strong Backdoors for Default Logic. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Arnaud Durand 0001, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema Approximation and Dependence via Multiteam Semantics. Search on Bibsonomy FoIKS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler Backdoors for Linear Temporal Logic. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Martin Lück, Arne Meier LTL Fragments are Hard for Standard Parameterisations. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Arnaud Durand 0001, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema Approximation and Dependence via Multiteam Semantics. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Andreas Krebs, Arne Meier, Jonni Virtema Parallel Computational Tree Logic. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Andreas Krebs, Arne Meier, Martin Mundhenk The model checking fingerprints of CTL operators. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Arne Meier, Michael Thomas 0001, Heribert Vollmer, Martin Mundhenk Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Arne Meier, Irina Schindler, Johannes Schmidt 0001, Michael Thomas 0001, Heribert Vollmer On the parameterized complexity of non-monotonic logics. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Arne Meier, Heribert Vollmer Komplexität von Algorithmen. Search on Bibsonomy 2015   RDF
1Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer Parameterized Enumeration for Modification Problems. Search on Bibsonomy LATA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Martin Lück, Arne Meier, Irina Schindler Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. Search on Bibsonomy LATA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer Modal Inclusion Logic: Being Lax is Simpler than Being Strict. Search on Bibsonomy MFCS (1) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Martin Lück, Arne Meier LTL Fragments are Hard for Standard Parameterisations. Search on Bibsonomy TIME The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Andreas Krebs, Arne Meier, Jonni Virtema A Team Based Variant of CTL. Search on Bibsonomy TIME The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Andreas Krebs, Arne Meier, Martin Mundhenk The Model Checking Fingerprints of CTL Operators. Search on Bibsonomy TIME The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Martin Lück, Arne Meier, Irina Schindler Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Martin Lück, Arne Meier, Irina Schindler Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Arne Meier, Thomas Schneider 0002 Generalized satisfiability for the description logic ALC. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer Parameterized Enumeration with Ordering. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt 0001, Heribert Vollmer Paradigms for Parameterized Enumeration. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer Extended Modal Dependence Logic. Search on Bibsonomy WoLLIC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt 0001, Heribert Vollmer Paradigms for Parameterized Enumeration. Search on Bibsonomy MFCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas 0001 The Complexity of Reasoning for Fragments of Autoepistemic Logic. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas 0001, Felix Weiss The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Arne Meier Generalized Complexity of ALC Subsumption Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer Complexity of Model Checking for Logics over Kripke models. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2012 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Michael Thomas 0001, Heribert Vollmer The complexity of reasoning for fragments of default logic. Search on Bibsonomy J. Log. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Arne Meier, Johannes Schmidt 0001, Michael Thomas 0001, Heribert Vollmer On the Parameterized Complexity of Default Logic and Autoepistemic Logic. Search on Bibsonomy LATA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas 0001, Felix Weiß The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. Search on Bibsonomy Advances in Modal Logic The full citation details ... 2012 DBLP  BibTeX  RDF
1Arne Meier, Thomas Schneider 0002 Generalized Satisfiability for the Description Logic ALC Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas 0001, Heribert Vollmer Model Checking CTL is Almost Always Inherently Sequential Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arne Meier, Johannes Schmidt 0001, Michael Thomas 0001, Heribert Vollmer On the Parameterized Complexity of Default Logic and Autoepistemic Logic Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Sebastian Müller 0003, Michael Thomas 0001, Heribert Vollmer Proof complexity of propositional default logic. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arne Meier On the Complexity of Modal Logic Variants and their Fragments. Search on Bibsonomy 2011   RDF
1Arne Meier, Thomas Schneider 0002 Generalized Satisfiability for the Description Logic ALC - (Extended Abstract). Search on Bibsonomy TAMC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Arne Meier, Michael Thomas 0001, Heribert Vollmer The Complexity of Reasoning for Fragments of Autoepistemic Logic Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Arne Meier, Thomas Schneider 0002 The Complexity of Satisfiability for Sub-Boolean Fragments of ALC Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas 0001, Volker Weber, Felix Weiss The complexity of satisfiability for fragments of hybrid logic - Part I. Search on Bibsonomy J. Applied Logic The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Sebastian Müller 0003, Michael Thomas 0001, Heribert Vollmer Proof Complexity of Propositional Default Logic. Search on Bibsonomy Circuits, Logic, and Games The full citation details ... 2010 DBLP  BibTeX  RDF
1Nadia Creignou, Arne Meier, Michael Thomas 0001, Heribert Vollmer The Complexity of Reasoning for Fragments of Autoepistemic Logic. Search on Bibsonomy Circuits, Logic, and Games The full citation details ... 2010 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Sebastian Müller 0003, Michael Thomas 0001, Heribert Vollmer Proof Complexity of Propositional Default Logic. Search on Bibsonomy SAT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arne Meier, Thomas Schneider 0002 The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. Search on Bibsonomy Description Logics The full citation details ... 2010 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Michael Thomas 0001, Heribert Vollmer The complexity of propositional implication. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas 0001, Volker Weber, Felix Weiss The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Arne Meier, Michael Thomas 0001, Heribert Vollmer, Martin Mundhenk The Complexity of Satisfiability for Fragments of CTL and CTL*. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas 0001, Volker Weber, Felix Weiss The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Post’s lattice, complexity, satisfiability, decidability, hybrid logic
1Olaf Beyersdorff, Arne Meier, Michael Thomas 0001, Heribert Vollmer The Complexity of Reasoning for Fragments of Default Logic. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Michael Thomas 0001, Heribert Vollmer, Martin Mundhenk, Thomas Schneider 0002 Model Checking CTL is Almost Always Inherently Sequential. Search on Bibsonomy TIME The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Model checking, complexity, temporal logic
1Arne Meier, Martin Mundhenk, Michael Thomas 0001, Heribert Vollmer The Complexity of Satisfiability for Fragments of CTL and CTL*. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Michael Thomas 0001, Heribert Vollmer The Complexity of Propositional Implication Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Michael Thomas 0001, Heribert Vollmer The Complexity of Reasoning for Fragments of Default Logic Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
Displaying result #1 - #75 of 75 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license