Core-Guided Binary Search Algorithms for Maximum Satisfiability

Abstract

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… (More)

Topics

2 Figures and Tables

Statistics

010203020112012201320142015201620172018
Citations per Year

77 Citations

Semantic Scholar estimates that this publication has 77 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics