Anbulagan, AnbuGrastien, AlbanBulitko, V.Beck, J. C.2015-12-07August 8-19781577354338http://hdl.handle.net/1885/23902In the satisfiability domain, it is well-known that a SAT algorithm may solve a problem instance easily and another instance hardly, whilst these two instances are equivalent CNF encodings of the original problem. Moreover, different algorithms may disagr20092022-08-07