Links' Seminars and Public Events | ![]() ![]() |
2023 | |
---|---|
Thu 14th Dec 2:00 pm 5:00 pm | Claire Soyez-Martin PhD defense Amphi IRCICA |
Fri 1st Dec 10:00 am 11:00 am | Séminaire Oliver Titre: Direct Access for Conjunctive Queries with Negation Abstract: Direct Access is the operation of returning, given an index j, the jth answer of a conjunctive query on a given database for a given order. While this problem is #P-hard in general (wrt combined complexity), many conjunctive queries are structured enough so that for some lexicographical ordering of their answers, one can have a direct access to the answer set of a query Q that takes polylogarithmic time in the size of the database after a polynomial time precomputation. Previous work has precisely characterised the tractable classes and given fined-grained lower bounds on the time needed for precomputation depending on the structure of the query. We give a generalisation of these tractability results to the case of signed conjunctive queries, that is, conjunctive queries that may contain negative atoms. Our technique is based on solving the direct access task for a class of circuits that can represent relational data. Our result then follows from the fact that the tractable (signed) conjunctive queries can be transformed into polynomial size circuits. We recover the known tractable classes from the literature in the case of positive conjunctive queries using this technique and also discover new islands of tractability for signed conjunctive queries. In particular, our result generalises to the Direct Access Problem the known tractabilities of counting the number of answers to beta-acyclic negative queries and of deciding whether a negative query with bounded nested-width has an answer. This is joint work with Florent Capelli. |
Fri 24th Nov 10:00 am 11:00 am | Séminaire Pierre Vandenhove |
Fri 17th Nov 10:00 am 11:00 am | Séminaire Charles (RsonPath) TBA |
Fri 10th Nov 10:00 am 11:00 am | Séminaire Nils Vortmeier title: TBA |
Fri 20th Oct 10:30 am 12:30 pm | Aurelien part II |
Fri 22nd Sep 11:00 am 12:00 pm | Séminaire Théo Losekoot Title: Automata-based verification of relational properties of functions over algebraic data structures |
Fri 15th Sep 11:00 am 12:30 pm | Charles: Présentation de rsonpath |