1. A. Biere et al., eds., Handbook of Satisfiability, vol. 185. Frontiers in Artificial Intelligence and Applications (IOS Press, New York, 2009). ISBN: 978-1-58603-929-5
2. S. Cook, The complexity of theorem-proving procedures, in Proceedings of the Third Annual ACMSymposium on Theory of Computing. STOC (ACM, Shaker Heights, 1971), pp. 151–158. https://doi.org/10.1145/800157.805047
3. M.J.H. Heule, O. Kullmann, V.W. Marek, Solving and verifying the Boolean pythagorean triples problem via cube-and-conquer, in Theory and Applications of Satisfiability Testing—SAT 2016, ed. by N. Creignou, D. Le Berre (Springer, Cham, 2016), pp. 228–245. ISBN: 978-3-319-40970-2. https://doi.org/10.1007/978-3-319-40970-2_15
4. C. Posthoff, B. Steinbach, The solution of discrete constraint problems using Boolean models, in Proceedings of the 2nd International Conference on Agents and Artificial Intelligence, ed. by J. Filipe, A. Fred, B. Sharp. ICAART 2 (Valencia, Spain, 2010), pp. 487–493. ISBN: 978-989-674-021-4
5. B. Schwarzkopf, Without cover on a rectangular chessboard, in Feenschach (1990). German title: “Ohne Deckung auf dem Rechteck”, pp. 272–275