A Compact Reformulation of Propositional Satisfiability as Binary Constraint Satisfaction ?