We define a clause tableau calculus for MinSAT, and prove its soundness and completeness. The calculus allows one to compute the maximum number of clauses that can be falsified in a multiset of clauses by applying, finitely many times, tableaux-like inference rules. We also describe how the calculus can be extended to solve weighted MinSAT and weighted partial MinSAT.