New article in Artificial Intelligence
The article Polynomial Calculus for Optimization just appeared in the journal Artificial Intelligence!
This is joint work with Maria Luisa Bonet (UPC) and Jordi Levy (IIIA-CSIC).
Abstract
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. Weighted Polynomial Calculus is a natural generalization of MaxSAT-Resolution and weighted Resolution that manipulates polynomials with coefficients in a finite field and either weights in