I have succesfully used the Google OR Tools to solve a complex matching problem.
However I want to know how the solver really works. Are there any public essays or books which explain the CP-SAT Solver nearly? Are complex sum constraints really translated in cnf since it is a Sat-Solver?

I tried to find some public articles which could answer these questions in depth but I did not find any.