Viability theory provides an efficient framework for looking for zeros of multivalued equations: 0 F(x). The main idea is to consider solutions of a suitable differential inclusion, viable in graph ofF. The choice of the differential inclusion is guided necessarily by the fact that any solution should converge or go through a zero of the multivalued equation. We investigate here a new understanding of the well-known Newton's method, generalizing it to set-valued equations and set up a class of algorithms which involve generalization of some homotopic path algorithms.