Simplifying Binary Propositional Theories into Connected Components Twice as Fast

Binary propositional theories, composed of clauses with at most two literals, are one of the most interesting tractable subclasses of the satisability problem. We present two hybrid simplication algorithms for binary theories, which combine the unit-resolution-based 2SAT algorithm BinSat [9] with rened versions of the classical strongly connected components (SCC) algorithm of [1]. We show empirically that the algorithms are considerably faster than other SCC-based algorithms, and have greater simplifying power, as they combine detection of entailed literals with identication of SCCs, i.e. sets of equivalent literals