Core-Guided Binary Search Algorithms for Maximum Satisfiability

@inproceedings{Heras2011CoreGuidedBS,
  title={Core-Guided Binary Search Algorithms for Maximum Satisfiability},
  author={Federico Heras and Ant{\'o}nio Morgado and Joao Marques-Silva},
  booktitle={AAAI},
  year={2011}
}

• Federico Heras, António Morgado, Joao Marques-Silva
• Published in AAAI 2011

Several MaxSAT algorithms based on iterative SAT solving have been proposed in recent years. These algorithms are in general the most efficient for real-world applications. Existing data indicates that, among MaxSAT algorithms based on iterative SAT solving, the most efficient ones are core-guided, i.e. algorithms which guide the search by iteratively computing unsatisfiable subformulas (or cores). For weighted MaxSAT, core-guided algorithms exhibit a number of important drawbacks, including a… CONTINUE READING

View PDF

Save to Library

Create Alert

Cite