Stefan Mengel

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