Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA 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
- 2022
[j61]Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? Log. Methods Comput. Sci. 18(2) (2022)- [c84]Michael Bender, Michael Benedikt, Sudeep Roy:
2022 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2022: 103-104 - [i24]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. CoRR abs/2202.08555 (2022) - 2021
- [j60]Michael Benedikt, Pierre Pradic:
Generating collection transformations from proofs. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [j59]Jaclyn Smith, Michael Benedikt, Brandon Moore, Milos Nikolic:
TraNCE: Transforming Nested Collections Efficiently. Proc. VLDB Endow. 14(12): 2727-2730 (2021) - [j58]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) - [j57]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
- [j56]Jaclyn Smith, Michael Benedikt, Milos Nikolic, Amir Shaikhha:
Scalable Querying of Nested Data. Proc. VLDB Endow. 14(3): 445-457 (2020) - [j55]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) - [j54]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, Pierre 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
- [j53]Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Definability and Interpolation within Decidable Fixpoint Logics. Log. Methods Comput. Sci. 15(3) (2019) - [j52]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
- [j51]Michael Benedikt, Bernardo Cuenca Grau, Egor V. Kostylev:
Logical foundations of information disclosure in ontology-based data integration. Artif. Intell. 262: 52-95 (2018) - [j50]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) - [j49]Vince Bárány, Michael Benedikt, Balder ten Cate:
Some Model Theory of Guarded Negation. J. Symb. Log. 83(4): 1307-1344 (2018) - [j48]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
- [j47]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 - [j46]Gonzalo I. Diaz, Marcelo Arenas, Michael Benedikt:
SPARQLByE: Querying RDF data by example. Proc. VLDB Endow. 9(13): 1533-1536 (2016) - [j45]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective Interpolation and Preservation in Guarded Logics. ACM Trans. Comput. Log. 17(2): 8 (2016) - [j44]Michael Benedikt, Clemens Ley:
Limiting Until in Ordered Tree Query Languages. ACM Trans. Comput. Log. 17(2): 14 (2016) - [j43]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) - [j42]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
- [j41]Michael Benedikt, Gabriele Puppis, Huy Vu:
The complexity of higher-order queries. Inf. Comput. 244: 172-202 (2015) - [j40]Michael Benedikt, Julien Leblay, Efthymia Tsamoura:
Querying with Access Patterns and Integrity Constraints. Proc. VLDB Endow. 8(6): 690-701 (2015) - [j39]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
- [j38]Michael Benedikt, Julien Leblay, Efthymia Tsamoura:
PDQ: Proof-driven Query Answering over Web-based Data. Proc. VLDB Endow. 7(13): 1553-1556 (2014) - [j37]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
- [j36]Michael Benedikt, Rastislav Lenhardt, James Worrell:
Two Variable vs. Linear Temporal Logic in Model Checking and Games. Log. Methods Comput. Sci. 9(2) (2013) - [j35]Michael Benedikt, Gabriele Puppis, Cristian Riveros:
Bounded repairability of word languages. J. Comput. Syst. Sci. 79(8): 1302-1321 (2013) - [j34]Luying Chen, Stefano Ortona, Giorgio Orsi, Michael Benedikt:
ROSeAnn: Reconciling Opinions of Semantic Annotators. Proc. VLDB Endow. 6(12): 1238-1241 (2013) - [j33]Luying Chen, Stefano Ortona, Giorgio Orsi, Michael Benedikt:
Aggregating Semantic Annotators. Proc. VLDB Endow. 6(13): 1486-1497 (2013) - [j32]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
- [j31]Michael Benedikt, Pierre Bourhis, Clemens Ley:
Querying Schemas With Access Restrictions. Proc. VLDB Endow. 5(7): 634-645 (2012) - [j30]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
- [j29]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
- [j28]Michael Benedikt, Georg Gottlob:
The Impact of Virtual Views on Containment. Proc. VLDB Endow. 3(1): 297-308 (2010) - [j27]Michael Benedikt, Evgeny Kharlamov, Dan Olteanu, Pierre Senellart:
Probabilistic XML via Markov Chains. Proc. VLDB Endow. 3(1): 770-781 (2010) - [j26]Michael Benedikt, James Cheney:
Destabilizers and Independence of XML Updates. Proc. VLDB Endow. 3(1): 906-917 (2010) - [j25]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
- [j24]Michael Benedikt, Luc Segoufin:
Towards a characterization of order-invariant queries over tame graphs. J. Symb. Log. 74(1): 168-186 (2009) - [j23]Michael Benedikt, James Cheney:
Schema-Based Independence Analysis for XML Updates. Proc. VLDB Endow. 2(1): 61-72 (2009) - [j22]Michael Benedikt, Luc Segoufin:
Regular tree languages definable in FO and in FOmod. ACM Trans. Comput. Log. 11(1): 4:1-4:32 (2009) - [j21]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
- [j20]Michael Benedikt, Christoph Koch:
XPath leashed. ACM Comput. Surv. 41(1): 3:1-3:54 (2008) - [j19]Michael Benedikt, Wenfei Fan, Floris Geerts:
XPath satisfiability in the presence of DTDs. J. ACM 55(2): 8:1-8:79 (2008) - [j18]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
- [j17]Sihem Amer-Yahia, Michael Benedikt, Philip Bohannon:
Challenges in Searching Online Communities. IEEE Data Eng. Bull. 30(2): 23-31 (2007) - [j16]