Heribert Vollmer

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 42

Top Venues

CoRR

Dagstuhl Reports

Theory Comput. Syst.

ACM Trans. Comput. Log.

Julius Maximilians University Würzburg, Germany (PHD)

Education History

Julius Maximilians University Würzburg, Germany

PHD

Publications

Timon Barlag, Vivian Holzapfel, Laura Strieker, Jonni Virtema, Heribert Vollmer
Graph Neural Networks and Arithmetic Circuits. CoRR (2024)
Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer
Parameterized Complexity of Weighted Team Definability. CoRR (2023)
Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer
Enumerating teams in first-order team logics. Ann. Pure Appl. Log. 173 (10) (2022)
Nadia Creignou, Arnaud Durand, Heribert Vollmer
Enumeration Classes Defined by Circuits. MFCS (2022)
Nadia Creignou, Arnaud Durand, Heribert Vollmer
Enumeration Classes Defined by Circuits. CoRR (2022)
Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
Descriptive complexity of #P functions: A new perspective. J. Comput. Syst. Sci. 116 (2021)
Timon Barlag, Heribert Vollmer
A Logical Characterization of Constant-Depth Circuits over the Reals. WoLLIC (2021)
Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer
Enumerating Teams in First-Order Team Logics. CoRR (2020)
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. 21 (1) (2020)
Timon Barlag, Heribert Vollmer
A Logical Characterization of Constant-Depth Circuits over the Reals. CoRR (2020)
Anselm Haak, Heribert Vollmer
A model-theoretic characterization of constant-depth arithmetic circuits. Ann. Pure Appl. Log. 170 (9) (2019)
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) (2019)
Heribert Vollmer, Brigitte Vallée
Guest Editorial: Special Issue on Theoretical Aspects of Computer Science. Theory Comput. Syst. 63 (5) (2019)
Erich Grädel, Phokion G. Kolaitis, Juha Kontinen, Heribert Vollmer
Logics for Dependence and Independence (Dagstuhl Seminar 19031). Dagstuhl Reports 9 (1) (2019)
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
A complexity theory for hard enumeration problems. Discret. Appl. Math. 268 (2019)
Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang
Counting of Teams in First-Order Team Logics. CoRR (2019)
Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang
Counting of Teams in First-Order Team Logics. MFCS (2019)
Arnaud Durand, Anselm Haak, Heribert Vollmer
Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. LICS (2018)
Christoph Dürr, Heribert Vollmer
Preface of STACS 2016 Special Issue. Theory Comput. Syst. 62 (1) (2018)
Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer
Complexity of Propositional Logics in Team Semantic. ACM Trans. Comput. Log. 19 (1) (2018)
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
On the Complexity of Hard Enumeration Problems. LATA (2017)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
Modal independence logic. J. Log. Comput. 27 (5) (2017)
Arnaud Durand, Anselm Haak, Heribert Vollmer
Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth. CoRR (2017)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60 (4) (2017)
Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
Functions. CoRR (2016)
Anselm Haak, Heribert Vollmer
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. CoRR (2016)
Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer
SAT and Interactions (Dagstuhl Seminar 16381). Dagstuhl Reports 6 (9) (2016)
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
On the Complexity of Hard Enumeration Problems. CoRR (2016)
Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
Functions. CSL (2016)
Anselm Haak, Heribert Vollmer
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. WoLLIC (2016)
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR (2015)
Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer
Circuits, Logic and Games (Dagstuhl Seminar 15401). Dagstuhl Reports 5 (9) (2015)
Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer
Dependence Logic with a Majority Quantifier. J. Log. Lang. Inf. 24 (3) (2015)
Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 54 (5-6) (2015)
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
Modal Inclusion Logic: Being Lax is Simpler than Being Strict. MFCS (1) (2015)
Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer
Complexity of Propositional Independence and Inclusion Logic. CoRR (2015)
Erich Grädel, Juha Kontinen, Jouko Väänänen, Heribert Vollmer
Logics for Dependence and Independence (Dagstuhl Seminar 15261). Dagstuhl Reports 5 (6) (2015)
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
. Int. J. Found. Comput. Sci. 26 (8) (2015)
Nadia Creignou, Heribert Vollmer
Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. Fundam. Informaticae 136 (4) (2015)
Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer
Complexity of Propositional Independence and Inclusion Logic. MFCS (1) (2015)
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
Parameterized Enumeration for Modification Problems. LATA (2015)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
A Van Benthem Theorem for Modal Team Semantics. CSL (2015)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
A Van Benthem Theorem for Modal Team Semantics. CoRR (2014)
Markus Aschinger, Conrad Drescher, Georg Gottlob, Heribert Vollmer
LoCo - A Logic for Configuration Problems. ACM Trans. Comput. Log. 15 (3) (2014)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
Modal Independence Logic. CoRR (2014)
Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller, Heribert Vollmer
A Fragment of Dependence Logic Capturing Polynomial Time Log. Methods Comput. Sci. 10 (3) (2014)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
Modal Independence Logic. Advances in Modal Logic (2014)
Julian-Steffen Müller, Heribert Vollmer
Model Checking for Modal Dependence Logic: An Approach through Post's Lattice. WoLLIC (2013)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. MFCS (2013)
Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer
Extended Modal Dependence Logic. WoLLIC (2013)
Peter Lohmann, Heribert Vollmer
Complexity Results for Modal Dependence Logic. Stud Logica 101 (2) (2013)
Samson Abramsky, Juha Kontinen, Jouko A. Väänänen, Heribert Vollmer
Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071). Dagstuhl Reports 3 (2) (2013)
Julian-Steffen Müller, Heribert Vollmer
Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice CoRR (2013)
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
Parameterized Enumeration with Ordering. CoRR (2013)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. CoRR (2013)
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying proofs in constant depth. ACM Trans. Comput. Theory 5 (1) (2013)
Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer
Complexity of Model Checking for Logics over Kripke models. Bull. EATCS 108 (2012)
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA (2012)
Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer
SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2 (11) (2012)
Nadia Creignou, Heribert Vollmer
Parameterized Complexity of Weighted Satisfiability Problems. SAT (2012)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The complexity of reasoning for fragments of default logic. J. Log. Comput. 22 (3) (2012)
Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas
The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13 (2) (2012)
Markus Aschinger, Conrad Drescher, Heribert Vollmer
LoCo - A Logic for Configuration Problems. ECAI (2012)
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying Proofs in Constant Depth. Electron. Colloquium Comput. Complex. 19 (2012)
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
and L. Theor. Comput. Sci. 417 (2012)
Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying Proofs in Constant Depth. MFCS (2011)
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the Parameterized Complexity of Default Logic and Autoepistemic Logic CoRR (2011)
Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer
Dependence logic with a majority quantifier. FSTTCS (2011)
Peter Lohmann, Heribert Vollmer
Complexity Results for Modal Dependence Logic CoRR (2011)
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)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof complexity of propositional default logic. Arch. Math. Log. 50 (7-8) (2011)
Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer
Dependence logic with a majority quantifier CoRR (2011)
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Trans. Comput. Log. 12 (2) (2011)
Michael Thomas, Heribert Vollmer
Complexity of non-monotonic logics. Bull. EATCS 102 (2010)
Juha Kontinen, Heribert Vollmer
On Second-Order Monadic Monoidal and Groupoidal Quantifiers Log. Methods Comput. Sci. 6 (3) (2010)
Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
10061 Executive Summary - Circuits, Logic, and Games. Circuits, Logic, and Games (2010)
Pierre McKenzie, Michael Thomas, Heribert Vollmer
Extensional Uniformity for Boolean Circuits. SIAM J. Comput. 39 (7) (2010)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games (2010)
Peter Lohmann, Heribert Vollmer
Complexity Results for Modal Dependence Logic. CSL (2010)
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
and L. Electron. Colloquium Comput. Complex. 17 (2010)
Peter Lohmann, Heribert Vollmer
Complexity Results for Modal Dependence Logic. Circuits, Logic, and Games (2010)
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. 47 (2) (2010)
Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
10061 Abstracts Collection - Circuits, Logic, and Games. Circuits, Logic, and Games (2010)
Michael Thomas, Heribert Vollmer
Complexity of Non-Monotonic Logics CoRR (2010)
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games (2010)
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Autoepistemic Logic CoRR (2010)
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
and L. MFCS (2010)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof Complexity of Propositional Default Logic. SAT (2010)
Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer
Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems Log. Methods Comput. Sci. 8 (3) (2010)
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) (2009)
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 75 (4) (2009)
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. Electron. Notes Theor. Comput. Sci. 231 (2009)
Heribert Vollmer
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis. Theory Comput. Syst. 44 (1) (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Default Logic. SAT (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The complexity of propositional implication. Inf. Process. Lett. 109 (18) (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider
Model Checking CTL is Almost Always Inherently Sequential. TIME (2009)
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Complexity of Generalized Satisfiability for Linear Temporal Logic Log. Methods Comput. Sci. 5 (1) (2009)
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments CoRR (2008)
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Electron. Colloquium Comput. Complex. 15 (028) (2008)
Pierre McKenzie, Michael Thomas, Heribert Vollmer
Extensional Uniformity for Boolean Circuits CoRR (2008)

Heribert Vollmer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Heribert Vollmer