1. S. Abiteboul, R. Hull, and V. Vianu. 1995. Foundations of Databases .Addison-Wesley.
2. Manuel Bodirsky and Jan Kára. 2010. The complexity of temporal constraint satisfaction problems. J. ACM , Vol. 57, 2 (2010).
3. Manuel Bodirsky, H. Dugald Macpherson, and Johan Thapper. 2013. Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Trans. Comput. Log. , Vol. 14, 4 (2013), 30:1--30:19.
4. Simone Bova and Hubie Chen. 2014. The Complexity of Width Minimization for Existential Positive Queries. In ICDT . 235--244.
5. Simone Bova and Hubie Chen. 2015. The complexity of equivalence, entailment, and minimization in existential positive logic. J. Comput. Syst. Sci. , Vol. 81, 2 (2015), 443--457.