Solving Temporal CSPs via Enumeration and SAT Compilation

The constraint satisfaction problem (CSP) is a powerful framework used in theoretical computer science for formulating a  multitude of problems.The CSP over a constraint language Γ (CSP(Γ)) is the ...