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}
}
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

Citations

Publications citing this paper.
SHOWING 1-10 OF 54 CITATIONS, ESTIMATED 91% COVERAGE

Solving MaxSAT by Successive Calls to a SAT Solver

VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Improving linear search algorithms with model-based approaches for MaxSAT solving

  • J. Exp. Theor. Artif. Intell.
  • 2015
VIEW 13 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Theory and Applications of Satisfiability Testing – SAT 2013

  • Lecture Notes in Computer Science
  • 2013
VIEW 22 EXCERPTS
HIGHLY INFLUENCED

An Empirical Study of Encodings for Group MaxSAT

  • Canadian Conference on AI
  • 2012
VIEW 12 EXCERPTS
CITES BACKGROUND

Improved Algorithm of Unsatisfiability-based Maximum Satisfiability

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

SAT-Based Approaches to Treewidth Computation: An Evaluation

  • 2014 IEEE 26th International Conference on Tools with Artificial Intelligence
  • 2014
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2012
2019

CITATION STATISTICS

  • 8 Highly Influenced Citations