1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.AI2021★ 1 cited
QDEF and Its Approximations in OBDM
Gianluca Cima, Federico Croce, Maurizio Lenzerini
Given an input dataset (i.e., a set of tuples), query definability in Ontology-based Data Management (OBDM) amounts to find a query over the ontology whose certain answers coincide…
cs.DS2018
Approximating the Incremental Knapsack Problem
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
We consider the 0-1 Incremental Knapsack Problem (IKP) where the capacity grows over time periods and if an item is placed in the knapsack in a certain period, it cannot be removed…