1. Advances in WASP;Alviano,2015
2. Amendola, G., Cuteri, B., Ricca, F., Truszczynski, M., 2022. Solving problems in the polynomial hierarchy with ASP(Q). In: Gottlob, G., Inclezan, D., Maratea, M. (Eds.) Proceedings of the Logic Programming and Nonmonotonic Reasoning - 16th International Conference, LPNMR 2022, Genova, Italy, September 5-9, 2022, volume 13416 of Lecture Notes in Computer Science, pp. 373–386. Springer
3. Beyond NP: Quantifying over answer sets;Amendola;Theory Pract. Log. Program,2019
4. Amendola, G., Rotondaro, G., 2021. Modeling clique coloring via ASP(Q). In: Arias, J., D’Asaro, F.A., Dyoub, A., Gupta, G., Hecher, M., LeBlanc, E., Peñaloza, R., Salazar, E., Saptawijaya, A., Weitkämper, F., Zangari, J. (Eds.) Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021), Porto, Portugal (virtual), September 20th-21st, 2021, volume 2970 of CEUR Workshop Proceedings. CEUR-WS.org.
5. Principles of Constraint Programming;Apt,2003