1. Apt, K.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
2. Bergenti, F., Monica, S.: Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form. Ann. Math. Artif. Intell. 80(2), 131–151 (2017)
3. Bergenti, F., Monica, S.: Satisfaction of polynomial constraints over finite domains using function values. In: Della Monica, D., Murano, A., Rubin, S., Sauro, L. (eds.) Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic (ICTCS 2017 and CILC 2017), CEUR Workshop Proceedings, vol. 1949, pp 262–275. RWTH Aachen (2017)
4. Bergenti, F., Monica, S.: Simple and effective sign consistency using interval arithmetic. In: Casagrande, A., Omodeo, E.G. (eds.) Proceedings of the 34th Italian Conference on Computational Logic (CILC 2019), CEUR Workshop Proceedings, vol. 2396, pp 89–103. RWTH Aachen (2019)
5. Bergenti, F., Monica, S., Rossi, G.: Polynomial constraint solving over finite domains with the modified Bernstein form. In: Fiorentini, C., Momigliano, A. (eds.) Proceedings of the 31st Italian Conference on Computational Logic (CILC 2016), CEUR Workshop Proceedings, vol. 1645, pp 118–131. RWTH Aachen (2016)