Iterated calculation of global implications and recursive learning in combinational equivalence checking

Boolean satisfiability and recursive learning have been used in solving the combinational equivalence-checking problem. In this paper, we extend the recursive learning procedure and integrate it with global implications calculated in an iterative way to reduce the time needed for the solution. We also propose a variable ordering scheme to minimize the number of iterations needed to calculate the implications.