The -subsumption test is known to be a bottleneck in Inductive Logic Programming (ILP). The state-of-the-art learning systems in this field are not scalable. We introduce a new model of -subsumption and an algorithm based on an actor model, with the aim of being able to decide subsumption on very large clauses.