Michael Benedikt

213 papers A* 52A 11B 9Journal 111Unranked 26
YearRankTypeTitle / Venue / Authors
2026 B conf
Analysis of Logics with Arithmetic.
CSL
Michael Benedikt, Chia-Hsuan Lu, Tony Tan
2026 J jnl
How Expressive Are Graph Neural Networks in the Presence of Node Identifiers?
CoRR
Arie Soeteman, Michael Benedikt, Martin Grohe, Balder ten Cate
2026 — conf
Robustness Verification of Graph Neural Networks Via Lightweight Satisfiability Testing.
TACAS (1)
Chia-Hsuan Lu, Tony Tan, Michael Benedikt
2025 J jnl
Analysis of logics with arithmetic.
CoRR
Michael Benedikt, Chia-Hsuan Lu, Tony Tan
2025 J jnl
Constraint-aware Learning of Probabilistic Sequential Models for Multi-Label Classification.
CoRR
Mykhailo Buleshnyi, Anna Polova, Zsolt Zombori, Michael Benedikt
2025 A* conf
Convergence Laws for Extensions of First-Order Logic with Averaging.
LICS
Sam Adam-Day, Michael Benedikt, Alberto Larrauri
2025 J jnl
Convergence Laws for Extensions of First-Order Logic with Averaging.
CoRR
Sam Adam-Day, Michael Benedikt, Alberto Larrauri
2025 J jnl
Logic and Neural Networks (Dagstuhl Seminar 25061).
Dagstuhl Reports
Vaishak Belle, Michael Benedikt, Dana Drachsler-Cohen, Daniel Neider, Tom Yuviler
2025 J jnl
Logical perspectives on learning statistical objects.
CoRR
Aaron Anderson, Michael Benedikt
2025 J jnl
Robustness Verification of Graph Neural Networks Via Lightweight Satisfiability Testing.
CoRR
Chia-Hsuan Lu, Tony Tan, Michael Benedikt
2024 A* conf
Almost Surely Asymptotically Constant Graph Neural Networks.
NeurIPS
Sam Adam-Day, Michael Benedikt, Ismail Ilkan Ceylan, Ben Finkelshtein
2024 A* conf
Decidability of Graph Neural Networks via Logical Characterizations.
ICALP
Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan
2024 J jnl
Decidability of Graph Neural Networks via Logical Characterizations.
CoRR
Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan
2024 J jnl
Graph neural network outputs are almost surely asymptotically constant.
CoRR
Sam Adam-Day, Michael Benedikt, Ismail Ilkan Ceylan, Ben Finkelshtein
2024 — conf
Interfaces to Data, Beyond Views.
AMW
Michael Benedikt
2024 A* conf
Monotone Rewritability and the Analysis of Queries, Views, and Rules.
KR
Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja
2024 J jnl
Monotone Rewritability and the Analysis of Queries, Views, and Rules.
CoRR
Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja
2024 J jnl
Revisiting the Expressiveness Landscape of Data Graph Queries.
CoRR
Michael Benedikt, Anthony Widjaja Lin, Di-De Yen
2024 J jnl
Rewriting the Infinite Chase for Guarded TGDs.
ACM Trans. Database Syst.
Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik
2024 J jnl
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory.
Log. Methods Comput. Sci.
Michael Benedikt, Cécilia Pradic, Christoph Wernhard
2024 J jnl
Towards Unbiased Exploration in Partial Label Learning.
J. Mach. Learn. Res.
Zsolt Zombori, Agapi Rissaki, Kristóf Szabó, Wolfgang Gatterbauer, Michael Benedikt
2024 J jnl
Two Variable Logic with Ultimately Periodic Counting.
SIAM J. Comput.
Michael Benedikt, Egor V. Kostylev, Tony Tan
2023 A* conf
Embedded Finite Models beyond Restricted Quantifier Collapse.
LICS
Michael Benedikt, Ehud Hrushovski
2023 J jnl
Embedded Finite Models beyond Restricted Quantifier Collapse.
CoRR
Michael Benedikt, Ehud Hrushovski
2023 J jnl
On Monotonic Determinacy and Rewritability for Recursive Queries and Views.
ACM Trans. Comput. Log.
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
2023 A* conf
Synthesizing Nested Relational Queries from Implicit Specifications.
PODS
Michael Benedikt, Cécilia Pradic, Christoph Wernhard
2023 A* conf
The Complexity of Presburger Arithmetic with Power or Powers.
ICALP
Michael Benedikt, Dmitry Chistikov, Alessio Mansutti
2023 J jnl
The complexity of Presburger arithmetic with power or powers.
CoRR
Michael Benedikt, Dmitry Chistikov, Alessio Mansutti
2023 J jnl
Towards Unbiased Exploration in Partial Label Learning.
CoRR
Zsolt Zombori, Agapi Rissaki, Kristóf Szabó, Wolfgang Gatterbauer, Michael Benedikt
2022 A* conf
2022 ACM PODS Alberto O. Mendelzon Test-of-Time Award.
PODS
Michael Bender, Michael Benedikt, Sudeepa Roy
2022 — conf
Datalog Rewriting for Guarded TGDs.
Datalog
Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik
2022 J jnl
PDQ 2.0: Flexible Infrastructure for Integrating Reasoning and Query Planning.
SIGMOD Rec.
Michael Benedikt, Fergus R. Cooper, Stefano Germano, Gabor Gyorkei, Efthymia Tsamoura, Brandon Moore, Camilo Ortiz
2022 J jnl
Query Answering with Transitive and Linear-Ordered Data.
CoRR
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2022 J jnl
Rewriting the Infinite Chase.
CoRR
Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik
2022 J jnl
Rewriting the Infinite Chase.
Proc. VLDB Endow.
Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik
2022 J jnl
Synthesizing Nested Relational Queries from Implicit Specifications.
CoRR
Michael Benedikt, Cécilia Pradic, Christoph Wernhard
2022 J jnl
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory.
CoRR
Michael Benedikt, Cécilia Pradic, Christoph Wernhard
2022 — conf
The Past and Future of Embedded Finite Model Theory.
RP
Michael Benedikt
2022 J jnl
Tighter bounds for query answering with Guarded TGDs.
CoRR
Antoine Amarilli, Michael Benedikt
2022 J jnl
When Can We Answer Queries Using Result-Bounded Data Interfaces?
Log. Methods Comput. Sci.
Antoine Amarilli, Michael Benedikt
2021 J jnl
Balancing Expressiveness and Inexpressiveness in View Design.
ACM Trans. Database Syst.
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura
2021 J jnl
Generating collection transformations from proofs.
Proc. ACM Program. Lang.
Michael Benedikt, Cécilia Pradic
2021 J jnl
Inference from Visible Information and Background Knowledge.
ACM Trans. Comput. Log.
Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis, Michael Vanden Boom
2021 J jnl
TraNCE: Transforming Nested Collections Efficiently.
Proc. VLDB Endow.
Jaclyn Smith, Michael Benedikt, Brandon Moore, Milos Nikolic
2020 A* conf
Balancing Expressiveness and Inexpressiveness in View Design.
KR
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura
2020 J jnl
Balancing expressiveness and inexpressiveness in view design.
CoRR
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura
2020 J jnl
Finite Open-World Query Answering with Number Restrictions.
CoRR
Antoine Amarilli, Michael Benedikt
2020 J jnl
Finite Open-world Query Answering with Number Restrictions.
ACM Trans. Comput. Log.
Antoine Amarilli, Michael Benedikt
2020 J jnl
Generating collection queries from proofs.
CoRR
Michael Benedikt, Cécilia Pradic
2020 J jnl
Monadic Datalog, Tree Validity, and Limited Access Containment.
ACM Trans. Comput. Log.
Michael Benedikt, Pierre Bourhis, Georg Gottlob, Pierre Senellart
2020 A* conf
On Monotonic Determinacy and Rewritability for Recursive Queries and Views.
PODS
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
2020 J jnl
On monotonic determinacy and rewritability for recursive queries and views.
CoRR
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
2020 J jnl
Scalable Querying of Nested Data.
CoRR
Jaclyn Smith, Michael Benedikt, Milos Nikolic, Amir Shaikhha
2020 J jnl
Scalable Querying of Nested Data.
Proc. VLDB Endow.
Jaclyn Smith, Michael Benedikt, Milos Nikolic, Amir Shaikhha
2020 J jnl
Some Model Theory of Guarded Negation.
CoRR
Vince Bárány, Michael Benedikt, Balder ten Cate
2020 A* conf
Two Variable Logic with Ultimately Periodic Counting.
ICALP
Michael Benedikt, Egor V. Kostylev, Tony Tan
2020 J jnl
Two variable logic with ultimately periodic counting.
CoRR
Michael Benedikt, Egor V. Kostylev, Tony Tan
2019 J jnl
Definability and Interpolation within Decidable Fixpoint Logics.
Log. Methods Comput. Sci.
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2019 J jnl
Guest Editorial: Special Issue on Database Theory.
Theory Comput. Syst.
Michael Benedikt
2019 J jnl
Logic and Learning (Dagstuhl Seminar 19361).
Dagstuhl Reports
Michael Benedikt, Kristian Kersting, Phokion G. Kolaitis, Daniel Neider
2019 A* conf
Reasoning about Disclosure in Data Integration in the Presence of Source Constraints.
IJCAI
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo
2019 J jnl
Reasoning about disclosure in data integration in the presence of source constraints.
CoRR
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo
2018 B conf
Form Filling Based on Constraint Solving.
ICWE
Ben Spencer, Michael Benedikt, Pierre Senellart
2018 A* conf
Goal-Driven Query Answering for Existential Rules With Equality.
AAAI
Michael Benedikt, Boris Motik, Efthymia Tsamoura
2018 A* conf
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?
PODS
Michael Benedikt
2018 J jnl
Logic-based Perspectives on Query Reformulationover Restricted Interfaces.
SIGMOD Rec.
Michael Benedikt
2018 J jnl
Logical foundations of information disclosure in ontology-based data integration.
Artif. Intell.
Michael Benedikt, Bernardo Cuenca Grau, Egor V. Kostylev
2018 J jnl
Query Answering with Transitive and Linear-Ordered Data.
J. Artif. Intell. Res.
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2018 J jnl
Some Model Theory of Guarded Negation.
J. Symb. Log.
Vince Bárány, Michael Benedikt, Balder ten Cate
2018 A* conf
When Can We Answer Queries Using Result-Bounded Data Interfaces?
PODS
Antoine Amarilli, Michael Benedikt
2018 J jnl
When Can We Answer Queries Using Result-Bounded Data Interfaces?
CoRR
Antoine Amarilli, Michael Benedikt
2017 A ed.
20th International Conference on Database Theory, ICDT 2017, Venice, Italy, March 21-24, 2017
ICDT
Michael Benedikt, Giorgio Orsi
2017 A conf
ArtForm: a tool for exploring the codebase of form-based websites.
ISSTA
Ben Spencer, Michael Benedikt, Anders Møller, Franck van Breugel
2017 A* conf
Benchmarking the Chase.
PODS
Michael Benedikt, George Konstantinidis, Giansalvatore Mecca, Boris Motik, Paolo Papotti, Donatello Santoro, Efthymia Tsamoura
2017 A* conf
Characterizing Definability in Decidable Fixpoint Logics.
ICALP
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2017 J jnl
Characterizing Definability in Decidable Fixpoint Logics.
CoRR
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2017 J jnl
Determinacy and rewriting of functional top-down and MSO tree transformations.
J. Comput. Syst. Sci.
Michael Benedikt, Joost Engelfriet, Sebastian Maneth
2017 J jnl
Goal-Driven Query Answering for Existential Rules with Equality.
CoRR
Michael Benedikt, Boris Motik, Efthymia Tsamoura
2017 A* conf
Polynomial automata: Zeroness and applications.
LICS
Michael Benedikt, Timothy Duff, Aditya Sharad, James Worrell
2017 A* conf
Reformulating Queries: Theory and Practice.
IJCAI
Michael Benedikt, Egor V. Kostylev, Fabio Mogavero, Efthymia Tsamoura
2017 A* conf
Source Information Disclosure in Ontology-Based Data Integration.
AAAI
Michael Benedikt, Bernardo Cuenca Grau, Egor V. Kostylev
2017 J jnl
When Can We Answer Queries Using Result-Bounded Data Interfaces?
CoRR
Antoine Amarilli, Michael Benedikt
2016 A* conf
A Step Up in Expressiveness of Decidable Fixpoint Logics.
LICS
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016 — conf
Biological Web Services: Integration, Optimization, and Reasoning.
BAI@IJCAI
Michael Benedikt, Rodrigo Lopez-Serrano, Efthymia Tsamoura
2016 J jnl
Complexity of Two-Variable Logic on Finite Trees.
ACM Trans. Comput. Log.
Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
2016 J jnl
Effective Interpolation and Preservation in Guarded Logics.
ACM Trans. Comput. Log.
Michael Benedikt, Balder ten Cate, Michael Vanden Boom
2016 J jnl
Generating Plans from Proofs.
ACM Trans. Database Syst.
Michael Benedikt, Balder ten Cate, Efthymia Tsamoura
2016 — book
Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation
Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura
2016 J jnl
Limiting Until in Ordered Tree Query Languages.
ACM Trans. Comput. Log.
Michael Benedikt, Clemens Ley
2016 A* conf
Query Answering with Transitive and Linear-Ordered Data.
IJCAI
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016 J jnl
Query Answering with Transitive and Linear-Ordered Data.
CoRR
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016 A* conf
Querying Visible and Invisible Information.
LICS
Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis
2016 J jnl
SPARQLByE: Querying RDF data by example.
Proc. VLDB Endow.
Gonzalo I. Diaz, Marcelo Arenas, Michael Benedikt
2015 J jnl
Analysis of Schemas with Access Restrictions.
ACM Trans. Database Syst.
Michael Benedikt, Pierre Bourhis, Clemens Ley
2015 J jnl
Combining Existential Rules and Description Logics (Extended Version).
CoRR
Antoine Amarilli, Michael Benedikt
2015 A* conf
Combining Existential Rules and Description Logics.
IJCAI
Antoine Amarilli, Michael Benedikt
2015 J jnl
Finite Open-World Query Answering with Number Restrictions (Extended Version).
CoRR
Antoine Amarilli, Michael Benedikt
2015 A* conf
Finite Open-World Query Answering with Number Restrictions.
LICS
Antoine Amarilli, Michael Benedikt
2015 A* conf
Interpolation with Decidable Fixpoint Logics.
LICS
Michael Benedikt, Balder ten Cate, Michael Vanden Boom
2015 J jnl
Querying Visible and Invisible Tables in the Presence of Integrity Constraints.
CoRR
Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis
2015 J jnl
Querying with Access Patterns and Integrity Constraints.
Proc. VLDB Endow.
Michael Benedikt, Julien Leblay, Efthymia Tsamoura
2015 A* conf
The Complexity of Boundedness for Guarded Logics.
LICS
Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom
2015 J jnl
The complexity of higher-order queries.
Inf. Comput.
Michael Benedikt, Gabriele Puppis, Huy Vu
2014 — conf
Effective interpolation and preservation in guarded logics.
CSL-LICS
Michael Benedikt, Balder ten Cate, Michael Vanden Boom
2014 A* conf
Generating low-cost plans from proofs.
PODS
Michael Benedikt, Balder ten Cate, Efthymia Tsamoura
2014 — conf
Logical Approaches to Query Optimization over Web-Based Sources.
AMW
Michael Benedikt
2014 J jnl
Model Checking Markov Chains Against Unambiguous Buchi Automata.
CoRR
Michael Benedikt, Rastislav Lenhardt, James Worrell
2014 J jnl
PDQ: Proof-driven Query Answering over Web-based Data.
Proc. VLDB Endow.
Michael Benedikt, Julien Leblay, Efthymia Tsamoura
2014 J jnl
Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331).
Dagstuhl Reports
Michael Benedikt, Carsten Lutz, Balder ten Cate
2014 A conf
The ICDT 2014 Test of Time Award.
ICDT
Michael Benedikt, Ronald Fagin, Wim Martens
2014 J jnl
The per-character cost of repairing word languages.
Theor. Comput. Sci.
Michael Benedikt, Gabriele Puppis, Cristian Riveros
2013 A conf
Access patterns and integrity constraints revisited.
ICDT
Vince Bárány, Michael Benedikt, Pierre Bourhis
2013 J jnl
Aggregating Semantic Annotators.
Proc. VLDB Endow.
Luying Chen, Stefano Ortona, Giorgio Orsi, Michael Benedikt
2013 A* conf
Bisimilarity of Pushdown Automata is Nonelementary.
LICS
Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
2013 J jnl
Bounded repairability of word languages.
J. Comput. Syst. Sci.
Michael Benedikt, Gabriele Puppis, Cristian Riveros
2013 — conf
Complexity of Two-Variable Logic on Finite Trees.
ICALP (2)
Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
2013 J jnl
Controlling the Depth, Size, and Number of Subtrees for Two-variable Logic on Trees
CoRR
Saguy Benaim, Michael Benedikt, Rastislav Lenhardt, James Worrell
2013 B conf
Determinacy and Rewriting of Top-Down and MSO Tree Transformations.
MFCS
Michael Benedikt, Joost Engelfriet, Sebastian Maneth
2013 A conf
LTL Model Checking of Interval Markov Chains.
TACAS
Michael Benedikt, Rastislav Lenhardt, James Worrell
2013 J jnl
ROSeAnn: Reconciling Opinions of Semantic Annotators.
Proc. VLDB Endow.
Luying Chen, Stefano Ortona, Giorgio Orsi, Michael Benedikt
2013 J jnl
Report on the first workshop on innovative querying of streams.
SIGMOD Rec.
Michael Benedikt, Dan Olteanu
2013 B conf
Rewriting Guarded Negation Queries.
MFCS
Vince Bárány, Michael Benedikt, Balder ten Cate
2013 A* conf
The ACM PODS Alberto O. Mendelzon test-of-time award 2013.
PODS
Michael Benedikt, Tova Milo, Dirk Van Gucht
2013 J jnl
Two Variable vs. Linear Temporal Logic in Model Checking and Games
Log. Methods Comput. Sci.
Michael Benedikt, Rastislav Lenhardt, James Worrell
2012 J jnl
Bisimilarity of Pushdown Systems is Nonelementary
CoRR
Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
2012 — conf
Higher­Order Functions and Structured Datatypes.
WebDB
Michael Benedikt, Huy Vu
2012 — conf
Monadic Datalog Containment.
ICALP (2)
Michael Benedikt, Pierre Bourhis, Pierre Senellart
2012 — conf
ProFoUnd: program-analysis-based form understanding.
WWW (Companion Volume)
Michael Benedikt, Tim Furche, Andreas Savvides, Pierre Senellart
2012 A* ed.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2012, Scottsdale, AZ, USA, May 20-24, 2012
PODS
Michael Benedikt, Markus Krötzsch, Maurizio Lenzerini
2012 B conf
QUASAR: querying annotation, structure, and reasoning.
EDBT
Luying Chen, Michael Benedikt, Evgeny Kharlamov
2012 J jnl
Querying Schemas With Access Restrictions
CoRR
Michael Benedikt, Pierre Bourhis, Clemens Ley
2012 J jnl
Querying Schemas With Access Restrictions.
Proc. VLDB Endow.
Michael Benedikt, Pierre Bourhis, Clemens Ley
2012 J jnl
Report on PODS 2012.
SIGACT News
Michael Benedikt
2012 — conf
Verification of Two-Variable Logic Revisited.
QEST
Michael Benedikt, Rastislav Lenhardt, James Worrell
2011 A conf
Complexity of higher-order queries.
ICDT
Huy Vu, Michael Benedikt
2011 — ch.
Databases.
Computer Science, The Hardware, Software and Heart of It
Michael Benedikt, Pierre Senellart
2011 J jnl
Determining Relevance of Accesses at Runtime (Extended Version)
CoRR
Michael Benedikt, Georg Gottlob, Pierre Senellart
2011 A* conf
Determining relevance of accesses at runtime.
PODS
Michael Benedikt, Georg Gottlob, Pierre Senellart
2011 J jnl
HOMES: A Higher-Order Mapping Evaluation System.
Proc. VLDB Endow.
Huy Vu, Michael Benedikt
2011 A* conf
Regular Repair of Specifications.
LICS
Michael Benedikt, Gabriele Puppis, Cristian Riveros
2011 — conf
The Cost of Traveling between Languages.
ICALP (2)
Michael Benedikt, Gabriele Puppis, Cristian Riveros
2011 B conf
Two Variable vs. Linear Temporal Logic in Model Checking and Games.
CONCUR
Michael Benedikt, Rastislav Lenhardt, James Worrell
2010 — conf
Analysis of declarative updates: invited talk.
EDBT/ICDT Workshops
Michael Benedikt
2010 B conf
Automata vs. Logics on Data Words.
CSL
Michael Benedikt, Clemens Ley, Gabriele Puppis
2010 J jnl
Destabilizers and Independence of XML Updates.
Proc. VLDB Endow.
Michael Benedikt, James Cheney
2010 A* conf
Positive higher-order queries.
PODS
Michael Benedikt, Gabriele Puppis, Huy Vu
2010 J jnl
Probabilistic XML via Markov Chains.
Proc. VLDB Endow.
Michael Benedikt, Evgeny Kharlamov, Dan Olteanu, Pierre Senellart
2010 J jnl
Report on the EDBT/ICDT 2010 workshop on updates in XML.
SIGMOD Rec.
Michael Benedikt, Daniela Florescu, Philippa Gardner, Giovanna Guerrini, Marco Mesiti, Emmanuel Waller
2010 J jnl
The Impact of Virtual Views on Containment.
Proc. VLDB Endow.
Michael Benedikt, Georg Gottlob
2010 — conf
What You Must Remember When Processing Data Words.
AMW
Michael Benedikt, Clemens Ley, Gabriele Puppis
2009 J jnl
From XQuery to relational logics.
ACM Trans. Database Syst.
Michael Benedikt, Christoph Koch
2009 A conf
How big must complete XML query languages be?
ICDT
Clemens Ley, Michael Benedikt
2009 J jnl
Regular tree languages definable in FO and in FO
ACM Trans. Comput. Log.
Michael Benedikt, Luc Segoufin
2009 J jnl
Schema-Based Independence Analysis for XML Updates.
Proc. VLDB Endow.
Michael Benedikt, James Cheney
2009 — conf
Semantics, Types and Effects for XML Updates.
DBPL
Michael Benedikt, James Cheney
2009 J jnl
Towards a characterization of order-invariant queries over tame graphs.
J. Symb. Log.
Michael Benedikt, Luc Segoufin
2008 J jnl
Efficient network aware search in collaborative tagging sites.
Proc. VLDB Endow.
Sihem Amer-Yahia, Michael Benedikt, Laks V. S. Lakshmanan, Julia Stoyanovich
2008 — conf
Stream firewalling of xml constraints.
SIGMOD Conference
Michael Benedikt, Alan Jeffrey, Ruy Ley-Wild
2008 J jnl
XPath leashed.
ACM Comput. Surv.
Michael Benedikt, Christoph Koch
2008 J jnl
XPath satisfiability in the presence of DTDs.
J. ACM
Michael Benedikt, Wenfei Fan, Floris Geerts
2007 J jnl
Challenges in Searching Online Communities.
IEEE Data Eng. Bull.
Sihem Amer-Yahia, Michael Benedikt, Philip Bohannon
2007 J jnl
Database Theory 2004.
J. Comput. Syst. Sci.
Michael Benedikt
2007 — conf
Efficient and Expressive Tree Filters.
FSTTCS
Michael Benedikt, Alan Jeffrey
2007 J jnl
Logical definability and query languages over ranked and unranked trees.
ACM Trans. Comput. Log.
Michael Benedikt, Leonid Libkin, Frank Neven
2006 J jnl
A characterization of first-order topological properties of planar spatial data.
J. ACM
Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke
2006 — conf
Data Cleaning for Decision Support.
CleanDB
Michael Benedikt, Philip Bohannon, Glenn Bruns
2006 — conf
Interpreting Tree-to-Tree Queries.
ICALP (2)
Michael Benedikt, Christoph Koch
2005 — conf
Adding Updates to XQuery: Semantics, Optimization, and Static Analysis.
XIME-P
Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas
2005 A* conf
An Insider's Guide to Logic in Telecommunications Data.
LICS
Michael Benedikt
2005 J jnl
Analysis of recursive state machines.
ACM Trans. Program. Lang. Syst.
Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis
2005 A conf
Regular Tree Languages Definable in FO.
STACS
Michael Benedikt, Luc Segoufin
2005 J jnl
Structural properties of XPath fragments.
Theor. Comput. Sci.
Michael Benedikt, Wenfei Fan, Gabriel M. Kuper
2005 B conf
Towards a Characterization of Order-Invariant Queries over Tame Structures.
CSL
Michael Benedikt, Luc Segoufin
2005 A* conf
Verification of Tree Updates for Optimization.
CAV
Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas
2005 — conf
XML Subtree Queries: Specification and Composition.
DBPL
Michael Benedikt, Irini Fundulaki
2005 A* conf
XPath satisfiability in the presence of DTDs.
PODS
Michael Benedikt, Wenfei Fan, Floris Geerts
2004 A* conf
A Characterization of First-Order Topological Properties of Planar Spatial Data.
PODS
Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke
2004 J jnl
Managing XML data: an abridged overview.
Comput. Sci. Eng.
Juliana Freire, Michael Benedikt
2004 — conf
On Guard: Producing Run-Time Checks from Integrity Constraints.
AMAST
Michael Benedikt, Glenn Bruns
2003 — conf
Capturing both Types and Constraints in Data Integration.
SIGMOD Conference
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Juliana Freire, Rajeev Rastogi
2003 J jnl
Definability with a predicate for a semi-linear set.
J. Symb. Log.
Michael Benedikt, H. Jerome Keisler
2003 J jnl
Definable relations and first-order query languages over strings.
J. ACM
Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
2003 A* conf
E-services: a look behind the curtain.
PODS
Richard Hull, Michael Benedikt, Vassilis Christophides, Jianwen Su
2003 J jnl
Reachability and connectivity queries in constraint databases.
J. Comput. Syst. Sci.
Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin
2003 A conf
Structural Properties of XPath Fragments.
ICDT
Michael Benedikt, Wenfei Fan, Gabriel M. Kuper
2002 J jnl
Aggregate Operators in Constraint Query Languages.
J. Comput. Syst. Sci.
Michael Benedikt, Leonid Libkin
2002 A* conf
DTD-Directed Publishing with Attribute Translation Grammars.
VLDB
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Rajeev Rastogi, Shihui Zheng, Aoying Zhou
2002 A* conf
Tree Extension Algebras: Logics, Automata, and Query Languages.
LICS
Michael Benedikt, Leonid Libkin
2001 A* conf
A Model-Theoretic Approach to Regular String Relations.
LICS
Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
2001 A* conf
Model Checking of Unrestricted Hierarchical State Machines.
ICALP
Michael Benedikt, Patrice Godefroid, Thomas W. Reps
2001 A* conf
String Operations in Query Languages.
PODS
Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
2000 B conf
Definability over Linear Constraints.
CSL
Michael Benedikt, H. Jerome Keisler
2000 — ch.
Expressive Power: The Finite Case.
Constraint Databases
Michael Benedikt, Leonid Libkin
2000 — ch.
Query Safety with Constraints.
Constraint Databases
Michael Benedikt, Leonid Libkin
2000 A* conf
Reachability and Connectivity Queries in Constraint Databases.
PODS
Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin
2000 J jnl
Relational queries over interpreted structures.
J. ACM
Michael Benedikt, Leonid Libkin
2000 J jnl
Safe Constraint Queries.
SIAM J. Comput.
Michael Benedikt, Leonid Libkin
1999 A conf
A Decidable Logic for Describing Linked Data Structures.
ESOP
Michael Benedikt, Thomas W. Reps, Shmuel Sagiv
1999 A* conf
Exact and Approximate Aggregation in Constraint Query.
PODS
Michael Benedikt, Leonid Libkin
1999 J jnl
Hierarchies of Measure-Theoretic Ultrafilters.
Ann. Pure Appl. Log.
Michael Benedikt
1998 A* conf
Embedded Finite Models, Stability Theory and the Impact of Order.
LICS
John T. Baldwin, Michael Benedikt
1998 J jnl
Relational Expressive Power of Constraint Query Languages.
J. ACM
Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong
1998 A* conf
Safe Constraint Queries.
PODS
Michael Benedikt, Leonid Libkin
1998 J jnl
Ultrafilters which Extend Measures.
J. Symb. Log.
Michael Benedikt
1998 J jnl
Verifiable Properties of Database Transactions.
Inf. Comput.
Michael Benedikt, Timothy Griffin, Leonid Libkin
1997 — conf
Experience with a Domain Specific Language for Form-based Services.
DSL
David L. Atkins, Thomas Ball, Michael Benedikt, Glenn Bruns, Kenneth C. Cox, Peter Mataga, Kenneth Rehor
1997 — conf
Expressive Power of Unary Counters.
Structures in Logic and Computer Science
Michael Benedikt, H. Jerome Keisler
1997 A conf
Expressive Power of Unary Counters.
ICDT
Michael Benedikt, H. Jerome Keisler
1997 J jnl
Integrated web and telephone service creation.
Bell Labs Tech. J.
David L. Atkins, Thomas Ball, Thomas R. Baran, Michael Benedikt, Kenneth C. Cox, David A. Ladd, Peter A. Mataga, Carlos Puchol, J. Christopher Ramming, Kenneth Rehor, Curtis Tuckey
1997 A* conf
Languages for Relational Databases over Interpreted Structures.
PODS
Michael Benedikt, Leonid Libkin
1996 A* conf
On the Structure of Queries in Constraint Query Languages.
LICS
Michael Benedikt, Leonid Libkin
1996 A* conf
Relational Expressive Power of Constraint Query Languages.
PODS
Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong
1996 A* conf
Verifiable Properties of Database Transactions.
PODS
Michael Benedikt, Timothy Griffin, Leonid Libkin