| 2026 | CSL | Analysis of Logics with Arithmetic. | Michael Benedikt, Chia-Hsuan Lu, Tony Tan |
| 2026 | TACAS | Robustness Verification of Graph Neural Networks Via Lightweight Satisfiability Testing. | Chia-Hsuan Lu, Tony Tan, Michael Benedikt |
| 2025 | LICS | Convergence Laws for Extensions of First-Order Logic with Averaging. | Sam Adam-Day, Michael Benedikt, Alberto Larrauri |
| 2025 | VLDB | Constraint-aware Learning of Probabilistic Sequential Models for Multi-Label Classification. | Mykhailo Buleshnyi, Anna Polova, Zsolt Zombori, Michael Benedikt |
| 2024 | ICALP | Decidability of Graph Neural Networks via Logical Characterizations. | Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan |
| 2024 | KR | Monotone Rewritability and the Analysis of Queries, Views, and Rules. | Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja |
| 2023 | ICALP | The Complexity of Presburger Arithmetic with Power or Powers. | Michael Benedikt, Dmitry Chistikov, Alessio Mansutti |
| 2023 | LICS | Embedded Finite Models beyond Restricted Quantifier Collapse. | Michael Benedikt, Ehud Hrushovski |
| 2023 | PODS | Synthesizing Nested Relational Queries from Implicit Specifications. | Michael Benedikt, Ccilia Pradic, Christoph Wernhard |
| 2022 | PODS | 2022 ACM PODS Alberto O. Mendelzon Test-of-Time Award. | Michael Bender, Michael Benedikt, Sudeepa Roy |
| 2020 | ICALP | Two Variable Logic with Ultimately Periodic Counting. | Michael Benedikt, Egor V. Kostylev, Tony Tan |
| 2020 | KR | Balancing Expressiveness and Inexpressiveness in View Design. | Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura |
| 2020 | PODS | On Monotonic Determinacy and Rewritability for Recursive Queries and Views. | Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero |
| 2019 | IJCAI | Reasoning about Disclosure in Data Integration in the Presence of Source Constraints. | Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michal Thomazo |
| 2018 | AAAI | Goal-Driven Query Answering for Existential Rules With Equality. | Michael Benedikt, Boris Motik, Efthymia Tsamoura |
| 2018 | ICWE | Form Filling Based on Constraint Solving. | Ben Spencer, Michael Benedikt, Pierre Senellart |
| 2018 | PODS | When Can We Answer Queries Using Result-Bounded Data Interfaces? | Antoine Amarilli, Michael Benedikt |
| 2018 | PODS | How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)? | Michael Benedikt |
| 2017 | AAAI | Source Information Disclosure in Ontology-Based Data Integration. | Michael Benedikt, Bernardo Cuenca Grau, Egor V. Kostylev |
| 2017 | ICALP | Characterizing Definability in Decidable Fixpoint Logics. | Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
| 2017 | IJCAI | Reformulating Queries: Theory and Practice. | Michael Benedikt, Egor V. Kostylev, Fabio Mogavero, Efthymia Tsamoura |
| 2017 | ISSTA | ArtForm: a tool for exploring the codebase of form-based websites. | Ben Spencer, Michael Benedikt, Anders Mller, Franck van Breugel |
| 2017 | LICS | Polynomial automata: Zeroness and applications. | Michael Benedikt, Timothy Duff, Aditya Sharad, James Worrell |
| 2017 | PODS | Benchmarking the Chase. | Michael Benedikt, George Konstantinidis, Giansalvatore Mecca, Boris Motik, Paolo Papotti, Donatello Santoro, Efthymia Tsamoura |
| 2016 | IJCAI | Query Answering with Transitive and Linear-Ordered Data. | Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
| 2016 | IJCAI | Biological Web Services: Integration, Optimization, and Reasoning. | Michael Benedikt, Rodrigo Lopez-Serrano, Efthymia Tsamoura |
| 2016 | LICS | A Step Up in Expressiveness of Decidable Fixpoint Logics. | Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
| 2016 | LICS | Querying Visible and Invisible Information. | Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis |
| 2015 | IJCAI | Combining Existential Rules and Description Logics. | Antoine Amarilli, Michael Benedikt |
| 2015 | LICS | Finite Open-World Query Answering with Number Restrictions. | Antoine Amarilli, Michael Benedikt |
| 2015 | LICS | Interpolation with Decidable Fixpoint Logics. | Michael Benedikt, Balder ten Cate, Michael Vanden Boom |
| 2015 | LICS | The Complexity of Boundedness for Guarded Logics. | Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom |
| 2014 | CSL | Effective interpolation and preservation in guarded logics. | Michael Benedikt, Balder ten Cate, Michael Vanden Boom |
| 2014 | ICDT | The ICDT 2014 Test of Time Award. | Michael Benedikt, Ronald Fagin, Wim Martens |
| 2014 | PODS | Generating low-cost plans from proofs. | Michael Benedikt, Balder ten Cate, Efthymia Tsamoura |
| 2013 | ICALP | Complexity of Two-Variable Logic on Finite Trees. | Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell |
| 2013 | ICDT | Access patterns and integrity constraints revisited. | Vince Brny, Michael Benedikt, Pierre Bourhis |
| 2013 | LICS | Bisimilarity of Pushdown Automata is Nonelementary. | Michael Benedikt, Stefan Gller, Stefan Kiefer, Andrzej S. Murawski |
| 2013 | MFCS | Rewriting Guarded Negation Queries. | Vince Brny, Michael Benedikt, Balder ten Cate |
| 2013 | MFCS | Determinacy and Rewriting of Top-Down and MSO Tree Transformations. | Michael Benedikt, Joost Engelfriet, Sebastian Maneth |
| 2013 | PODS | The ACM PODS Alberto O. Mendelzon test-of-time award 2013. | Michael Benedikt, Tova Milo, Dirk Van Gucht |
| 2013 | TACAS | LTL Model Checking of Interval Markov Chains. | Michael Benedikt, Rastislav Lenhardt, James Worrell |
| 2012 | EDBT | QUASAR: querying annotation, structure, and reasoning. | Luying Chen, Michael Benedikt, Evgeny Kharlamov |
| 2012 | ICALP | Monadic Datalog Containment. | Michael Benedikt, Pierre Bourhis, Pierre Senellart |
| 2012 | WWW | ProFoUnd: program-analysis-based form understanding. | Michael Benedikt, Tim Furche, Andreas Savvides, Pierre Senellart |
| 2011 | CONCUR | Two Variable vs. Linear Temporal Logic in Model Checking and Games. | Michael Benedikt, Rastislav Lenhardt, James Worrell |
| 2011 | ICALP | The Cost of Traveling between Languages. | Michael Benedikt, Gabriele Puppis, Cristian Riveros |
| 2011 | ICDT | Complexity of higher-order queries. | Huy Vu, Michael Benedikt |
| 2011 | LICS | Regular Repair of Specifications. | Michael Benedikt, Gabriele Puppis, Cristian Riveros |
| 2011 | PODS | Determining relevance of accesses at runtime. | Michael Benedikt, Georg Gottlob, Pierre Senellart |
| 2010 | CSL | Automata vs. Logics on Data Words. | Michael Benedikt, Clemens Ley, Gabriele Puppis |
| 2010 | PODS | Positive higher-order queries. | Michael Benedikt, Gabriele Puppis, Huy Vu |
| 2009 | ICDT | How big must complete XML query languages be? | Clemens Ley, Michael Benedikt |
| 2008 | SIGMOD | Stream firewalling of xml constraints. | Michael Benedikt, Alan Jeffrey, Ruy Ley-Wild |
| 2006 | ICALP | Interpreting Tree-to-Tree Queries. | Michael Benedikt, Christoph Koch |
| 2005 | CAV | Verification of Tree Updates for Optimization. | Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas |
| 2005 | CSL | Towards a Characterization of Order-Invariant Queries over Tame Structures. | Michael Benedikt, Luc Segoufin |
| 2005 | LICS | An Insider's Guide to Logic in Telecommunications Data. | Michael Benedikt |
| 2005 | PODS | XPath satisfiability in the presence of DTDs. | Michael Benedikt, Wenfei Fan, Floris Geerts |
| 2005 | STACS | Regular Tree Languages Definable in FO. | Michael Benedikt, Luc Segoufin |
| 2004 | PODS | A Characterization of First-Order Topological Properties of Planar Spatial Data. | Michael Benedikt, Christof Lding, Jan Van den Bussche, Thomas Wilke |
| 2003 | ICDT | Structural Properties of XPath Fragments. | Michael Benedikt, Wenfei Fan, Gabriel M. Kuper |
| 2003 | PODS | E-services: a look behind the curtain. | Richard Hull, Michael Benedikt, Vassilis Christophides, Jianwen Su |
| 2003 | SIGMOD | Capturing both Types and Constraints in Data Integration. | Michael Benedikt, Chee Yong Chan, Wenfei Fan, Juliana Freire, Rajeev Rastogi |
| 2002 | LICS | Tree Extension Algebras: Logics, Automata, and Query Languages. | Michael Benedikt, Leonid Libkin |
| 2002 | VLDB | DTD-Directed Publishing with Attribute Translation Grammars. | Michael Benedikt, Chee Yong Chan, Wenfei Fan, Rajeev Rastogi, Shihui Zheng, Aoying Zhou |
| 2001 | ICALP | Model Checking of Unrestricted Hierarchical State Machines. | Michael Benedikt, Patrice Godefroid, Thomas W. Reps |
| 2001 | LICS | A Model-Theoretic Approach to Regular String Relations. | Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin |
| 2001 | PODS | String Operations in Query Languages. | Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin |
| 2000 | CSL | Definability over Linear Constraints. | Michael Benedikt, H. Jerome Keisler |
| 2000 | PODS | Reachability and Connectivity Queries in Constraint Databases. | Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin |
| 1999 | ESOP | A Decidable Logic for Describing Linked Data Structures. | Michael Benedikt, Thomas W. Reps, Shmuel Sagiv |
| 1999 | PODS | Exact and Approximate Aggregation in Constraint Query. | Michael Benedikt, Leonid Libkin |
| 1998 | LICS | Embedded Finite Models, Stability Theory and the Impact of Order. | John T. Baldwin, Michael Benedikt |
| 1998 | PODS | Safe Constraint Queries. | Michael Benedikt, Leonid Libkin |
| 1997 | ICDT | Expressive Power of Unary Counters. | Michael Benedikt, H. Jerome Keisler |
| 1997 | PODS | Languages for Relational Databases over Interpreted Structures. | Michael Benedikt, Leonid Libkin |
| 1996 | LICS | On the Structure of Queries in Constraint Query Languages. | Michael Benedikt, Leonid Libkin |
| 1996 | PODS | Relational Expressive Power of Constraint Query Languages. | Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong |
| 1996 | PODS | Verifiable Properties of Database Transactions. | Michael Benedikt, Timothy Griffin, Leonid Libkin |