As is normally the case in CLP, deductive search is used alongside constraint resolution.
this paper identifies what it is precisely about this extra functionality that we miss (modularity, Section 2), determines what it would take at a minimum computationally to get it back (delaying, Section 3), and attempts to measure exactly how much that minimal computational overhead would cost (about 4 µs per delay, Section 4).