| Foundations of rule-based query answering F Bry, N Eisinger, T Eiter, T Furche, G Gottlob, C Ley, B Linse, R Pichler, ... Reasoning Web, 1-153, 2007 | 47 | 2007 |
| Automata vs. logics on data words M Benedikt, C Ley, G Puppis Computer Science Logic, 110-124, 2010 | 38 | 2010 |
| What you must remember when processing data words M Benedikt, C Ley, G Puppis Proc. 4th Alberto Mendelzon Int. Workshop on Foundations of Data Management …, 2010 | 36 | 2010 |
| RDFLog: It’s like Datalog for RDF F Bry, T Furche, C Ley, B Linse, B Marnette Proc. Workshop on (Constraint) Logic Programming (WLP), 2008 | 22 | 2008 |
| On the use of guards for logics with data T Colcombet, C Ley, G Puppis International Symposium on Mathematical Foundations of Computer Science, 243-255, 2011 | 16 | 2011 |
| SPARQLog: SPARQL with rules and quantification F Bry, T Furche, B Marnette, C Ley, B Linse, O Poppe Semantic Web Information Management: A Model-based Perspective, 34, 2010 | 15 | 2010 |
| Querying schemas with access restrictions M Benedikt, P Bourhis, C Ley arXiv preprint arXiv:1203.6403, 2012 | 13 | 2012 |
| Logics with rigidly guarded data tests C Ley, T Colcombet, G Puppis Logical Methods in Computer Science 11, 2015 | 9 | 2015 |
| Taming existence in rdf querying F Bry, T Furche, C Ley, B Linse, B Marnette International Conference on Web Reasoning and Rule Systems, 236-237, 2008 | 9 | 2008 |
| Analysis of schemas with access restrictions M Benedikt, P Bourhis, C Ley ACM Transactions on Database Systems (TODS) 40 (1), 1-46, 2015 | 8 | 2015 |
| How big must complete XML query languages be? C Ley, M Benedikt Proceedings of the 12th International Conference on Database Theory, 183-200, 2009 | 8 | 2009 |
| Minimal memory automata M Benedikt, C Ley, G Puppis Alberto Mendelzon Workshop on Foundations of Databases, 2010 | 5 | 2010 |
| Datalog relaunched: Simulation unification and value invention F Bry, T Furche, C Ley, B Marnette, B Linse, S Schaffert International Datalog 2.0 Workshop, 321-350, 2010 | 4 | 2010 |
| Logics with rigidly guarded data tests G Puppis, T Colcombet, C Ley arXiv preprint arXiv:1410.2022, 2014 | 2 | 2014 |
| Limiting Until in Ordered Tree Query Languages M Benedikt, C Ley ACM Transactions on Computational Logic (TOCL) 17 (2), 1-34, 2016 | | 2016 |
| Forward looking logics and automata C Ley Oxford University Computing Laboratory, 2011 | | 2011 |
| On the use of guards for logics with data C Ley International Symposium on Mathematical Foundations Of Computer Science, 2011 | | 2011 |
| Minimal Memory Automata C Ley Technical Report, 2010 | | 2010 |
| RDFLog: It's like Datalog for RDF C Ley Workshop on (Constraint) Logic Programming, 2008 | | 2008 |
| A Robust Parser for the Web Query Language Xcerpt C Ley, PR des Fortgeschrittenenpraktikums | | 2005 |
Michael BenediktProfessor of Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
