Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers
MaxSAT is an optimization version of the famous NP-complete Satisfiability problem (SAT).
Algorithms for MaxSAT mainly include complete solvers and local search incomplete …
Algorithms for MaxSAT mainly include complete solvers and local search incomplete …
Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
Though numerous solvers have been proposed for the MaxSAT problem, and the
benchmark environment such as MaxSAT Evaluations provides a platform for the …
benchmark environment such as MaxSAT Evaluations provides a platform for the …