no code implementations • 16 Aug 2020 • Balder ten Cate, Victor Dalmau
We answer the question which conjunctive queries are uniquely characterized by polynomially many positive and negative examples, and how to construct such examples efficiently.
no code implementations • 28 Dec 2019 • Pablo Barcelo, Victor Dalmau, Cristina Feier, Carsten Lutz, Andreas Pieris
For querying in the presence of constraints, we consider classes of constraint-query specifications (CQSs) that bundle a set of constraints with an actual query.
no code implementations • 15 Jun 2017 • Victor Dalmau
The present pa- per embarks into a systematic investigation on the circumstances under which it is possible to obtain efficient and complete domain filtering algorithms for conjunctions of among constraints.
