MaxSAT by Improved Instance-Specific Algorithm Configuration

We show how both techniques can be combined MaxSAT is the optimization version of the Satisfiability and empirically demonstrate on SAT that our improved (SAT) problem. It can be used effectively to model problems method works notably better than the original method and in several domains, such as scheduling, timetabling, other instance-specific algorithm tuners. We then apply the FPGA routing, design and circuit debugging, software package new technique to MaxSAT. Finally, in extensive experiments installation, bioinformatics, probabilistic reasoning, etc. we show that the developed solvers significantly outperform From the research perspective, MaxSAT is also of particular the current state-of-the-art in every MaxSAT domain.