A method for inferring latches from combinational loops in a netlist using boolean equations is proposed in this paper. The method takes advantage of the solutions structure of the latch loop boolean equation that allows us to obtain a phase and permutation independent procedure for latch inference. This method allows a better latch matching in equivalence checking tools.