Resyn

Headers: mockturtle/algorithms/resyn_engines/mig_resyn.hpp, mockturtle/algorithms/resyn_engines/xag_resyn.hpp

The problem of logic resynthesis is defined as follows:

Given a target function \(f\) and a set of divisor functions \(g_1, ..., g_n\), find a dependency function \(h\) such that \(f=h(g_1, ..., g_n)\).

Specifically, the dependency function is represented by a dependency circuit of a certain network type and we aim at finding a small dependency circuit. The logic resynthesis engines can be used in resubstitution to find the replacement for the root node. Interfacing resubstitution functors (see resubstitution_structure of the resubstitution framework) are provided in mockturtle/algorithms/mig_resub.hpp and mockturtle/algorithms/sim_resub.hpp.