default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Benedikt
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j68]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)- [j67]Michael Benedikt
, Egor V. Kostylev, Tony Tan:
Two Variable Logic with Ultimately Periodic Counting. SIAM J. Comput. 53(4): 884-968 (2024) - [j66]Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik:
Rewriting the Infinite Chase for Guarded TGDs. ACM Trans. Database Syst. 49(4): 14:1-14:44 (2024) - [c92]Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan:
Decidability of Graph Neural Networks via Logical Characterizations. ICALP 2024: 127:1-127:20 - [c91]Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja:
Monotone Rewritability and the Analysis of Queries, Views, and Rules. KR 2024 - [c90]Sam Adam-Day, Michael Benedikt, Ismail Ilkan Ceylan, Ben Finkelshtein:
Almost Surely Asymptotically Constant Graph Neural Networks. NeurIPS 2024 - [i35]Sam Adam-Day, Michael Benedikt, Ismail Ilkan Ceylan, Ben Finkelshtein:
Graph neural network outputs are almost surely asymptotically constant. CoRR abs/2403.03880 (2024) - [i34]Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan:
Decidability of Graph Neural Networks via Logical Characterizations. CoRR abs/2404.18151 (2024) - [i33]Michael Benedikt, Anthony Widjaja Lin, Di-De Yen:
Revisiting the Expressiveness Landscape of Data Graph Queries. CoRR abs/2406.17871 (2024) - [i32]Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja:
Monotone Rewritability and the Analysis of Queries, Views, and Rules. CoRR abs/2407.14907 (2024) - 2023
- [j65]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): 16:1-16:62 (2023) - [c89]Michael Benedikt, Dmitry Chistikov, Alessio Mansutti:
The Complexity of Presburger Arithmetic with Power or Powers. ICALP 2023: 112:1-112:18 - [c88]Michael Benedikt, Ehud Hrushovski:
Embedded Finite Models beyond Restricted Quantifier Collapse. LICS 2023: 1-13 - [c87]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing Nested Relational Queries from Implicit Specifications. PODS 2023: 33-45 - [i31]Michael Benedikt, Ehud Hrushovski:
Embedded Finite Models beyond Restricted Quantifier Collapse. CoRR abs/2304.09231 (2023) - [i30]Michael Benedikt, Dmitry Chistikov, Alessio Mansutti:
The complexity of Presburger arithmetic with power or powers. CoRR abs/2305.03037 (2023) - [i29]Zsolt Zombori, Agapi Rissaki, Kristóf Szabó, Wolfgang Gatterbauer, Michael Benedikt:
Towards Unbiased Exploration in Partial Label Learning. CoRR abs/2307.00465 (2023) - 2022
- [j64]Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? Log. Methods Comput. Sci. 18(2) (2022) - [j63]Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik:
Rewriting the Infinite Chase. Proc. VLDB Endow. 15(11): 3045-3057 (2022) - [j62]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): 36-41 (2022) - [c86]Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik:
Datalog Rewriting for Guarded TGDs. Datalog 2022: 104-113 - [c85]Michael Bender, Michael Benedikt, Sudeepa Roy:
2022 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2022: 103-104 - [c84]Michael Benedikt:
The Past and Future of Embedded Finite Model Theory. RP 2022: 37-46 - [i28]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. CoRR abs/2202.08555 (2022) - [i27]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing Nested Relational Queries from Implicit Specifications. CoRR abs/2209.08299 (2022) - [i26]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory. CoRR abs/2212.03085 (2022) - [i25]Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik:
Rewriting the Infinite Chase. CoRR abs/2212.08522 (2022) - [i24]Antoine Amarilli, Michael Benedikt:
Tighter bounds for query answering with Guarded TGDs. CoRR abs/2212.11362 (2022) - 2021
- [j61]Michael Benedikt, Cécilia Pradic:
Generating collection transformations from proofs. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [j60]Jaclyn Smith, Michael Benedikt, Brandon Moore, Milos Nikolic:
TraNCE: Transforming Nested Collections Efficiently. Proc. VLDB Endow. 14(12): 2727-2730 (2021) - [j59]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): 13:1-13:69 (2021) - [j58]Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura:
Balancing Expressiveness and Inexpressiveness in View Design. ACM Trans. Database Syst. 46(4): 15:1-15:40 (2021) - 2020
- [j57]Jaclyn Smith, Michael Benedikt, Milos Nikolic, Amir Shaikhha:
Scalable Querying of Nested Data. Proc. VLDB Endow. 14(3): 445-457 (2020) - [j56]Michael Benedikt, Pierre Bourhis, Georg Gottlob, Pierre Senellart:
Monadic Datalog, Tree Validity, and Limited Access Containment. ACM Trans. Comput. Log. 21(1): 6:1-6:45 (2020) - [j55]Antoine Amarilli, Michael Benedikt:
Finite Open-world Query Answering with Number Restrictions. ACM Trans. Comput. Log. 21(4): 27:1-27:73 (2020) - [c83]Michael Benedikt, Egor V. Kostylev, Tony Tan:
Two Variable Logic with Ultimately Periodic Counting. ICALP 2020: 112:1-112:16 - [c82]Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura:
Balancing Expressiveness and Inexpressiveness in View Design. KR 2020: 109-118 - [c81]Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero:
On Monotonic Determinacy and Rewritability for Recursive Queries and Views. PODS 2020: 131-148 - [i23]Antoine Amarilli, Michael Benedikt:
Finite Open-World Query Answering with Number Restrictions. CoRR abs/2003.02521 (2020) - [i22]Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero:
On monotonic determinacy and rewritability for recursive queries and views. CoRR abs/2003.05898 (2020) - [i21]Vince Bárány, Michael Benedikt, Balder ten Cate:
Some Model Theory of Guarded Negation. CoRR abs/2005.06299 (2020) - [i20]Michael Benedikt, Cécilia Pradic:
Generating collection queries from proofs. CoRR abs/2005.06503 (2020) - [i19]Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura:
Balancing expressiveness and inexpressiveness in view design. CoRR abs/2006.00875 (2020) - [i18]Michael Benedikt, Egor V. Kostylev, Tony Tan:
Two variable logic with ultimately periodic counting. CoRR abs/2006.01193 (2020) - [i17]Jaclyn Smith, Michael Benedikt, Milos Nikolic, Amir Shaikhha:
Scalable Querying of Nested Data. CoRR abs/2011.06381 (2020)
2010 – 2019
- 2019
- [j54]Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Definability and Interpolation within Decidable Fixpoint Logics. Log. Methods Comput. Sci. 15(3) (2019) - [j53]Michael Benedikt:
Guest Editorial: Special Issue on Database Theory. Theory Comput. Syst. 63(7): 1572 (2019) - [c80]Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo:
Reasoning about Disclosure in Data Integration in the Presence of Source Constraints. IJCAI 2019: 1551-1557 - [i16]Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo:
Reasoning about disclosure in data integration in the presence of source constraints. CoRR abs/1906.00624 (2019) - [i15]Michael Benedikt, Kristian Kersting, Phokion G. Kolaitis, Daniel Neider:
Logic and Learning (Dagstuhl Seminar 19361). Dagstuhl Reports 9(9): 1-22 (2019) - 2018
- [j52]Michael Benedikt, Bernardo Cuenca Grau, Egor V. Kostylev:
Logical foundations of information disclosure in ontology-based data integration. Artif. Intell. 262: 52-95 (2018) - [j51]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. J. Artif. Intell. Res. 63: 191-264 (2018) - [j50]Vince Bárány, Michael Benedikt, Balder ten Cate:
Some Model Theory of Guarded Negation. J. Symb. Log. 83(4): 1307-1344 (2018) - [j49]Michael Benedikt:
Logic-based Perspectives on Query Reformulationover Restricted Interfaces. SIGMOD Rec. 47(2): 5-16 (2018) - [c79]Michael Benedikt, Boris Motik, Efthymia Tsamoura:
Goal-Driven Query Answering for Existential Rules With Equality. AAAI 2018: 1761-1770 - [c78]Ben Spencer, Michael Benedikt, Pierre Senellart:
Form Filling Based on Constraint Solving. ICWE 2018: 95-113 - [c77]Michael Benedikt:
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)? PODS 2018: 1-15 - [c76]Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? PODS 2018: 281-293 - [i14]Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? CoRR abs/1810.07822 (2018) - 2017
- [j48]Michael Benedikt, Joost Engelfriet, Sebastian Maneth:
Determinacy and rewriting of functional top-down and MSO tree transformations. J. Comput. Syst. Sci. 85: 57-73 (2017) - [c75]Michael Benedikt, Bernardo Cuenca Grau, Egor V. Kostylev:
Source Information Disclosure in Ontology-Based Data Integration. AAAI 2017: 1056-1062 - [c74]Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Characterizing Definability in Decidable Fixpoint Logics. ICALP 2017: 107:1-107:14 - [c73]Michael Benedikt, Egor V. Kostylev, Fabio Mogavero, Efthymia Tsamoura:
Reformulating Queries: Theory and Practice. IJCAI 2017: 837-843 - [c72]Ben Spencer, Michael Benedikt, Anders Møller, Franck van Breugel:
ArtForm: a tool for exploring the codebase of form-based websites. ISSTA 2017: 380-383 - [c71]Michael Benedikt, Timothy Duff, Aditya Sharad, James Worrell:
Polynomial automata: Zeroness and applications. LICS 2017: 1-12 - [c70]Michael Benedikt, George Konstantinidis, Giansalvatore Mecca, Boris Motik, Paolo Papotti, Donatello Santoro, Efthymia Tsamoura:
Benchmarking the Chase. PODS 2017: 37-52 - [e2]Michael Benedikt, Giorgio Orsi:
20th International Conference on Database Theory, ICDT 2017, March 21-24, 2017, Venice, Italy. LIPIcs 68, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-024-8 [contents] - [i13]Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Characterizing Definability in Decidable Fixpoint Logics. CoRR abs/1705.01823 (2017) - [i12]Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? CoRR abs/1706.07936 (2017) - [i11]Michael Benedikt, Boris Motik, Efthymia Tsamoura:
Goal-Driven Query Answering for Existential Rules with Equality. CoRR abs/1711.05227 (2017) - 2016
- [b1]Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura:
Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2016, ISBN 978-3-031-00728-6 - [j47]Gonzalo I. Diaz, Marcelo Arenas, Michael Benedikt:
SPARQLByE: Querying RDF data by example. Proc. VLDB Endow. 9(13): 1533-1536 (2016) - [j46]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective Interpolation and Preservation in Guarded Logics. ACM Trans. Comput. Log. 17(2): 8 (2016) - [j45]Michael Benedikt, Clemens Ley:
Limiting Until in Ordered Tree Query Languages. ACM Trans. Comput. Log. 17(2): 14 (2016) - [j44]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): 32 (2016) - [j43]Michael Benedikt, Balder ten Cate, Efthymia Tsamoura:
Generating Plans from Proofs. ACM Trans. Database Syst. 40(4): 22:1-22:45 (2016) - [c69]Michael Benedikt, Rodrigo Lopez-Serrano, Efthymia Tsamoura:
Biological Web Services: Integration, Optimization, and Reasoning. BAI@IJCAI 2016: 21-27 - [c68]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. IJCAI 2016: 893-899 - [c67]Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis:
Querying Visible and Invisible Information. LICS 2016: 297-306 - [c66]Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
A Step Up in Expressiveness of Decidable Fixpoint Logics. LICS 2016: 817-826 - [i10]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. CoRR abs/1607.00813 (2016) - 2015
- [j42]Michael Benedikt, Gabriele Puppis, Huy Vu:
The complexity of higher-order queries. Inf. Comput. 244: 172-202 (2015) - [j41]Michael Benedikt, Julien Leblay, Efthymia Tsamoura:
Querying with Access Patterns and Integrity Constraints. Proc. VLDB Endow. 8(6): 690-701 (2015) - [j40]Michael Benedikt, Pierre Bourhis, Clemens Ley:
Analysis of Schemas with Access Restrictions. ACM Trans. Database Syst. 40(1): 5:1-5:46 (2015) - [c65]Antoine Amarilli, Michael Benedikt:
Combining Existential Rules and Description Logics. IJCAI 2015: 2691-2697 - [c64]Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom:
The Complexity of Boundedness for Guarded Logics. LICS 2015: 293-304 - [c63]Antoine Amarilli, Michael Benedikt:
Finite Open-World Query Answering with Number Restrictions. LICS 2015: 305-316 - [c62]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Interpolation with Decidable Fixpoint Logics. LICS 2015: 378-389 - [i9]Antoine Amarilli, Michael Benedikt:
Combining Existential Rules and Description Logics (Extended Version). CoRR abs/1505.00326 (2015) - [i8]Antoine Amarilli, Michael Benedikt:
Finite Open-World Query Answering with Number Restrictions (Extended Version). CoRR abs/1505.04216 (2015) - [i7]Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis:
Querying Visible and Invisible Tables in the Presence of Integrity Constraints. CoRR abs/1509.01683 (2015) - 2014
- [j39]Michael Benedikt, Julien Leblay, Efthymia Tsamoura:
PDQ: Proof-driven Query Answering over Web-based Data. Proc. VLDB Endow. 7(13): 1553-1556 (2014) - [j38]Michael Benedikt, Gabriele Puppis, Cristian Riveros:
The per-character cost of repairing word languages. Theor. Comput. Sci. 539: 38-67 (2014) - [c61]Michael Benedikt:
Logical Approaches to Query Optimization over Web-Based Sources. AMW 2014 - [c60]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective interpolation and preservation in guarded logics. CSL-LICS 2014: 13:1-13:10 - [c59]Michael Benedikt, Ronald Fagin, Wim Martens:
The ICDT 2014 Test of Time Award. ICDT 2014: 257 - [c58]Michael Benedikt, Balder ten Cate, Efthymia Tsamoura:
Generating low-cost plans from proofs. PODS 2014: 200-211 - [i6]Michael Benedikt, Rastislav Lenhardt, James Worrell:
Model Checking Markov Chains Against Unambiguous Buchi Automata. CoRR abs/1405.4560 (2014) - [i5]Michael Benedikt, Carsten Lutz, Balder ten Cate:
Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331). Dagstuhl Reports 4(8): 1-20 (2014) - 2013
- [j37]Michael Benedikt, Rastislav Lenhardt, James Worrell:
Two Variable vs. Linear Temporal Logic in Model Checking and Games. Log. Methods Comput. Sci. 9(2) (2013) - [j36]Michael Benedikt, Gabriele Puppis, Cristian Riveros:
Bounded repairability of word languages. J. Comput. Syst. Sci. 79(8): 1302-1321 (2013) - [j35]Luying Chen, Stefano Ortona, Giorgio Orsi, Michael Benedikt:
ROSeAnn: Reconciling Opinions of Semantic Annotators. Proc. VLDB Endow. 6(12): 1238-1241 (2013) - [j34]Luying Chen, Stefano Ortona, Giorgio Orsi, Michael Benedikt:
Aggregating Semantic Annotators. Proc. VLDB Endow. 6(13): 1486-1497 (2013) - [j33]Michael Benedikt, Dan Olteanu:
Report on the first workshop on innovative querying of streams. SIGMOD Rec. 42(2): 59-63 (2013) - [c57]Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ICALP (2) 2013: 74-88 - [c56]Vince Bárány, Michael Benedikt, Pierre Bourhis:
Access patterns and integrity constraints revisited. ICDT 2013: 213-224 - [c55]Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski:
Bisimilarity of Pushdown Automata is Nonelementary. LICS 2013: 488-498 - [c54]Vince Bárány, Michael Benedikt, Balder ten Cate:
Rewriting Guarded Negation Queries. MFCS 2013: 98-110 - [c53]Michael Benedikt, Joost Engelfriet, Sebastian Maneth:
Determinacy and Rewriting of Top-Down and MSO Tree Transformations. MFCS 2013: 146-158 - [c52]Michael Benedikt, Tova Milo, Dirk Van Gucht:
The ACM PODS Alberto O. Mendelzon test-of-time award 2013. PODS 2013: 61-62 - [c51]Michael Benedikt, Rastislav Lenhardt, James Worrell:
LTL Model Checking of Interval Markov Chains. TACAS 2013: 32-46 - [i4]Saguy Benaim, Michael Benedikt, Rastislav Lenhardt, James Worrell:
Controlling the Depth, Size, and Number of Subtrees for Two-variable Logic on Trees. CoRR abs/1304.6925 (2013) - 2012
- [j32]Michael Benedikt, Pierre Bourhis, Clemens Ley:
Querying Schemas With Access Restrictions. Proc. VLDB Endow. 5(7): 634-645 (2012) - [j31]Michael Benedikt:
Report on PODS 2012. SIGACT News 43(3): 85-86 (2012) - [c50]Luying Chen, Michael Benedikt, Evgeny Kharlamov:
QUASAR: querying annotation, structure, and reasoning. EDBT 2012: 618-621 - [c49]Michael Benedikt, Pierre Bourhis, Pierre Senellart:
Monadic Datalog Containment. ICALP (2) 2012: 79-91 - [c48]Michael Benedikt, Rastislav Lenhardt, James Worrell:
Verification of Two-Variable Logic Revisited. QEST 2012: 114-123 - [c47]Michael Benedikt, Huy Vu:
HigherOrder Functions and Structured Datatypes. WebDB 2012: 43-48 - [c46]Michael Benedikt, Tim Furche, Andreas Savvides, Pierre Senellart:
ProFoUnd: program-analysis-based form understanding. WWW (Companion Volume) 2012: 313-316 - [e1]Michael Benedikt, Markus Krötzsch, Maurizio Lenzerini:
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2012, Scottsdale, AZ, USA, May 20-24, 2012. ACM 2012, ISBN 978-1-4503-1248-6 [contents] - [i3]Michael Benedikt, Pierre Bourhis, Clemens Ley:
Querying Schemas With Access Restrictions. CoRR abs/1203.6403 (2012) - [i2]Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski:
Bisimilarity of Pushdown Systems is Nonelementary. CoRR abs/1210.7686 (2012) - 2011
- [j30]Huy Vu, Michael Benedikt:
HOMES: A Higher-Order Mapping Evaluation System. Proc. VLDB Endow. 4(12): 1399-1402 (2011) - [c45]Michael Benedikt, Rastislav Lenhardt, James Worrell:
Two Variable vs. Linear Temporal Logic in Model Checking and Games. CONCUR 2011: 497-511 - [c44]Michael Benedikt, Gabriele Puppis, Cristian Riveros:
The Cost of Traveling between Languages. ICALP (2) 2011: 234-245 - [c43]Huy Vu, Michael Benedikt:
Complexity of higher-order queries. ICDT 2011: 208-219 - [c42]Michael Benedikt, Gabriele Puppis, Cristian Riveros:
Regular Repair of Specifications. LICS 2011: 335-344 - [c41]Michael Benedikt, Georg Gottlob, Pierre Senellart:
Determining relevance of accesses at runtime. PODS 2011: 211-222 - [p3]Michael Benedikt, Pierre Senellart:
Databases. Computer Science, The Hardware, Software and Heart of It 2011: 169-229 - [i1]Michael Benedikt, Georg Gottlob, Pierre Senellart:
Determining Relevance of Accesses at Runtime (Extended Version). CoRR abs/1104.0553 (2011) - 2010
- [j29]Michael Benedikt, Georg Gottlob:
The Impact of Virtual Views on Containment. Proc. VLDB Endow. 3(1): 297-308 (2010) - [j28]Michael Benedikt, Evgeny Kharlamov, Dan Olteanu, Pierre Senellart:
Probabilistic XML via Markov Chains. Proc. VLDB Endow. 3(1): 770-781 (2010) - [j27]Michael Benedikt, James Cheney:
Destabilizers and Independence of XML Updates. Proc. VLDB Endow. 3(1): 906-917 (2010) - [j26]Michael Benedikt, Daniela Florescu, Philippa Gardner, Giovanna Guerrini, Marco Mesiti, Emmanuel Waller:
Report on the EDBT/ICDT 2010 workshop on updates in XML. SIGMOD Rec. 39(1): 54-57 (2010) - [c40]Michael Benedikt, Clemens Ley, Gabriele Puppis:
What You Must Remember When Processing Data Words. AMW 2010 - [c39]Michael Benedikt, Clemens Ley, Gabriele Puppis:
Automata vs. Logics on Data Words. CSL 2010: 110-124 - [c38]Michael Benedikt:
Analysis of declarative updates: invited talk. EDBT/ICDT Workshops 2010 - [c37]Michael Benedikt, Gabriele Puppis, Huy Vu:
Positive higher-order queries. PODS 2010: 27-38
2000 – 2009
- 2009
- [j25]Michael Benedikt, Luc Segoufin:
Towards a characterization of order-invariant queries over tame graphs. J. Symb. Log. 74(1): 168-186 (2009) - [j24]Michael Benedikt, James Cheney:
Schema-Based Independence Analysis for XML Updates. Proc. VLDB Endow. 2(1): 61-72 (2009) - [j23]Michael Benedikt, Luc Segoufin:
Regular tree languages definable in FO and in FOmod. ACM Trans. Comput. Log. 11(1): 4:1-4:32 (2009) - [j22]Michael Benedikt, Christoph Koch:
From XQuery to relational logics. ACM Trans. Database Syst. 34(4): 25:1-25:48 (2009) - [c36]Michael Benedikt, James Cheney:
Semantics, Types and Effects for XML Updates. DBPL 2009: 1-17 - [c35]Clemens Ley, Michael Benedikt:
How big must complete XML query languages be? ICDT 2009: 183-200 - 2008
- [j21]Michael Benedikt, Christoph Koch:
XPath leashed. ACM Comput. Surv. 41(1): 3:1-3:54 (2008) - [j20]Michael Benedikt, Wenfei Fan, Floris Geerts:
XPath satisfiability in the presence of DTDs. J. ACM 55(2): 8:1-8:79 (2008) - [j19]Sihem Amer-Yahia, Michael Benedikt, Laks V. S. Lakshmanan, Julia Stoyanovich:
Efficient network aware search in collaborative tagging sites. Proc. VLDB Endow. 1(1): 710-721 (2008) - [c34]Michael Benedikt, Alan Jeffrey, Ruy Ley-Wild:
Stream firewalling of xml constraints. SIGMOD Conference 2008: 487-498 - 2007
- [j18]Sihem Amer-Yahia, Michael Benedikt, Philip Bohannon:
Challenges in Searching Online Communities. IEEE Data Eng. Bull. 30(2): 23-31 (2007) - [j17]Michael Benedikt:
Database Theory 2004. J. Comput. Syst. Sci. 73(3): 243-244 (2007) - [j16]Michael Benedikt, Leonid Libkin, Frank Neven:
Logical definability and query languages over ranked and unranked trees. ACM Trans. Comput. Log. 8(2): 11 (2007) - [c33]Michael Benedikt, Alan Jeffrey:
Efficient and Expressive Tree Filters. FSTTCS 2007: 461-472 - 2006
- [j15]Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke:
A characterization of first-order topological properties of planar spatial data. J. ACM 53(2): 273-305 (2006) - [c32]Michael Benedikt, Philip Bohannon, Glenn Bruns:
Data Cleaning for Decision Support. CleanDB 2006 - [c31]Michael Benedikt, Christoph Koch:
Interpreting Tree-to-Tree Queries. ICALP (2) 2006: 552-564 - 2005
- [j14]Michael Benedikt, Wenfei Fan, Gabriel M. Kuper:
Structural properties of XPath fragments. Theor. Comput. Sci. 336(1): 3-31 (2005) - [j13]Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis:
Analysis of recursive state machines. ACM Trans. Program. Lang. Syst. 27(4): 786-818 (2005) - [c30]Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas:
Verification of Tree Updates for Optimization. CAV 2005: 379-393 - [c29]Michael Benedikt, Luc Segoufin:
Towards a Characterization of Order-Invariant Queries over Tame Structures. CSL 2005: 276-291 - [c28]Michael Benedikt, Irini Fundulaki:
XML Subtree Queries: Specification and Composition. DBPL 2005: 138-153 - [c27]Michael Benedikt:
An Insider's Guide to Logic in Telecommunications Data. LICS 2005: 104-105 - [c26]Michael Benedikt, Wenfei Fan, Floris Geerts:
XPath satisfiability in the presence of DTDs. PODS 2005: 25-36 - [c25]Michael Benedikt, Luc Segoufin:
Regular Tree Languages Definable in FO. STACS 2005: 327-339 - [c24]Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas:
Adding Updates to XQuery: Semantics, Optimization, and Static Analysis. XIME-P 2005 - 2004
- [j12]Juliana Freire, Michael Benedikt:
Managing XML data: an abridged overview. Comput. Sci. Eng. 6(4): 12-19 (2004) - [c23]Michael Benedikt, Glenn Bruns:
On Guard: Producing Run-Time Checks from Integrity Constraints. AMAST 2004: 27-41 - [c22]Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke:
A Characterization of First-Order Topological Properties of Planar Spatial Data. PODS 2004: 107-114 - 2003
- [j11]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
Definable relations and first-order query languages over strings. J. ACM 50(5): 694-751 (2003) - [j10]Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin:
Reachability and connectivity queries in constraint databases. J. Comput. Syst. Sci. 66(1): 169-206 (2003) - [j9]Michael Benedikt, H. Jerome Keisler:
Definability with a predicate for a semi-linear set. J. Symb. Log. 68(1): 319-351 (2003) - [c21]Michael Benedikt, Wenfei Fan, Gabriel M. Kuper:
Structural Properties of XPath Fragments. ICDT 2003: 79-95 - [c20]Richard Hull, Michael Benedikt, Vassilis Christophides, Jianwen Su:
E-services: a look behind the curtain. PODS 2003: 1-14 - [c19]Michael Benedikt, Chee Yong Chan, Wenfei Fan, Juliana Freire, Rajeev Rastogi:
Capturing both Types and Constraints in Data Integration. SIGMOD Conference 2003: 277-288 - 2002
- [j8]Michael Benedikt, Leonid Libkin:
Aggregate Operators in Constraint Query Languages. J. Comput. Syst. Sci. 64(3): 628-654 (2002) - [c18]Michael Benedikt, Leonid Libkin:
Tree Extension Algebras: Logics, Automata, and Query Languages. LICS 2002: 203- - [c17]Michael Benedikt, Chee Yong Chan, Wenfei Fan, Rajeev Rastogi, Shihui Zheng, Aoying Zhou:
DTD-Directed Publishing with Attribute Translation Grammars. VLDB 2002: 838-849 - 2001
- [c16]Michael Benedikt, Patrice Godefroid, Thomas W. Reps:
Model Checking of Unrestricted Hierarchical State Machines. ICALP 2001: 652-666 - [c15]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
A Model-Theoretic Approach to Regular String Relations. LICS 2001: 431-440 - [c14]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
String Operations in Query Languages. PODS 2001 - 2000
- [j7]Michael Benedikt, Leonid Libkin:
Relational queries over interpreted structures. J. ACM 47(4): 644-680 (2000) - [j6]Michael Benedikt, Leonid Libkin:
Safe Constraint Queries. SIAM J. Comput. 29(5): 1652-1682 (2000) - [c13]Michael Benedikt, H. Jerome Keisler:
Definability over Linear Constraints. CSL 2000: 217-231 - [c12]Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin:
Reachability and Connectivity Queries in Constraint Databases. PODS 2000: 104-115 - [p2]Michael Benedikt, Leonid Libkin:
Expressive Power: The Finite Case. Constraint Databases 2000: 55-87 - [p1]Michael Benedikt, Leonid Libkin:
Query Safety with Constraints. Constraint Databases 2000: 109-129
1990 – 1999
- 1999
- [j5]Michael Benedikt:
Hierarchies of Measure-Theoretic Ultrafilters. Ann. Pure Appl. Log. 97(1-3): 203-219 (1999) - [c11]Michael Benedikt, Thomas W. Reps, Shmuel Sagiv:
A Decidable Logic for Describing Linked Data Structures. ESOP 1999: 2-19 - [c10]Michael Benedikt, Leonid Libkin:
Exact and Approximate Aggregation in Constraint Query. PODS 1999: 102-113 - 1998
- [j4]Michael Benedikt, Timothy Griffin, Leonid Libkin:
Verifiable Properties of Database Transactions. Inf. Comput. 147(1): 57-88 (1998) - [j3]Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong:
Relational Expressive Power of Constraint Query Languages. J. ACM 45(1): 1-34 (1998) - [j2]Michael Benedikt:
Ultrafilters which Extend Measures. J. Symb. Log. 63(2): 638-662 (1998) - [c9]John T. Baldwin, Michael Benedikt:
Embedded Finite Models, Stability Theory and the Impact of Order. LICS 1998: 490-500 - [c8]Michael Benedikt, Leonid Libkin:
Safe Constraint Queries. PODS 1998: 99-108 - 1997
- [j1]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:
Integrated web and telephone service creation. Bell Labs Tech. J. 2(1): 19-35 (1997) - [c7]Michael Benedikt, H. Jerome Keisler:
Expressive Power of Unary Counters. Structures in Logic and Computer Science 1997: 34-50 - [c6]David L. Atkins, Thomas Ball, Michael Benedikt, Glenn Bruns, Kenneth C. Cox, Peter Mataga, Kenneth Rehor:
Experience with a Domain Specific Language for Form-based Services. DSL 1997: 37-50 - [c5]Michael Benedikt, H. Jerome Keisler:
Expressive Power of Unary Counters. ICDT 1997: 291-305 - [c4]Michael Benedikt, Leonid Libkin:
Languages for Relational Databases over Interpreted Structures. PODS 1997: 87-98 - 1996
- [c3]Michael Benedikt, Leonid Libkin:
On the Structure of Queries in Constraint Query Languages. LICS 1996: 25-34 - [c2]Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong:
Relational Expressive Power of Constraint Query Languages. PODS 1996: 5-16 - [c1]Michael Benedikt, Timothy Griffin, Leonid Libkin:
Verifiable Properties of Database Transactions. PODS 1996: 117-127
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
