5 papers
Solving Hard XAI Queries Based on a Compiled Dual-Rail Encoding
Arthur Ledaguenel, Florent Capelli, Jean-Marie Lagniez
The widespread adoption of artificial intelligence (AI) within real-world applications has raised a lot of concerns regarding their trustworthiness, especially in critical applicat…
A Simple Algorithm for Worst-Case Optimal Join and Sampling
Florent Capelli, Oliver Irwin, Sylvain Salvati
We present an elementary branch and bound algorithm with a simple analysis of why it achieves worstcase optimality for join queries on classes of databases defined respectively by…
Tractable Circuits in Database Theory
Antoine Amarilli, Florent Capelli
This work reviews how database theory uses tractable circuit classes from knowledge compilation. We present relevant query evaluation tasks, and notions of tractable circuits. We t…
A Knowledge Compilation Take on Binary Polynomial Optimization
Florent Capelli, Alberto Del Pia, Silvia Di Gregorio
The Binary Polynomial Optimization (BPO) problem is defined as the problem of maximizing a given polynomial function over all binary points. The main contribution of this paper is…
Direct Access for Conjunctive Queries with Negations
Florent Capelli, Nofar Carmeli, Oliver Irwin +1
Given a conjunctive query and a database , a direct access to the answers of over is the operation of returning, given an index , the -th answer for some order…