1. Micah Adler and Neil Immerman. 2003. An n! lower bound on formula size. ACM Trans. Comput. Log. , Vol. 4, 3 (2003), 296--314. https://doi.org/10.1145/772062.772064
2. Noga Alon and Ravi B. Boppana. 1987. The monotone circuit complexity of boolean functions. Combinatorica , Vol. 7, 1 (01 Mar 1987), 1--22. https://doi.org/10.1007/BF02579196
3. Simone Bova and Hubie Chen. 2014. The Complexity of Width Minimization for Existential Positive Queries. In Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24--28, 2014. 235--244. https://doi.org/10.5441/002/icdt.2014.25
4. 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.
5. Simone Bova and Hubie Chen. 2017. How Many Variables Are Needed to Express an Existential Positive Query?. In 20th International Conference on Database Theory, ICDT 2017, March 21--24, 2017, Venice, Italy. 9:1--9:16. https://doi.org/10.4230/LIPIcs.ICDT.2017.9