In this paper we present the weak looking-ahead strategy (WLA), a consistency technique on finite domains combining the computational efficiency of forward-checking with the pruning power of looking-ahead. We show that by integrating weak looking-ahead into PROLOG's SLD resolution we obtain a sound and complete inference rule, whereas standard looking-ahead itself has been shown to be incomplete. We outline how we use the weak looking-ahead technique for lathe tool selection in a CIM environment.