1. Principles of Constraint Programming
2. Baral, C. (2010). Knowledge representation, reasoning and declarative problem solving. Cambridge: Cambridge University Press.
3. Bayardo, R. & Schrag, R. (1997). Using CSP look-back techniques to solve real-world SAT instances. In 14th national conference on artificial intelligence. Menlo Park, CA: AAAI Press.
4. Beckers, S., De Samblanx, G., De Smedt, F., Goedemé, T., Struyf, L. & Vennekens, J. (2011). Parallel SAT-solving with OpenCL. In H. Weghorn, L. Azevedo, & P. Isaias (Eds.), Proceedings of the IADIS international conference on applied computing (pp. 435–441). Lisbon: IADIS.
5. Bell, N. & Garland, M. (2008). Efficient sparse matrix-vector multiplication on CUDA. Tech. Rep. No. NVR-2008-004. Santa Clara, CA: NVIDIA Corporation.