Extending Resolution by Dynamic Substitution of Boolean Functions
S. Jabbour, Jerry Lonlac, Lakhdar Saïs · 2012
This paper presents a dynamic substitution technique of Boolean functions. It first recovers a set of Boolean functions from Boolean formula in conjunctive normal form (CNF). Then these functions are used to reduce the size of the learnt clauses by substituting the input arguments by the output ones. Preliminary experiments show the feasibility of our approach on some classes of SAT instances taken from the recent SAT Race and competitions.