In this article, we consider the set covering problem with conflict constraints, i.e., from each conflicting pair of columns at most one column can appear in feasible solution. For problem, propose appropriate pre-processing techniques and several families Valid Inequalities (VIs) for corresponding integer programming model that result simultaneous presence constraints stable (conflict) constra...