The Satisfiability problem (SAT) is of fundamental importance in computer
science and information technology [1]}. Its optimization version, the Maximum
Satisfiability problem (MaxSAT) plays a similar role in the study of computational
optimization, in particular in the study of approximation algorithms [2]}.
Since the problems are NP-hard [3]}, different algorithmic approaches, including
heuristic algorithms (e.g., [4]}, [5]}), approximation algorithms (e.g.,
[6]}, [7]}), and exact and parameterized algorithms (e.g.,
[8]}, [9]}, [10]}), have been extensively studied.
