Stefan Mengel
20 publications
7 venues
H Index 7
Affiliation
CNRS, CRIL, Lens, Francecole Polytechnique, LIX, Palaiseau, France
TU Berlin, Department of Mathematics, Germany
University of Paderborn, Institute of Mathematics, Germany
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Sum of Squares Circuits.
|
AAAI | 2025 | 0 |
| Learning Model Agnostic Explanations via Constraint Programming.
|
ECML/PKDD | 2024 | 2 |
| Subtractive Mixture Models via Squaring: Representation and Learning.
|
ICLR | 2024 | 0 |
| Bounds on BDD-Based Bucket Elimination.
|
SAT | 2023 | 2 |
| Characterizing Tseitin-Formulas with Short Regular Resolution Refutations.
|
JAIR | 2023 | 0 |
| Changing Partitions in Rectangle Decision Lists.
|
SAT | 2022 | 0 |
| Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation.
|
AAAI | 2022 | 0 |
| Proof Complexity of Symbolic QBF Reasoning.
|
SAT | 2021 | 2 |
| A Compilation of Succinctness Results for Arithmetic Circuits.
|
KR | 2021 | 19 |
| Characterizing Tseitin-Formulas with Short Regular Resolution Refutations.
|
SAT | 2021 | 7 |
| On Irrelevant Literals in Pseudo-Boolean Constraint Learning.
|
IJCAI | 2020 | 4 |
| Lower Bounds for Approximate Knowledge Compilation.
|
IJCAI | 2020 | 4 |
| Revisiting Graph Width Measures for CNF-Encodings.
|
JAIR | 2020 | 0 |
| Revisiting Graph Width Measures for CNF-Encodings.
|
SAT | 2019 | 5 |
| Pseudo-Boolean Constraints from a Knowledge Representation Perspective.
|
IJCAI | 2018 | 16 |
| QBF as an Alternative to Courcelle's Theorem.
|
SAT | 2018 | 19 |
| Knowledge Compilation Meets Communication Complexity.
|
IJCAI | 2016 | 50 |
| Parameterized Compilation Lower Bounds for Restricted CNF-Formulas.
|
SAT | 2016 | 7 |
| On Compiling CNFs into Structured Deterministic DNNFs.
|
SAT | 2015 | 26 |
| Hypergraph Acyclicity and Propositional Model Counting.
|
SAT | 2014 | 12 |