Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
Many reasoning problems are based on the problem of satisfiability (SAT).While SAT itself becomes easy when Pregnancy restricting the structure of the formulas in a certain way, the situation is more opaque for more involved decision problems.We consider here the CardMinSat problem which asks, given a propositional formula $phi$ and an atom $x$, wh