Publications

Articles de revues internationales

2023 Contraintes Alexis de Colnet, Stefan Mengel, Characterizing Tseitin-Formulas with Short Regular Resolution Refutations in Journal of Artificial Intelligence Research,vol. 76, pp. 265-286, 2023.

2022 Contraintes Stefan Mengel, No Efficient Disjunction or Conjunction of Switch-Lists in Journal on Satisfiability, Boolean Modeling and Computation,vol. 13, n° 1, pp. 1-4, 2022.

2021 Contraintes Stefan Mengel, Antoine Amarilli, Pierre Bourhis, Matthias Niewerth, Constant-Delay Enumeration for Nondeterministic Document Spanners in ACM Transactions on Database Systems,vol. 46, n° 1, pp. 1-30, 2021.

2021 Contraintes Stefan Mengel, Sebastian Skritek, Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection in Theory of Computing Systems,vol. 65, n° 1, pp. 3-41, 2021.

2020 Contraintes Stefan Mengel, Romain Wallon, Graph Width Measures for CNF-Encodings with Auxiliary Variables in Journal of Artificial Intelligence Research,vol. 67, pp. 409-436, 2020.

2020 Données Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth, Constant-Delay Enumeration for Nondeterministic Document Spanners in SIGMOD record,vol. 49, n° 1, pp. 25-32, 2020.

2019 Contraintes Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer, Minimal Distance of Propositional Models in Theory of Computing Systems,vol. 63, n° 6, pp. 1131-1184, 2019.

2018 Contraintes Stefan Mengel, Lower bounds on the mim-width of some graph classes in Discrete Applied Mathematics,vol. 248, pp. 28-32, 2018.

2018 Contraintes Christian Ikenmeyer, Stefan Mengel, On the relative power of reduction notions in arithmetic circuit complexity in Information Processing Letters,vol. 130, pp. 7-10, 2018.

2016 Florent Capelli, Arnaud Durand, Stefan Mengel, The Arithmetic Complexity of Tensor Contraction in Theory of Computing Systems,vol. 58, n° 4, pp. 506 - 527, 2016.

Articles de conférences internationales

2023 Contraintes Stefan Mengel, Bounds on BDD-Based Bucket Elimination in 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023,Schloss Dagstuhl - Leibniz-Zentrum für Informatik, vol. 271, pp. 16:1--16:11, 2023.

2022 Contraintes Stefan Mengel, Alexis de Colnet, Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation in Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022,vol. 36, pp. 5564-5572, 2022.

2022 Données Karl Bringmann, Nofar Carmeli, Stefan Mengel, Tight Fine-Grained Bounds for Direct Access on Join Queries in SIGMOD/PODS '22: International Conference on Management of Data,ACM, pp. 427-436, 2022.

2022 Contraintes Stefan Mengel, Changing Partitions in Rectangle Decision Lists in 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022),vol. 236, pp. 17:1--17:20, 2022.

2021 Contraintes Alexis de Colnet, Stefan Mengel, A Compilation of Succinctness Results for Arithmetic Circuits in 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021,2021.

2021 Contraintes Stefan Mengel, Alexis de Colnet, Characterizing Tseitin-Formulas with Short Regular Resolution Refutations in 24th International Conference Theory and Applications of Satisfiability Testing - SAT 2021,Springer International Publishing, vol. 12831, pp. 116-133, 2021.

2021 Contraintes Stefan Mengel, Friedrich Slivovsky, Proof Complexity of Symbolic QBF Reasoning in 24th International Conference Theory and Applications of Satisfiability Testing (SAT 2021),Springer International Publishing, vol. 12831, pp. 399-416, 2021.

2020 Contraintes Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon, On Irrelevant Literals in Pseudo-Boolean Constraint Learning in 29th International Joint Conference on Artificial Intelligence (IJCAI'20),International Joint Conferences on Artificial Intelligence Organization, pp. 1148-1154, 2020.

2020 Contraintes Alexis de Colnet, Stefan Mengel, Lower Bounds for Approximate Knowledge Compilation in Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20},International Joint Conferences on Artificial Intelligence Organization, pp. 1834-1840, 2020.

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

2019 Contraintes Florent Capelli, Stefan Mengel, Tractable QBF by Knowledge Compilation in 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019),2019.

2019 Contraintes Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth, Enumeration on Trees with Tractable Combined Complexity and Efficient Updates in PODS,ACM Press, pp. 89-103, 2019.

2019 Données Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth, Constant-Delay Enumeration for Nondeterministic Document Spanners in ICDT,2019.

2019 Données Stefan Mengel, Sebastian Skritek, Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection in International Conference on Database Theory,2019.

2018 Contraintes 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),International Joint Conferences on Artificial Intelligence Organization, pp. 1891-1897, 2018.

2018 Données Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Enumeration on Trees under Relabelings in 21st International Conference on Database Theory,ICDT 2018,2018.

2018 Contraintes 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 2018,pp. 235-252, 2018.

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, 2017.

2017 Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel, A Circuit-Based Approach to Efficient Enumeration in ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming,pp. 1-15, 2017.

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, 2016.

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, 2016.

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, 2016.

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, 2016.

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, 2016.

Articles de conférences nationales

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, 2019.

Articles de workshops internationaux

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),2019.

Rapports techniques

2023 Hélène Fargier, Stefan Mengel, Jérôme Mengin, An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages 2023.