DeMiK – Declarative Mining in Knowledge Graphs

The DeMiK aims to develop advanced declarative mining methods for knowledge graphs by integrating Constraint Programming (CP). In view of the increasing complexity of modern data and graph structures, this project aims to develop interactive and flexible algorithms that extract relevant patterns while ensuring dynamic management of evolving graphs. By using declarative approaches, it enables the modelling of complex declarative queries on relationship-rich graphs, while ensuring effective CP reasoning and enhanced user interactivity. The DeMiK has concrete applications in several domains, including rule mining, causal discovery in agroecology, program verification, and automated driving. It will collaborate with academic and industrial partners including SIMULA Oslo, CEA Paris-Saclay, IDEEV Paris-Saclay, and UVSQ’s DAVID Lab.