Finding infeasible sets of constraints (CSP)
If your system of constraints is expressed as a SAT instance, then this is known as the MAX-SAT problem.  MAX-SAT is harder than SAT, but there are standard algorithms.  The case of other discrete constraints can be reduced to Weighted MAX-SAT.