MaxSAT is the problem of finding an assignment satisfying the maximum number of clauses in a CNF formula. We consider a natural generalization of this problem to generic sets of polynomials and propose a weighted version of Polynomial Calculus to address this problem.

中文翻译：

---

用于优化的多项式演算


MaxSAT 是查找满足 CNF 公式中最大子句数的赋值的问题。我们考虑将这个问题自然推广到通用的多项式集，并提出了多项式微积分的加权版本来解决这个问题。