Michael Benedikt

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 76

Top Venues

CoRR

PODS

LICS

ACM Trans. Comput. Log.

Publications

Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja
Monotone Rewritability and the Analysis of Queries, Views, and Rules. CoRR (2024)
Michael Benedikt, Egor V. Kostylev, Tony Tan
Two Variable Logic with Ultimately Periodic Counting. SIAM J. Comput. 53 (4) (2024)
Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan
Decidability of Graph Neural Networks via Logical Characterizations. ICALP (2024)
Michael Benedikt, Anthony Widjaja Lin, Di-De Yen
Revisiting the Expressiveness Landscape of Data Graph Queries. CoRR (2024)
Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan
Decidability of Graph Neural Networks via Logical Characterizations. CoRR (2024)
Sam Adam-Day, Michael Benedikt, Ismail Ilkan Ceylan, Ben Finkelshtein
Graph neural network outputs are almost surely asymptotically constant. CoRR (2024)
Michael Benedikt, Cécilia Pradic, Christoph Wernhard
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory. Log. Methods Comput. Sci. 20 (3) (2024)
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
On Monotonic Determinacy and Rewritability for Recursive Queries and Views. ACM Trans. Comput. Log. 24 (2) (2023)
Michael Benedikt, Cécilia Pradic, Christoph Wernhard
Synthesizing Nested Relational Queries from Implicit Specifications. PODS (2023)
Michael Benedikt, Dmitry Chistikov, Alessio Mansutti
The complexity of Presburger arithmetic with power or powers. CoRR (2023)
Michael Benedikt, Ehud Hrushovski
Embedded Finite Models beyond Restricted Quantifier Collapse. LICS (2023)
Zsolt Zombori, Agapi Rissaki, Kristóf Szabó, Wolfgang Gatterbauer, Michael Benedikt
Towards Unbiased Exploration in Partial Label Learning. CoRR (2023)
Michael Benedikt, Dmitry Chistikov, Alessio Mansutti
The Complexity of Presburger Arithmetic with Power or Powers. ICALP (2023)
Michael Benedikt, Ehud Hrushovski
Embedded Finite Models beyond Restricted Quantifier Collapse. CoRR (2023)
Antoine Amarilli, Michael Benedikt
When Can We Answer Queries Using Result-Bounded Data Interfaces? Log. Methods Comput. Sci. 18 (2) (2022)
Michael Benedikt, Pierre Pradic, Christoph Wernhard
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory. CoRR (2022)
Michael Benedikt, Pierre Pradic, Christoph Wernhard
Synthesizing Nested Relational Queries from Implicit Specifications. CoRR (2022)
Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik
Rewriting the Infinite Chase. Proc. VLDB Endow. 15 (11) (2022)
Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik
Datalog Rewriting for Guarded TGDs. Datalog (2022)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. CoRR (2022)
Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik
Rewriting the Infinite Chase. CoRR (2022)
Antoine Amarilli, Michael Benedikt
Tighter bounds for query answering with Guarded TGDs. CoRR (2022)
Michael Bender, Michael Benedikt, Sudeepa Roy
2022 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS (2022)
Michael Benedikt, Fergus R. Cooper, Stefano Germano, Gabor Gyorkei, Efthymia Tsamoura, Brandon Moore, Camilo Ortiz
PDQ 2.0: Flexible Infrastructure for Integrating Reasoning and Query Planning. SIGMOD Rec. 51 (4) (2022)
Michael Benedikt
The Past and Future of Embedded Finite Model Theory. RP (2022)
Michael Benedikt, Pierre Pradic
Generating collection transformations from proofs. Proc. ACM Program. Lang. 5 (POPL) (2021)
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura
Balancing Expressiveness and Inexpressiveness in View Design. ACM Trans. Database Syst. 46 (4) (2021)
Jaclyn Smith, Michael Benedikt, Brandon Moore, Milos Nikolic
TraNCE: Transforming Nested Collections Efficiently. Proc. VLDB Endow. 14 (12) (2021)
Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis, Michael Vanden Boom
Inference from Visible Information and Background Knowledge. ACM Trans. Comput. Log. 22 (2) (2021)
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
On monotonic determinacy and rewritability for recursive queries and views. CoRR (2020)
Michael Benedikt, Egor V. Kostylev, Tony Tan
Two Variable Logic with Ultimately Periodic Counting. ICALP (2020)
Michael Benedikt, Pierre Bourhis, Georg Gottlob, Pierre Senellart
Monadic Datalog, Tree Validity, and Limited Access Containment. ACM Trans. Comput. Log. 21 (1) (2020)
Vince Bárány, Michael Benedikt, Balder ten Cate
Some Model Theory of Guarded Negation. CoRR (2020)
Michael Benedikt, Egor V. Kostylev, Tony Tan
Two variable logic with ultimately periodic counting. CoRR (2020)
Antoine Amarilli, Michael Benedikt
Finite Open-world Query Answering with Number Restrictions. ACM Trans. Comput. Log. 21 (4) (2020)
Jaclyn Smith, Michael Benedikt, Milos Nikolic, Amir Shaikhha
Scalable Querying of Nested Data. CoRR (2020)
Jaclyn Smith, Michael Benedikt, Milos Nikolic, Amir Shaikhha
Scalable Querying of Nested Data. Proc. VLDB Endow. 14 (3) (2020)
Michael Benedikt, Pierre Pradic
Generating collection queries from proofs. CoRR (2020)
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
On Monotonic Determinacy and Rewritability for Recursive Queries and Views. PODS (2020)
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura
Balancing expressiveness and inexpressiveness in view design. CoRR (2020)
Antoine Amarilli, Michael Benedikt
Finite Open-World Query Answering with Number Restrictions. CoRR (2020)
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura
Balancing Expressiveness and Inexpressiveness in View Design. KR (2020)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Definability and Interpolation within Decidable Fixpoint Logics. Log. Methods Comput. Sci. 15 (3) (2019)
Michael Benedikt
Guest Editorial: Special Issue on Database Theory. Theory Comput. Syst. 63 (7) (2019)
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo
Reasoning about Disclosure in Data Integration in the Presence of Source Constraints. IJCAI (2019)
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo
Reasoning about disclosure in data integration in the presence of source constraints. CoRR (2019)
Michael Benedikt, Kristian Kersting, Phokion G. Kolaitis, Daniel Neider
Logic and Learning (Dagstuhl Seminar 19361). Dagstuhl Reports 9 (9) (2019)
Michael Benedikt
Logic-based Perspectives on Query Reformulationover Restricted Interfaces. SIGMOD Rec. 47 (2) (2018)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. J. Artif. Intell. Res. 63 (2018)
Vince Bárány, Michael Benedikt, Balder ten Cate
Some Model Theory of Guarded Negation. J. Symb. Log. 83 (4) (2018)
Antoine Amarilli, Michael Benedikt
When Can We Answer Queries Using Result-Bounded Data Interfaces? CoRR (2018)
Ben Spencer, Michael Benedikt, Pierre Senellart
Form Filling Based on Constraint Solving. ICWE (2018)
Michael Benedikt
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)? PODS (2018)
Antoine Amarilli, Michael Benedikt
When Can We Answer Queries Using Result-Bounded Data Interfaces? PODS (2018)
Michael Benedikt, Bernardo Cuenca Grau, Egor V. Kostylev
Logical foundations of information disclosure in ontology-based data integration. Artif. Intell. 262 (2018)
Michael Benedikt, Boris Motik, Efthymia Tsamoura
Goal-Driven Query Answering for Existential Rules With Equality. AAAI (2018)
Michael Benedikt, George Konstantinidis, Giansalvatore Mecca, Boris Motik, Paolo Papotti, Donatello Santoro, Efthymia Tsamoura
Benchmarking the Chase. PODS (2017)
Michael Benedikt, Joost Engelfriet, Sebastian Maneth
Determinacy and rewriting of functional top-down and MSO tree transformations. J. Comput. Syst. Sci. 85 (2017)
Michael Benedikt, Bernardo Cuenca Grau, Egor V. Kostylev
Source Information Disclosure in Ontology-Based Data Integration. AAAI (2017)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Characterizing Definability in Decidable Fixpoint Logics. CoRR (2017)
Michael Benedikt, Boris Motik, Efthymia Tsamoura
Goal-Driven Query Answering for Existential Rules with Equality. CoRR (2017)
Antoine Amarilli, Michael Benedikt
When Can We Answer Queries Using Result-Bounded Data Interfaces? CoRR (2017)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Characterizing Definability in Decidable Fixpoint Logics. ICALP (2017)
Ben Spencer, Michael Benedikt, Anders Møller, Franck van Breugel
ArtForm: a tool for exploring the codebase of form-based websites. ISSTA (2017)
Michael Benedikt, Egor V. Kostylev, Fabio Mogavero, Efthymia Tsamoura
Reformulating Queries: Theory and Practice. IJCAI (2017)
Michael Benedikt, Timothy Duff, Aditya Sharad, James Worrell
Polynomial automata: Zeroness and applications. LICS (2017)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
A Step Up in Expressiveness of Decidable Fixpoint Logics. LICS (2016)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. IJCAI (2016)
Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis
Querying Visible and Invisible Information. LICS (2016)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. CoRR (2016)
Michael Benedikt, Clemens Ley
Limiting Until in Ordered Tree Query Languages. ACM Trans. Comput. Log. 17 (2) (2016)
Michael Benedikt, Rodrigo Lopez-Serrano, Efthymia Tsamoura
Biological Web Services: Integration, Optimization, and Reasoning. BAI@IJCAI (2016)
Michael Benedikt, Balder ten Cate, Michael Vanden Boom
Effective Interpolation and Preservation in Guarded Logics. ACM Trans. Comput. Log. 17 (2) (2016)
Gonzalo I. Diaz, Marcelo Arenas, Michael Benedikt
SPARQLByE: Querying RDF data by example. Proc. VLDB Endow. 9 (13) (2016)
Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
Complexity of Two-Variable Logic on Finite Trees. ACM Trans. Comput. Log. 17 (4) (2016)
Michael Benedikt, Balder ten Cate, Efthymia Tsamoura
Generating Plans from Proofs. ACM Trans. Database Syst. 40 (4) (2016)
Antoine Amarilli, Michael Benedikt
Finite Open-World Query Answering with Number Restrictions. LICS (2015)
Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom
The Complexity of Boundedness for Guarded Logics. LICS (2015)
Michael Benedikt, Pierre Bourhis, Clemens Ley
Analysis of Schemas with Access Restrictions. ACM Trans. Database Syst. 40 (1) (2015)
Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis
Querying Visible and Invisible Tables in the Presence of Integrity Constraints. CoRR (2015)
Antoine Amarilli, Michael Benedikt
Combining Existential Rules and Description Logics. IJCAI (2015)
Michael Benedikt, Julien Leblay, Efthymia Tsamoura
Querying with Access Patterns and Integrity Constraints. Proc. VLDB Endow. 8 (6) (2015)
Michael Benedikt, Gabriele Puppis, Huy Vu
The complexity of higher-order queries. Inf. Comput. 244 (2015)
Michael Benedikt, Balder ten Cate, Michael Vanden Boom
Interpolation with Decidable Fixpoint Logics. LICS (2015)
Antoine Amarilli, Michael Benedikt
Finite Open-World Query Answering with Number Restrictions (Extended Version). CoRR (2015)
Antoine Amarilli, Michael Benedikt
Combining Existential Rules and Description Logics (Extended Version). CoRR (2015)
Michael Benedikt, Julien Leblay, Efthymia Tsamoura
PDQ: Proof-driven Query Answering over Web-based Data. Proc. VLDB Endow. 7 (13) (2014)
Michael Benedikt, Ronald Fagin, Wim Martens
The ICDT 2014 Test of Time Award. ICDT (2014)
Michael Benedikt, Gabriele Puppis, Cristian Riveros
The per-character cost of repairing word languages. Theor. Comput. Sci. 539 (2014)
Michael Benedikt, Balder ten Cate, Michael Vanden Boom
Effective interpolation and preservation in guarded logics. CSL-LICS (2014)
Michael Benedikt, Carsten Lutz, Balder ten Cate
Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331). Dagstuhl Reports 4 (8) (2014)
Michael Benedikt, Balder ten Cate, Efthymia Tsamoura
Generating low-cost plans from proofs. PODS (2014)
Michael Benedikt, Rastislav Lenhardt, James Worrell
Model Checking Markov Chains Against Unambiguous Buchi Automata. CoRR (2014)
Michael Benedikt
Logical Approaches to Query Optimization over Web-Based Sources. AMW (2014)
Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
Bisimilarity of Pushdown Automata is Nonelementary. LICS (2013)
Luying Chen, Stefano Ortona, Giorgio Orsi, Michael Benedikt
ROSeAnn: Reconciling Opinions of Semantic Annotators. Proc. VLDB Endow. 6 (12) (2013)
Michael Benedikt, Rastislav Lenhardt, James Worrell
LTL Model Checking of Interval Markov Chains. TACAS (2013)
Michael Benedikt, Tova Milo, Dirk Van Gucht
The ACM PODS Alberto O. Mendelzon test-of-time award 2013. PODS (2013)
Michael Benedikt, Gabriele Puppis, Cristian Riveros
Bounded repairability of word languages. J. Comput. Syst. Sci. 79 (8) (2013)
Vince Bárány, Michael Benedikt, Balder ten Cate
Rewriting Guarded Negation Queries. MFCS (2013)

Michael Benedikt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Benedikt