Section: Highlights of the Year

Highlights of the Year

Data Integration and Schema Validation

The ShEx language for defining RDF schemas was proposed and developed earlier by the Links team in cooperation with the W3C. S. Staworko et al. now studied the containment problem for ShEx schemas for RDF documents. They showed at PODS [10] – the best database theory conference – that the problem is decidable, but co-NEXP-hard. This is a joint work with P. Wieczorek from the University of Wroclaw, Poland.


Florent Capelli et al. showed at STACS [7] – a top conferences in theoretical computer science – a new knowledge compilation procedure for quantified Boolean formulas allowing to decide the satisfiability quantified Boolean formulas with bounded tree width in polynomial time. This can be applied in particular to first-order database queries with quantifiers. This is joined work with S. Mengel from the CNRS in Lens.