2 papers
cs.DB2026
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…
math.OC2024
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…