Improvements to Core-Guided Binary Search for MaxSAT

@inproceedings{Morgado2012ImprovementsTC,
  title={Improvements to Core-Guided Binary Search for MaxSAT},
  author={Ant{\'o}nio Morgado and Federico Heras and Joao Marques-Silva},
  booktitle={SAT},
  year={2012}
}
Maximum Satisfiability(MaxSAT) and its weighted variants are wellknown optimization formulations of Boolean Satisfiability(SAT). Motivated by practical applications, recent years have seen the development of core-guided algorithmsfor MaxSAT. Among these, core-guided binary search with disjoint cores(BCD) represents a recent robust solution. This paper identifies a number of inefficiencies in the original BCD algorithm, related with the computation of lower andupper boundsduring the execution of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 23 references

New Inference Rules for Max-SAT

J. Artif. Intell. Res. • 2007
View 4 Excerpts
Highly Influenced

and R

M. Koshimura, T. Zhang, H. Fujita
Hasegawa. QMaxSAT: A partial Max-SAT solver.JSAT, pages 95–100, • 2012
View 2 Excerpts

Boolean lexicographic optimization: algorithms & applications

Annals of Mathematics and Artificial Intelligence • 2011
View 1 Excerpt

The MSUnCore Ma xSAT solver

A. Morgado, F. Heras, J. Marques-Silva
InPOS, • 2011
View 2 Excerpts

, and J . Planes . Algorithms for weighted Boolean optimization

I. Lynce
2009

H

A. Biere, M. Heule
van Maaren, and T. Walsh, editors. Handbook of Satisfiability , • 2009
View 2 Excerpts

Similar Papers

Loading similar papers…