Links is a research project of Inria Lille, the University of Lille, and the CNRS (Cristal Lab).
Fri 16th Jul
ICALP 2021 Best Paper award for Charles Paperman et al.
Thu 22nd Apr
"Dynamic membership for regular languages" @ICALP21
Charles get a paper accepted @ICALP
Fri 2nd Apr
Mon 14th Dec
Soutenance de thèse - Jose-Martin Lozano
Wed 2nd Dec
AAAI 2021 paper accepted by Florent Capelli et. al.
Certifying Top-Down Decision-DNNF Compilers
Wed 2nd Dec
AAAI 2021 paper by Mikaël Monet et al. accepted
The Tractability of SHAP-Score-Based Explanations over Deterministic and Decomposable Boolean Circuits. arXiv: arxiv.org/abs/2007.14045
Fri 13th Nov
PODS 2021 paper accepted Corentin Barloy, Filip Murlak and Charles Paperman
Stackless Processing of Streamed Trees paperman.name/data/pub.....d.pdf
Thu 1st Oct
Mikael Monet arrives as Junior Researcher
Thu 1st Oct
Corentin Barloy starts his PhD project
Tue 29th Sep
ANR Project of Florent Capelli accepted. On knowledge compilation
Tue 1st Sep
Arrival of Chérif Ba as engineer
Mon 24th Aug
MFCS paper accepted by Paul Gallot, Aurélin Lemay and Sylvain Salvati: https://hal.inria.fr/hal-02902853
Fri 24th Jul
Dr. Momar Sakho defended his PhD.
Mon 6th Jul
to Fri 10th Jul
École d'été Kocoon (cancelled) organisée par Florent Capelli, Pierre Marquis, Stefan Mengel, and Pierre Bourhis, à Lille
More info at: kocoon.gforge.inria.fr/
Tue 30th Jun
ICALP 2020 paper by Charles Paperman accepted
On Polynomial Recursive Sequences ( Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michał Pilipczuk and Géraud Sénizergues ) drops.dagstuhl.de/opus.....7.pdf
Mon 16th Dec
to Thu 19th Dec
Workshop Kocoon at Arras, organized by Pierre Bourhis, Florent Capelli, Pierre Marquis and Stefan Mengel
More info at : kocoon.gforge.inria.fr/
Fri 27th Sep
Mikael Monet visiting
Tue 4th Jun
Arrivée de Fanny Canivet en stage de L3 : "Proof systems based on restricted Boolean circuits"
Fri 10th May
IJCAI'2019 paper by Sophie Tison et al. accepted.
In cooperation with Montpellier: Oblivious and Semi-Oblivious Boundedness for Existential Rules” (P. Bourhis, F. Ulliana, M. Leclère, ML Mugnier, S. Tison, L. Gallois).
Mon 22nd Apr
SAT'19 paper by Florent Capelli accepted
Fri 12th Apr
to Thu 18th Apr
Rustam Azimov from Saint Petersburg visits Links
Mon 1st Apr
to Fri 26th Apr
Semyon Grigorev from Saint Petersburg visits Links
Semyon is the supervisor of Rustam Azimov. He will work with Sylvain and Joachim
Fri 18th Jan
Visit of Marie-Laure Mugnier and Federico Ulliana from Montpellier
40 Avenue Halley, 59650 Villeneuve-d'Ascq, France
Thu 20th Dec
STACS'19 paper by Florent Capelli accepted: "Tractable QBF via Knowledge Compilation" with Stefan Mengel
Fri 16th Nov
Aurelien Lemay's Habilitation defense
Mon 5th Nov
Bruno Guillon arrives: our new postdoc working on distributed databases
Mon 15th Oct
to Tue 16th Oct
GT-Alga (Automata, Logic, Games & Algebra) of GDR IM. General meeting in Lille organised by Florent Capelli
40 Avenue Halley, 59650 Villeneuve d'Ascq, France
Mon 17th Sep
Mon 3rd Sep
Sławek Staworko's paper on SheX containment got accepted at PODS 2019!
Tue 28th Aug
to Fri 31st Aug
A major conference on logic in AI origanized in Lille.
EuraTechnologies, Lille, France
Mon 27th Aug
Rustam Azimov, a PhD student from Petersburg, starts his 3-months visit of Links. He will work with Sylvain Slavati and Joachim Niehren.
Mon 16th Apr
ICALP'18 paper accepted by Charles Paperman
Constrained Topological Sorting by Antoine Amarilli and Charles Paperman arxiv.org/pdf/1707.04310.pdf
Thu 15th Mar
ShEx 2.0 Release of Java Implementation
Thu 1st Feb
to Thu 8th Feb
Visit of Vincent Penelle, Université de Bordeaux
Tue 16th Jan
Visit of Yann Strozecki, Université de Versailles
Mon 8th Jan
Arrival of Jérémie Dusard
Jérémie will work as an engineer on ShEx with Iovka Boneva
Wed 3rd Jan
I. Boneva published a book published with the W3C on schemas validation for the semantic Web
The appearance of linked data on the web calls for novel database management technologies for linked data collections. The classical challenges from database research need to be now raised for linked data: how to define exact logical queries, how to manage dynamic updates, and how to automatize the search for appropriate queries. In contrast to mainstream linked open data, the LINKS project will focus on linked data collections in various formats, under the assumption that the data is correct in most dimensions. The challenges remain difficult due to incomplete data, uninformative or heterogeneous schemas, and the remaining data errors and ambiguities. We will develop algorithms for evaluating and optimizing logical queries on linked data collections, incremental algorithms that can monitor streams of linked data and manage dynamical updates of linked data collections, and symbolic learning algorithms that can infer appropriate queries for linked data collections from examples.
We will develop algorithms for answering logical querying on heterogeneous linked data collections in hybrid formats, distributed programming languages for managing dynamic linked data collections and workflows based on queries and mappings, and symbolic machine learning algorithms that can link datasets by inferring appropriate queries and mappings. Our main objectives are structured as follows:
- Querying heterogeneous linked data. We will develop new kinds of schema mappings for semi- structured datasets in hybrid formats including graph databases, rdf collections, and relational databases. These induce recursive queries on linked data collections for which we will investigate evaluation algo- rithms, static analysis problems, and concrete applications.
- Managing dynamic linked data. In order to manage dynamic linked data collections and workflows, we will develop distributed data-centric programming languages with streams and parallelism, based on novel algorithms for incremental query answering, will study the propagation of updates of dynamic data through schema mappings, and will investigate static analysis methods for linked data workflows.
- Linking graphs. Finally, we will develop symbolic machine learning algorithms, for inferring queries and mappings between linked data collections in various graphs formats from annotated examples.
International and industrial relations
- Stream Processing: QuiXTools (with Innovimax)
- FUI Hermes