Skip to main content

New answers tagged

0 votes

Is such variant of SAT always satisfiable?

Suppose we have a boolean formula containing multiple occurences of a pair $\{x_i,x_j\}$. Then we can eliminate repeating occurences of this pair by replacing every instance of $x_i\lor x_j$ with $y$ ...
rus9384's user avatar
  • 1,746

Top 50 recent answers are included