On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving

Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce · Journal on Satisfiability Boolean Modeling and Computation · 2015

In recent years, unsatisfiability-based algorithms have become prevalent as state of the art for solving industrial instances of Maximum Satisfiability (MaxSAT). These algorithms perform a succession of unsatisfiable SAT solver calls until an optimal

Read the paper · More papers on PaperTik