EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1S. Abiteboul, I. Manolescu, P. Rigaux, M.-C. Rousset, P. Senellart.

    Web Data Management, Cambridge University Press, 2012, 456 p.

    http://hal.inria.fr/hal-00677720
  • 2S. Abiteboul, L. Segoufin, V. Vianu.

    Static Analysis of Active XML Systems, in: ACM Transactions on Database Systems, 2009, vol. 34, no 4.
  • 3P. Barceló, L. Libkin, A. Poggi, C. Sirangelo.

    XML with incomplete information, in: J. ACM, 2010, vol. 58, no 1.
  • 4M. Bojańczyk, C. David, A. Muscholl, T. Schwentick, L. Segoufin.

    Two-variable logic on words with data, in: ACM Trans. on Computational Logic (ToCL), 2011, vol. 12, no 4.
  • 5M. Bojańczyk, A. Muscholl, T. Schwentick, L. Segoufin.

    Two-variable logic on data trees and applications to XML reasoning, in: Journal of the ACM, 2009, vol. 56, no 3.
  • 6M. Bojańczyk, L. Segoufin, H. Straubing.

    Piecewise testable tree languages, in: Logical Methods in Computer Science (LMCS), 2012, vol. 8, no 3.
  • 7Balder ten. Cate, L. Segoufin.

    Transitive Closure Logic, Nested Tree Walking Automata, and XPath, in: Journal of the ACM, 2010, vol. 57, no 3.
  • 8B. Cautis, S. Abiteboul, T. Milo.

    Reasoning about XML update constraints, in: Journal of Computer and System Sciences, 2009, vol. 75, no 6, pp. 336-358.
  • 9L. Libkin, C. Sirangelo.

    Reasoning about XML with temporal logics and automata, in: Journal of Applied Logic, 2010, vol. 8, no 2, pp. 210-232.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LS-jal10.pdf
  • 10L. Libkin, C. Sirangelo.

    Data exchange and schema mappings in open and closed worlds, in: Journal of Computer System Sciences (JCSS), 2011.
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 11C. Sirangelo.

    Representing and Querying Incomplete Information: a Data Interoperability Perspective, Ecole Normale Supérieure de Cachan, December 2014, Habilitation à diriger des recherches.

    https://hal.inria.fr/tel-01092547

Articles in International Peer-Reviewed Journals

  • 12A. Gheerbrant, L. Libkin, C. Sirangelo.

    Naive Evaluation of Queries over Incomplete Databases, in: ACM Transactions on Database Systems (TODS), December 2014, 42 p.

    https://hal.inria.fr/hal-01101184
  • 13C. Haase, S. Schmitz, P. Schnoebelen.

    The Power of Priority Channel Systems, in: Logical Methods in Computer Science, December 2014, vol. 10, no 4:4, pp. 1–39. [ DOI : 10.2168/LMCS-10(4:4)2014 ]

    https://hal.inria.fr/hal-01091086

Invited Conferences

  • 14S. Schmitz.

    Complexity Bounds for Ordinal-Based Termination, in: 8th International Workshop on Reachability Problems, Oxford, United Kingdom, J. Ouaknine, I. Potapov, J. Worrell (editors), Lecture Notes in Computer Science, Springer, September 2014, vol. 8762, pp. 1–19. [ DOI : 10.1007/978-3-319-11439-2_1 ]

    https://hal.inria.fr/hal-01076701

International Conferences with Proceedings

  • 15S. Abiteboul, D. Deutch, V. Vianu.

    Deduction with Contradictions in Datalog, in: International Conference on Database Theory, Athens, Greece, 2014.

    https://hal.inria.fr/hal-00923265
  • 16J.-B. Courtois, S. Schmitz.

    Alternating Vector Addition Systems with States, in: 39th International Symposium on Mathematical Foundations of Computer Science, Budapest, Bulgaria, E. Csuhaj-Varjú, M. Dietzfelbinger, Z. Ésik (editors), Lecture Notes in Computer Science, Springer, August 2014, vol. 8634, pp. 220–231. [ DOI : 10.1007/978-3-662-44522-8_19 ]

    https://hal.inria.fr/hal-00980878
  • 17C. David, N. Francis, F. Murlak.

    Consistency of injective tree patterns, in: Foundations of Software Technology and Theoretical Computer Science, New Dehli, India, December 2014.

    https://hal.inria.fr/hal-01094596
  • 18A. Durand, N. Schweikardt, L. Segoufin.

    Enumerating answers to first-order queries over databases of low degree, in: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS'14,, Snowbird, United States, June 2014, pp. 121–131. [ DOI : 10.1145/2594538.2594539 ]

    https://hal.inria.fr/hal-01070898
  • 19N. Francis, L. Segoufin, C. Sirangelo.

    Datalog Rewritings of Regular Path Queries using Views, in: Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 2014, pp. 107–118. [ DOI : 10.5441/002/icdt.2014.14 ]

    https://hal.inria.fr/hal-01070903
  • 20R. Lazić, S. Schmitz.

    Non-Elementary Complexities for Branching VASS, MELL, and Extensions, in: Joint meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, Vienna, Austria, ACM, July 2014, pp. 61:1–61:1. [ DOI : 10.1145/2603088.2603129 ]

    https://hal.inria.fr/hal-01076694
  • 22L. Segoufin.

    A glimpse on constant delay enumeration, in: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Lyon, France, March 2014, pp. 13–27. [ DOI : 10.4230/LIPIcs.STACS.2014.13 ]

    https://hal.inria.fr/hal-01070893

Internal Reports

  • 23S. Abiteboul, F. Bancilhon, F. Bourdoncle, S. Clemencon, C. De La Higuera, G. Saporta, F. Fogelman Soulié.

    L'émergence d'une nouvelle filière de formation : « data scientists », Inria Saclay, April 2014.

    https://hal.inria.fr/hal-01092062
  • 24F. Jacquemard, L. Segoufin, J. Dimino.

    FO2(<,+1,  ) on data trees, data tree automata and an branching vector addition systems, Inria Saclay, January 2015, 32 p.

    https://hal.inria.fr/hal-00769249

Other Publications



previous Previous | up Home