1. Alviano, M., Dodaro, C.: Anytime answer set optimization via unsatisfiable core shrinking. Theory Pract. Log. Program. 16(5–6), 533–551 (2016)
2. Arocena, P.C., Glavic, B., Ciucanu, R., Miller, R.J.: The iBench integration metadata generator. In: Li, C., Markl, V. (eds.) Proceedings of Very Large Data Bases (VLDB) Endowment, vol. 9:3, pp. 108–119. VLDB Endowment, November 2015. https://github.com/RJMillerLab/ibench
3. Audemard, G., Boussemart, F., Lecoutre, C., Piette, C.: XCSP3: An XML-Based Format Designed to Represent Combinatorial Constrained Problems. http://xcsp.org (2016)
4. Bannach, M., Berndt, S., Ehlers, T.: Jdrasil: a modular library for computing tree decompositions. In: Iliopoulos, C.S., Pissis, S.P., Puglisi, S.J., Raman, R. (eds.) 16th International Symposium on Experimental Algorithms, SEA 2017, 21–23 June 2017, London, UK, LIPIcs, vol. 75, pp. 28:1–28:21. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)
5. Benedikt, M., Konstantinidis, G., Mecca, G., Motik, B., Papotti, P., Santoro, D., Tsamoura, E.: Benchmarking the chase. In: Geerts, F. (ed.) Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2017), pp. 37–52. Association for Computing Machinery, New York, Chicago (2017). https://github.com/dbunibas/chasebench