Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMichael Benedikt
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[c79]Michael Benedikt, Boris Motik, Efthymia Tsamoura:
Goal-Driven Query Answering for Existential Rules With Equality. AAAI 2018- [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 - 2017
- [j46]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 fuer 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 - [j45]Gonzalo I. Diaz, Marcelo Arenas, Michael Benedikt:
SPARQLByE: Querying RDF data by example. PVLDB 9(13): 1533-1536 (2016) - [j44]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective Interpolation and Preservation in Guarded Logics. ACM Trans. Comput. Log. 17(2): 8:1-8:46 (2016) - [j43]Michael Benedikt, Clemens Ley:
Limiting Until in Ordered Tree Query Languages. ACM Trans. Comput. Log. 17(2): 14:1-14:34 (2016) - [j42]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:1-32:38 (2016) - [j41]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
- [j40]Michael Benedikt, Gabriele Puppis, Huy Vu:
The complexity of higher-order queries. Inf. Comput. 244: 172-202 (2015) - [j39]Michael Benedikt, Julien Leblay, Efthymia Tsamoura:
Querying with Access Patterns and Integrity Constraints. PVLDB 8(6): 690-701 (2015) - [j38]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
- [j37]Michael Benedikt, Julien Leblay, Efthymia Tsamoura:
PDQ: Proof-driven Query Answering over Web-based Data. PVLDB 7(13): 1553-1556 (2014) - [j36]Michael Benedikt, Gabriele Puppis, Cristian Riveros:
The per-character cost of repairing word languages. Theor. Comput. Sci. 539: 38-67 (2014) - [c61]
- [c60]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective interpolation and preservation in guarded logics. CSL-LICS 2014: 13:1-13:10 - [c59]
- [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
- [j35]Michael Benedikt, Rastislav Lenhardt, James Worrell:
Two Variable vs. Linear Temporal Logic in Model Checking and Games. Logical Methods in Computer Science 9(2) (2013) - [j34]Michael Benedikt, Gabriele Puppis, Cristian Riveros:
Bounded repairability of word languages. J. Comput. Syst. Sci. 79(8): 1302-1321 (2013) - [j33]Luying Chen, Stefano Ortona, Giorgio Orsi, Michael Benedikt:
ROSeAnn: Reconciling Opinions of Semantic Annotators. PVLDB 6(12): 1238-1241 (2013) - [j32]Luying Chen, Stefano Ortona, Giorgio Orsi, Michael Benedikt:
Aggregating Semantic Annotators. PVLDB 6(13): 1486-1497 (2013) - [j31]Michael Benedikt, Dan Olteanu:
Report on the first workshop on innovative querying of streams. SIGMOD Record 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
- [j30]Michael Benedikt, Pierre Bourhis, Clemens Ley:
Querying Schemas With Access Restrictions. PVLDB 5(7): 634-645 (2012) - [j29]
- [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]
- [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
- [j28]Huy Vu, Michael Benedikt:
HOMES: A Higher-Order Mapping Evaluation System. PVLDB 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]
- [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
- [j27]Michael Benedikt, Georg Gottlob:
The Impact of Virtual Views on Containment. PVLDB 3(1): 297-308 (2010) - [j26]Michael Benedikt, Evgeny Kharlamov, Dan Olteanu, Pierre Senellart:
Probabilistic XML via Markov Chains. PVLDB 3(1): 770-781 (2010) - [j25]Michael Benedikt, James Cheney:
Destabilizers and Independence of XML Updates. PVLDB 3(1): 906-917 (2010) - [j24]Michael Benedikt, Daniela Florescu, Philippa Gardner, Giovanna Guerrini, Marco Mesiti, Emmanuel Waller:
Report on the EDBT/ICDT 2010 workshop on updates in XML. SIGMOD Record 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]
- [c37]
2000 – 2009
- 2009
- [j23]Michael Benedikt, Luc Segoufin:
Towards a characterization of order-invariant queries over tame graphs. J. Symb. Log. 74(1): 168-186 (2009) - [j22]Michael Benedikt, James Cheney:
Schema-Based Independence Analysis for XML Updates. PVLDB 2(1): 61-72 (2009) - [j21]Michael Benedikt, Luc Segoufin:
Regular tree languages definable in FO and in FOmod. ACM Trans. Comput. Log. 11(1): 4:1-4:32 (2009) - [j20]Michael Benedikt, Christoph Koch:
From XQuery to relational logics. ACM Trans. Database Syst. 34(4): 25:1-25:48 (2009) - [c36]
- [c35]
- 2008
- [j19]
- [j18]Michael Benedikt, Wenfei Fan, Floris Geerts:
XPath satisfiability in the presence of DTDs. J. ACM 55(2): 8:1-8:79 (2008) - [j17]Sihem Amer-Yahia, Michael Benedikt, Laks V. S. Lakshmanan, Julia Stoyanovich:
Efficient network aware search in collaborative tagging sites. PVLDB 1(1): 710-721 (2008) - [c34]Michael Benedikt, Alan Jeffrey, Ruy Ley-Wild:
Stream firewalling of xml constraints. SIGMOD Conference 2008: 487-498 - 2007
- [j16]Sihem Amer-Yahia, Michael Benedikt, Philip Bohannon:
Challenges in Searching Online Communities. IEEE Data Eng. Bull. 30(2): 23-31 (2007) - [j15]
- [j14]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]
- 2006
- [j13]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]
- [c31]
- 2005
- [j12]Michael Benedikt, Wenfei Fan, Gabriel M. Kuper:
Structural properties of XPath fragments. Theor. Comput. Sci. 336(1): 3-31 (2005) - [j11]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]
- [c26]Michael Benedikt, Wenfei Fan, Floris Geerts:
XPath satisfiability in the presence of DTDs. PODS 2005: 25-36 - [c25]
- [c24]Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas:
Adding Updates to XQuery: Semantics, Optimization, and Static Analysis. XIME-P 2005 - 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
- [j10]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
Definable relations and first-order query languages over strings. J. ACM 50(5): 694-751 (2003) - [j9]Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin:
Reachability and connectivity queries in constraint databases. J. Comput. Syst. Sci. 66(1): 169-206 (2003) - [j8]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
- [j7]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
- [j6]Michael Benedikt, Leonid Libkin:
Relational queries over interpreted structures. J. ACM 47(4): 644-680 (2000) - [j5]
- [c13]
- [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]
1990 – 1999
- 1999
- [j4]Michael Benedikt:
Hierarchies of Measure-Theoretic Ultrafilters. Ann. Pure Appl. Logic 97(1-3): 203-219 (1999) - [c11]