1. 2011, S.C.: Sat competition 2011: Benchmark submission guidelines (2011). https://satcompetition.github.io/2023/benchmarks.html. Accessed 9 Feb 2024
2. Abate, P., Di Cosmo, R., Gousios, G., Zacchiroli, S.: Dependency solving is still hard, but we are getting better at it. In: 2020 IEEE 27th International Conference on Software Analysis, Evolution and Reengineering (SANER), pp. 547–551. IEEE (2020)
3. Arora, S., Barak, B.: Computational complexity: a modern approach. Cambrtidge University Press (2009)
4. Balyo, T., Heule, M., Iser, M., Järvisalo, M., Suda, M. (eds.): Proceedings of SAT Competition 2023: Solver, Benchmark and Proof Checker Descriptions. Department of Computer Science Series of Publications B, Department of Computer Science, University of Helsinki, Finland (2023)
5. Barták, R., Salido, M.A., Rossi, F.: Constraint satisfaction techniques in planning and scheduling. J. Intell. Manuf. 21, 5–15 (2010)