We present a finite representation of all substitutable services P ′ of a given service P . We show that our approach can be used for at least two applications: (1) given a finite set of services P = {P1, ..., Pn}, we provide a representation of all services P ′ that can substitute every Pi ∈ P, and (2) given a service P ′′ that cannot substitute a service P , we find the most similar service P...