Approximating Weighted Max-SAT Problems by Compensating for Relaxations

@inproceedings{Choi2009ApproximatingWM,
  title={Approximating Weighted Max-SAT Problems by Compensating for Relaxations},
  author={Arthur Choi and Trevor Scott Standley and Adnan Darwiche},
  booktitle={CP},
  year={2009}
}
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its structure until it is tractable for exact algorithms. Second, we compensate for the relaxation by introducing auxiliary weights. More specifically, we relax equivalence constraints from a given Max-SAT problem, which we compensate for by recovering a weaker notion of equivalence. We provide a simple algorithm for finding… CONTINUE READING
BETA
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…