1. Learning and verifying quantified boolean queries by example
2. Interpreting nowhere dense graph classes as a classical notion of model theory
3. Characterizing schema mappings via data examples
4. Pablo Barceló and Miguel Romero . 2017 . The Complexity of Reverse Engineering Problems for Conjunctive Queries. In 20th International Conference on Database Theory, ICDT 2017 , March 21 --24 , 2017, Venice, Italy (LIPIcs, Vol. 68), Michael Benedikt and Giorgio Orsi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 7:1--7: 17 . https://doi.org/10.4230/LIPIcs.ICDT.2017.7 Pablo Barceló and Miguel Romero. 2017. The Complexity of Reverse Engineering Problems for Conjunctive Queries. In 20th International Conference on Database Theory, ICDT 2017, March 21--24, 2017, Venice, Italy (LIPIcs, Vol. 68), Michael Benedikt and Giorgio Orsi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 7:1--7:17. https://doi.org/10.4230/LIPIcs.ICDT.2017.7
5. Learnability and the Vapnik-Chervonenkis dimension