Lübke, OleOleLübkeSchupp, SibylleSibylleSchupp2022-12-122022-12-122022Bacchus, F., Berg, J., Järvisalo, M., Martins, R., & Niskanen, A. (Eds.) (2022). MaxSAT Evaluation 2022: Solver and Benchmark Descriptions. (Department of Computer Science Series of Publications B; Vol. B-2022-2). Department of Computer Science, University of Helsinki. - Seite 29-30 (2022)http://hdl.handle.net/11420/14317Since 2019, all solvers in the incomplete track of the MaxSAT Evaluation (MSE) include a dedicated SAT solver. In resource-constrained computing environments, e.g., embedded systems, such algorithm designs can be hard to realize. Yet, the MSE results show an undeniable increase in efficiency when using a SAT solver. With noSAT-MaxSAT, we propose to replace the call to a SAT solver by executing the MaxSAT solver only on the hard clauses of the formula instead. The algorithm is based on SATLike, which was was the only algorithm that did not rely on a SAT solver in the MaxSAT Evaluation 2018. Additionally, our implementation satisfies a set of requirements often found in embedded system software.enhttps://creativecommons.org/licenses/by-sa/4.0/MaxSATInformatikConference Paper10.15480/882.476910.15480/882.476910138/347396Helsinki Institute for Information Technology, Department of Computer ScienceOther