Publications

International journals

2020 Stefan Mengel, Romain Wallon, Graph Width Measures for CNF-Encodings with Auxiliary Variables in Journal of Artificial Intelligence Research (JAIR),vol. 67, pp. 409-436, mars 2020. [Download]

2019 Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer, Minimal Distance of Propositional Models in Theory of Computing Systems (TOCS),vol. 63, Springer, pp. 1131–1184, août 2019.

2016 Florent Capelli, Arnaud Durand, Stefan Mengel, The Arithmetic Complexity of Tensor Contraction in Theory of Computing Systems (TOCS),vol. 58, n° 4, Springer, pp. 506-527, mai 2016. [Download]

International conferences

2020 Alexis de Colnet, Stefan Mengel, Lower Bounds for Approximate Knowledge Compilation. in 29th International Joint Conference in Artificial Intelligence (IJCAI’20),pp. 1834-1840, juillet 2020.

2020 Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon, On Irrelevant Literals in Pseudo-Boolean Constraint Learning in 29th International Joint Conference in Artificial Intelligence (IJCAI’20),pp. 1148-1154, juillet 2020. [Download]

2019 Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth, Enumeration on Trees with Tractable Combined Complexity and Efficient Updates in {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems (PODS),ACM, pp. 89–103, juin 2019.

2019 Florent Capelli, Stefan Mengel, Tractable QBF by Knowledge Compilation in International Symposium on Theoretical Aspects of Computer Science (STACS),Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 18:1–18:16, 2019.

2019 Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth, Constant-Delay Enumeration for Nondeterministic Document Spanners in 22nd International Conference on Database Theory (ICDT’19),Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 22:1–22:19, 2019.

2019 Stefan Mengel, Romain Wallon, Revisiting Graph Width Measures for CNF-Encodings in 22nd International Conference on Theory and Applications of Satisfiability Testing (SAT’19),Springer, pp. 222-238, juillet 2019. [Download]

2019 Stefan Mengel, Sebastian Skritek, Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection in 22nd International Conference on Database Theory (ICDT’19),Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 20:1-20:18, 2019.

2018 Michael Lampis, Stefan Mengel, Valia Mitsou, QBF as an Alternative to Courcelle’s Theorem in 21st International Conference on Theory and Applications of Satisfiability Testing (SAT’18),Springer, juillet 2018.

2018 Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Enumeration on Trees under Relabelings in 21st International Conference on Database Theory (ICDT’18),Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 5:1-5:18, mars 2018. [Download]

2018 Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon, Pseudo-Boolean Constraints from a Knowledge Representation Perspective in 27th International Joint Conference on Artificial Intelligence (IJCAI’18),pp. 1891-1897, juillet 2018. [Download]

2017 Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel, A Circuit-Based Approach to Efficient Enumeration in 44th International Colloquium on Automata, Languages, and Programming (ICALP’17),Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 111:1–111:15, juillet 2017. [Download]

2017 Hubie Chen, Stefan Mengel, The logic of counting query answers in 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’17),IEEE Computer Society, pp. 1-12, juin 2017. [Download]

2016 Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer, The Next Whisky Bar in 11th International Computer Science Symposium in Russia (CSR’16),Springer, pp. 41–56, juin 2016. [Download]

2016 Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky, Knowledge Compilation Meets Communication Complexity in 25th International Joint Conference on Artificial Intelligence (IJCAI’16),IJCAI/AAAI Press, pp. 1008–1014, juillet 2016. [Download]

2016 Hubie Chen, Stefan Mengel, Counting Answers to Existential Positive Queries: A Complexity Classification in 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS’16),ACM, pp. 315–326, juin 2016. [Download]

2016 Stefan Mengel, Parameterized Compilation Lower Bounds for Restricted CNF-Formulas in 19th International Conference on Theory and Applications of Satisfiability Testing (SAT’16),Springer, pp. 3–12, juillet 2016. [Download]

International workshops

2019 Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon, On Irrelevant Literals in Pseudo-Boolean Constraint Learning in 10th International Workshop on Pragmatics of SAT (POS’19),juillet 2019.

2016 Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer, As Close as It Gets in 10th International Workshop on Algorithms and Computation (WALCOM ‘16),Springer, pp. 222–235, mars 2016. [Download]

National journals

2018 Stefan Mengel, Lower bounds on the mim-width of some graph classes in Discrete Applied Mathematics (),Elsevier, pp. 28–32, octobre 2018.

2018 Christian Ikenmeyer, Stefan Mengel, On the relative power of reduction notions in arithmetic circuit complexity in Information Processing Letters (IPL),vol. 130, Elsevier, pp. 7–10, février 2018.

National conferences

2019 Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon, De la pertinence des littéraux dans les contraintes pseudo-booléennes apprises in 15es Journées Francophones de Programmation par Contraintes (JFPC’19),pp. 43–52, juin 2019. [Download]