Stefan Mengel

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 66

Top Venues

University of Paderborn (PHD)

Education History

University of Paderborn

PHD

Publications

Lorenzo Loconte, Aleksanteri M. Sladek, Stefan Mengel, Martin Trapp, Arno Solin, Nicolas Gillis, Antonio Vergari
Subtractive Mixture Models via Squaring: Representation and Learning. ICLR (2024)
Hubie Chen, Stefan Mengel
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. ICDT (2024)
Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel
Skyline Operators for Document Spanners. ICDT (2024)
Pablo Barceló, Pierre Bourhis, Stefan Mengel, Sudeepa Roy
Representation, Provenance, and Explanations in Database Theory and Logic (Dagstuhl Seminar 24032). Dagstuhl Reports 14 (1) (2024)
Christoph Berkholz, Stefan Mengel, Hermann Wilhelm
A Characterization of Efficiently Compilable Constraint Languages. STACS (2024)
Lorenzo Loconte, Aleksanteri M. Sladek, Stefan Mengel, Martin Trapp, Arno Solin, Nicolas Gillis, Antonio Vergari
Subtractive Mixture Models via Squaring: Representation and Learning. CoRR (2023)
Stefan Mengel
Bounds on BDD-Based Bucket Elimination. CoRR (2023)
Christoph Berkholz, Stefan Mengel, Hermann Wilhelm
A characterization of efficiently compilable constraint languages. CoRR (2023)
Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel
Skyline Operators for Document Spanners. CoRR (2023)
Alexis de Colnet, Stefan Mengel
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. J. Artif. Intell. Res. 76 (2023)
Stefan Mengel
Bounds on BDD-Based Bucket Elimination. SAT (2023)
Hubie Chen, Gianluigi Greco, Stefan Mengel, Francesco Scarcello
Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability. CoRR (2023)
Stefan Mengel
No Efficient Disjunction or Conjunction of Switch-Lists. J. Satisf. Boolean Model. Comput. 13 (1) (2022)
Alexis de Colnet, Stefan Mengel
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation. AAAI (2022)
Karl Bringmann, Nofar Carmeli, Stefan Mengel
Tight Fine-Grained Bounds for Direct Access on Join Queries. PODS (2022)
Stefan Mengel
Changing Partitions in Rectangle Decision Lists. SAT (2022)
Stefan Mengel
No Efficient Disjunction or Conjunction of Switch-Lists. CoRR (2022)
Karl Bringmann, Nofar Carmeli, Stefan Mengel
Tight Fine-Grained Bounds for Direct Access on Join Queries. CoRR (2022)
Alexis de Colnet, Stefan Mengel
Characterizing Tseitin-formulas with short regular resolution refutations. CoRR (2021)
Stefan Mengel
A short note on the counting complexity of conjunctive queries. CoRR (2021)
Stefan Mengel, Sebastian Skritek
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. Theory Comput. Syst. 65 (1) (2021)
Stefan Mengel, Friedrich Slivovsky
Proof Complexity of Symbolic QBF Reasoning. SAT (2021)
Alexis de Colnet, Stefan Mengel
A Compilation of Succinctness Results for Arithmetic Circuits. KR (2021)
Stefan Mengel, Friedrich Slivovsky
Proof Complexity of Symbolic QBF Reasoning. CoRR (2021)
Alexis de Colnet, Stefan Mengel
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. SAT (2021)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. ACM Trans. Database Syst. 46 (1) (2021)
Alexis de Colnet, Stefan Mengel
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation. CoRR (2021)
Alexis de Colnet, Stefan Mengel
A Compilation of Succinctness Results for Arithmetic Circuits. CoRR (2021)
Romain Wallon, Stefan Mengel
Revisiting Graph Width Measures for CNF-Encodings. J. Artif. Intell. Res. 67 (2020)
Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon
On Irrelevant Literals in Pseudo-Boolean Constraint Learning. CoRR (2020)
Alexis de Colnet, Stefan Mengel
Lower Bounds for Approximate Knowledge Compilation. CoRR (2020)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. SIGMOD Rec. 49 (1) (2020)
Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon
On Irrelevant Literals in Pseudo-Boolean Constraint Learning. IJCAI (2020)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR (2020)
Alexis de Colnet, Stefan Mengel
Lower Bounds for Approximate Knowledge Compilation. IJCAI (2020)
Florent Capelli, Stefan Mengel
Tractable QBF by Knowledge Compilation. STACS (2019)
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
Minimal Distance of Propositional Models. Theory Comput. Syst. 63 (6) (2019)
Stefan Mengel, Sebastian Skritek
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. ICDT (2019)
Stefan Mengel, Romain Wallon
Revisiting Graph Width Measures for CNF-Encodings. SAT (2019)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. ICDT (2019)
Stefan Mengel, Romain Wallon
Revisiting Graph Width Measures for CNF-Encodings. CoRR (2019)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. PODS (2019)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. CoRR (2018)
Stefan Mengel
Lower bounds on the mim-width of some graph classes. Discret. Appl. Math. 248 (2018)
Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon
Pseudo-Boolean Constraints from a Knowledge Representation Perspective. IJCAI (2018)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR (2018)
Michael Lampis, Stefan Mengel, Valia Mitsou
QBF as an Alternative to Courcelle's Theorem. CoRR (2018)
Florent Capelli, Stefan Mengel
Knowledge Compilation, Width and Quantification. CoRR (2018)
Michael Lampis, Stefan Mengel, Valia Mitsou
QBF as an Alternative to Courcelle's Theorem. SAT (2018)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel
Enumeration on Trees under Relabelings. ICDT (2018)
Christian Ikenmeyer, Stefan Mengel
On the relative power of reduction notions in arithmetic circuit complexity. Inf. Process. Lett. 130 (2018)
Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel
A Circuit-Based Approach to Efficient Enumeration. CoRR (2017)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel
Enumeration on Trees under Relabelings. CoRR (2017)
Stefan Mengel, Sebastian Skritek
On tractable query evaluation for SPARQL. CoRR (2017)
Hubie Chen, Stefan Mengel
The logic of counting query answers. LICS (2017)
Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel
A Circuit-Based Approach to Efficient Enumeration. ICALP (2017)
Christian Ikenmeyer, Stefan Mengel
On the relative power of reduction notions in arithmetic circuit complexity. CoRR (2016)
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
The Next Whisky Bar. CSR (2016)
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
As Close as It Gets. WALCOM (2016)
Florent Capelli, Arnaud Durand, Stefan Mengel
The Arithmetic Complexity of Tensor Contraction. Theory Comput. Syst. 58 (4) (2016)
Stefan Mengel
Parameterized Compilation Lower Bounds for Restricted CNF-formulas. CoRR (2016)
Hubie Chen, Stefan Mengel
Counting Answers to Existential Positive Queries: A Complexity Classification. CoRR (2016)
Stefan Mengel
Parameterized Compilation Lower Bounds for Restricted CNF-Formulas. SAT (2016)
Stefan Mengel
Lower Bounds on the mim-width of Some Perfect Graph Classes. CoRR (2016)
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
Knowledge Compilation Meets Communication Complexity. IJCAI (2016)
Hubie Chen, Stefan Mengel
Counting Answers to Existential Positive Queries: A Complexity Classification. PODS (2016)
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
Give Me Another One! ISAAC (2015)
Hubie Chen, Stefan Mengel
The Logic of Counting Query Answers: A Study via Existential Positive Queries. CoRR (2015)
Hubie Chen, Stefan Mengel
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. ICDT (2015)
Johann Brault-Baron, Florent Capelli, Stefan Mengel
Understanding Model Counting for beta-acyclic CNF-formulas. STACS (2015)
Arnaud Durand, Stefan Mengel
Structural Tractability of Counting of Solutions to Conjunctive Queries. Theory Comput. Syst. 57 (4) (2015)
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
On Compiling CNFs into Structured Deterministic DNNFs. SAT (2015)
Hervé Fournier, Guillaume Malod, Stefan Mengel
Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. Comput. Complex. 24 (1) (2015)
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
Minimal Distance of Propositional Models. CoRR (2015)
Hubie Chen, Stefan Mengel
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. CoRR (2014)
Florent Capelli, Arnaud Durand, Stefan Mengel
Hypergraph Acyclicity and Propositional Model Counting. SAT (2014)
Arnaud Durand, Stefan Mengel
The complexity of weighted counting for acyclic conjunctive queries. J. Comput. Syst. Sci. 80 (1) (2014)
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
Expander CNFs have Exponential DNNF Size. CoRR (2014)
Johann Brault-Baron, Florent Capelli, Stefan Mengel
Understanding model counting for $β$-acyclic CNF-formulas. CoRR (2014)
Florent Capelli, Arnaud Durand, Stefan Mengel
Hypergraph Acyclicity and Propositional Model Counting. CoRR (2014)
Arnaud Durand, Stefan Mengel
Structural Tractability of Counting of Solutions to Conjunctive Queries CoRR (2013)
Florent Capelli, Arnaud Durand, Stefan Mengel
The arithmetic complexity of tensor contractions. STACS (2013)
Arnaud Durand, Stefan Mengel
Structural tractability of counting of solutions to conjunctive queries. ICDT (2013)
Stefan Mengel
Arithmetic Branching Programs with Memory. MFCS (2013)
Stefan Mengel
Arithmetic Branching Programs with Memory CoRR (2013)
Florent Capelli, Arnaud Durand, Stefan Mengel
The arithmetic complexity of tensor contractions CoRR (2012)
Hervé Fournier, Guillaume Malod, Stefan Mengel
Monomials in arithmetic circuits: Complete problems in the counting hierarchy. STACS (2012)
Arnaud Durand, Stefan Mengel
On Polynomials Defined by Acyclic Conjunctive Queries and Weighted Counting Problems CoRR (2011)
Hervé Fournier, Guillaume Malod, Stefan Mengel
Monomials in arithmetic circuits: Complete problems in the counting hierarchy CoRR (2011)
Stefan Mengel
Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems - (Extended Abstract). ICALP (1) (2011)

Stefan Mengel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stefan Mengel