algorithm,artificial-intelligence,pso

As amit suggested might be the case, this is in fact an NP-hard problem. Given a CNF formula, let S be in one-to-one correspondence with the set of all literals (positive and negative) plus one extra pair T and F. Make a set {T, F}. Make one two-element set per...