Experience

  • How-Provenance Polynomials for Efficient and Greener Rule Mining
    PhD
    September 2023 - now
    Supervised by Luis Galárraga and Alexandre Termier in the LACODAM team (IRISA, Rennes).
  • How-Provenance Polynomials for Efficient and Greener Rule Mining
    Research internship
    January - July 2023
    Supervised by Luis Galárraga and Alexandre Termier in the LACODAM team (INRIA, Rennes).
  • Learning abstractions on large transition systems using graph neural networks
    Graph neural network architecture for bisimulation.
    Research internship
    May - July 2022
    Supervised by Guillermo A. Perez (Antwerpen University, Belgium).
  • Connected Multi-Agent Path Finding
    Design and implementation in C++ of a RRT-based algorithm solving the CMAPF problem.
    Research project
    September 2021 - May 2022
    Supervised by Ocan Sankur and François Schwarzentruber in the LogicA team (IRISA, Rennes).
  • Connected Multi-Agent Path Finding
    Design and implementation in Python of a divide and conquer algorithm solving the CMAPF problem.
    Study of CMAPF complexity.
    Research internship
    May - July 2021
    Supervised by François Schwarzentruber in the LogicA team (IRISA, Rennes).

Publications

  • Isseïnie Calviac, Ocan Sankur, and François Schwarzentruber. 2023. Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding. In Proc. of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2023), London, United Kingdom, May 29 – June 2, 2023, IFAAMAS, 9 pages.
  • Luis Galárraga, Julianne Guerbette, Isseïnie Sinouvassane and Paul Viallard. 2026. Mini-AMIE: Quick and Dirty Rule Mining on Knowledge Graphs. In Proceedings of the ACM Web Conference 2026. Dubai, United Arab Emirates, April 13 - 17, 2026, p. 8689-8692.