1. Alviano, M.: Algorithms for solving optimization problems in answer set programming. Intelligenza Artificiale 12, 1–14 (2018). https://doi.org/10.3233/IA-180119
2. Andres, B., Kaufmann, B., Matheis, O., Schaub, T.: Unsatisfiability-based optimization in clasp. In: Dovier, A., Costa, V.S. (eds.) Technical Communications of the 28th International Conference on Logic Programming (ICLP 2012). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 17, pp. 211–221. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2012). https://doi.org/10.4230/LIPIcs.ICLP.2012.211, http://drops.dagstuhl.de/opus/volltexte/2012/3623
3. Argelich, J., Li, C.M., Manyà, F., Planes, J.: The first and second max-sat evaluations. J. Satisf. Boolean Model. Comput. 4, 251–278 (2008)
4. Argelich, J., Lynce, I., Marques-Silva, J.: On solving boolean multilevel optimization problems. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp. 393–398. IJCAI 2009, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2009)
5. Brewka, G., Delgrande, J.P., Romero, J., Schaub, T.: asprin: Customizing answer set preferences without a headache. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, Texas, USA. pp. 1467–1474 (2015). http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9535