Over the years, efficient algorithms have been proposed to realize logic functions on two-dimensional arrays of four-terminal switches, called switching lattices, using the fewest number of switches. Although existing algorithms can easily find a solution on logic functions with a small number of inputs and products, they can hardly handle large size instances. In order to cope with such logic functions, in this paper, we introduce SISYPHUS that exploits Boolean decomposition techniques and incorporates a state-of-art algorithm designed for the realization of logic functions using switching lattices. Experimental results indicate that SISYPHUS can find competitive solutions on logic functions with a small number of inputs and products when compared to those of previously proposed algorithms. Moreover, its solutions on large size functions are obtained using a little computational effort and are significantly better than the best solutions found so far