Bibliography

Major publications by the team in recent years

• 1A. Amarilli, P. Bourhis, P. Senellart.
  
  Tractable Lineages on Treelike Instances: Limits and Extensions, in: PODS (Principles of Database Systems), San Francisco, United States, June 2016, pp. 355-370.
  
  https://hal-institut-mines-telecom.archives-ouvertes.fr/hal-01336514
• 2M. Benedikt, P. Bourhis, M. V. Boom.
  
  Characterizing Definability in Decidable Fixpoint Logics , in: ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming, Varsovie, Poland, I. Chatzigiannakis, P. Indyk, F. Kuhn, A. Muscholl (editors), July 2017, vol. 107, 14 p. [ DOI : 10.4230/LIPIcs.ICALP.2017.107 ]
  
  https://hal.inria.fr/hal-01639015
• 3A. Boiret, V. Hugot, J. Niehren, R. Treinen.
  
  Automata for Unordered Trees, in: Information and Computation, April 2017, vol. 253, pp. 304-335. [ DOI : 10.1016/j.ic.2016.07.012 ]
  
  https://hal.inria.fr/hal-01179493
• 4I. Boneva, J. G. Labra Gayo, E. G. Prud 'hommeaux.
  
  Semantics and Validation of Shapes Schemas for RDF, in: ISWC2017 - 16th International semantic web conference, Vienna, Austria, October 2017.
  
  https://hal.archives-ouvertes.fr/hal-01590350
• 5A. Bonifati, R. Ciucanu, S. Staworko.
  
  Learning Join Queries from User Examples, in: ACM Transactions on Database Systems, February 2016, vol. 40, n^o 4, pp. 24:1–24:38.
  
  https://hal.inria.fr/hal-01187986
• 6P. Bourhis, M. Benedikt, B. Ten Cate, G. Puppis.
  
  Querying Visible and Invisible Information, in: LICS 2016 - 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York City, United States, July 2016, pp. 297-306. [ DOI : 10.1145/2933575.2935306 ]
  
  https://hal.archives-ouvertes.fr/hal-01411118
• 7P. Bourhis, M. Krötzsch, S. Rudolph.
  
  Reasonable Highly Expressive Query Languages, in: IJCAI, Buenos Aires, Argentina, July 2015, IJCAI-2015 Honorable Mention. [ DOI : 10.1007/978-3-662-47666-6_5 ]
  
  https://hal.inria.fr/hal-01211282
• 8P. Buneman, S. Staworko.
  
  RDF Graph Alignment with Bisimulation, in: VLDB 2016 - 42nd International Conference on Very Large Databases, New Dehli, India, Proceedings of the VLDB Endowment, September 2016, vol. 9, n^o 12, pp. 1149 - 1160. [ DOI : 10.14778/2994509.2994531 ]
  
  https://hal.inria.fr/hal-01417156
• 9D. Debarbieux, O. Gauwin, J. Niehren, T. Sebastian, M. Zergaoui.
  
  Early Nested Word Automata for XPath Query Answering on XML Streams, in: Theoretical Computer Science, March 2015, n^o 578, pp. 100-127.
  
  https://hal.inria.fr/hal-00966625
• 10V. Hugot, A. Boiret, J. Niehren.
  
  Equivalence of Symbolic Tree Transducers, in: DLT 2017 - Developments in Language Theory, Liege, Belgium, August 2017, vol. 105, 12 p. [ DOI : 10.1007/978-3-642-29709-0_32 ]
  
  https://hal.inria.fr/hal-01517919

Publications of the year

Articles in International Peer-Reviewed Journals

• 11A. Boiret, V. Hugot, J. Niehren, R. Treinen.
  
  Automata for Unordered Trees, in: Information and Computation, April 2017, vol. 253, pp. 304-335. [ DOI : 10.1016/j.ic.2016.07.012 ]
  
  https://hal.inria.fr/hal-01179493
• 12A. Boiret, V. Hugot, J. Niehren, R. Treinen.
  
  Logics for Unordered Trees with Data Constraints, in: Journal of Computer and System Sciences (JCSS), February 2017, 40 p.
  
  https://hal.inria.fr/hal-01176763

International Conferences with Proceedings

• 13A. Amarilli, P. Bourhis, L. Jachiet, S. Mengel.
  
  A Circuit-Based Approach to Efficient Enumeration , in: ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming, Varsovie, Poland, I. Chatzigiannakis, P. Indyk, A. Muscholl (editors), July 2017, pp. 1-15. [ DOI : 10.4230/LIPIcs.ICALP.2017.111 ]
  
  https://hal.inria.fr/hal-01639179
• 14A. Amarilli, P. Bourhis, M. Monet, P. Senellart.
  
  Combined Tractability of Query Evaluation via Tree Automata and Cycluits, in: ICDT 2017 - International Conference on Database Theory, Venice, Italy, March 2017. [ DOI : 10.4230/LIPIcs.ICDT.2017.6 ]
  
  https://hal.inria.fr/hal-01439294
• 15N. Bacquey, E. Grandjean, F. Olive.
  
  Definability by Horn formulas and linear time on cellular automata, in: ICALP 2017 - 44th International Colloquium on Automata, Languages and Programming, Warsaw, Poland, I. Chatzigiannakis, P. Indyk, F. Kuhn, A. Muscholl (editors), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, July 2017, vol. 80, pp. 1-14. [ DOI : 10.4230/LIPIcs.ICALP.2017.99 ]
  
  https://hal.archives-ouvertes.fr/hal-01494246
• 16G. Bagan, A. Bonifati, R. Ciucanu, G. Fletcher, A. Lemay, N. Advokaat.
  
  gMark: Schema-Driven Generation of Graphs and Queries, in: Data Engineering (ICDE), 2017 IEEE 33rd International Conference on, San Diego, United States, April 2017. [ DOI : 10.1109/ICDE.2017.38 ]
  
  https://hal.inria.fr/hal-01591706
• 18M. Bienvenu, P. Bourhis, M.-L. Mugnier, S. Tison, F. Ulliana.
  
  Ontology-Mediated Query Answering for Key-Value Stores, in: IJCAI: International Joint Conference on Artificial Intelligence, Melbourne, Australia, August 2017.
  
  https://hal-lirmm.ccsd.cnrs.fr/lirmm-01632090
• 19I. Boneva, J. G. Labra Gayo, E. G. Prud 'hommeaux.
  
  Semantics and Validation of Shapes Schemas for RDF, in: ISWC2017 - 16th International semantic web conference, Vienna, Austria, October 2017.
  
  https://hal.archives-ouvertes.fr/hal-01590350
• 20P. Bourhis, M. Morak, A. Pieris.
  
  Making Cross Products and Guarded Ontology Languages Compatible, in: IJCAI 2017 - Twenty-Sixth International Joint Conference on Artificial Intelligence, Melbourne, Australia, August 2017, pp. 880-886. [ DOI : 10.24963/ijcai.2017/122 ]
  
  https://hal.inria.fr/hal-01638346
• 21P. Bourhis, J. L. Reutter, F. Suárez, D. Vrgoč.
  
  JSON: Data model, Query languages and Schema specification, in: PODS 2017 - Proceedings of the Thirty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Chicago, United States, May 2017. [ DOI : 10.1145/3034786.3056120 ]
  
  https://hal.inria.fr/hal-01639182
• 22P. Gallot, A. Muscholl, G. Puppis, S. Salvati.
  
  On the decomposition of finite-valued streaming string transducers, in: 34th International Symposium on Theoretical Aspects of Computer Science (STACS), Hannover, Germany, March 2017. [ DOI : 10.4230/LIPIcs ]
  
  https://hal.archives-ouvertes.fr/hal-01431250
• 23V. Hugot, A. Boiret, J. Niehren.
  
  Equivalence of Symbolic Tree Transducers, in: DLT 2017 - Developments in Language Theory, Liege, Belgium, August 2017, vol. 105, 12 p. [ DOI : 10.1007/978-3-642-29709-0_32 ]
  
  https://hal.inria.fr/hal-01517919

Conferences without Proceedings

• 24M. Sakho, I. Boneva, J. Niehren.
  
  Complexity of Certain Query Answering on Hyperstreams, in: BDA 2017 - 33ème conférence sur la « Gestion de Données — Principes, Technologies et Applications », Nancy, France, November 2017, n^o 10.
  
  https://hal.archives-ouvertes.fr/hal-01609498

Scientific Books (or Scientific Book chapters)

• 25J. E. L. Gayo, E. Prud'Hommeaux, I. Boneva, D. Kontokostas.
  
  Validating RDF Data, Morgan & Claypool, September 2017, vol. 7, n^o 1, pp. 1 - 328. [ DOI : 10.2200/S00786ED1V01Y201707WBE016 ]
  
  https://hal.archives-ouvertes.fr/hal-01667426

Other Publications

• 26A. Boiret, A. Lemay, J. Niehren.
  
  A Learning Algorithm for Top-Down Tree Transducers, July 2017, working paper or preprint.
  
  https://hal.inria.fr/hal-01357627