Abstract
AbstractMaxSAT modulo theories (MaxSMT) is an important generalization of Satisfiability modulo theories (SMT) with various applications. In this paper, we focus on MaxSMT with the background theory of Linear Integer Arithmetic, denoted as MaxSMT(LIA). We design the first local search algorithm for MaxSMT(LIA) called PairLS, based on the following novel ideas. A novel operator called pairwise operator is proposed for integer variables. It extends the original local search operator by simultaneously operating on two variables, enriching the search space. Moreover, a compensation-based picking heuristic is proposed to determine and distinguish the pairwise operations. Experiments are conducted to evaluate our algorithm on massive benchmarks. The results show that our solver is competitive with state-of-the-art MaxSMT solvers. Furthermore, we also apply the pairwise operation to enhance the local search algorithm of SMT, which shows its extensibility.
Publisher
Springer Nature Switzerland
Reference34 articles.
1. Albert, E., Gordillo, P., Rubio, A., Schett, M.A.: Synthesis of super-optimized smart contracts using Max-SMT. In: Lahiri, S.K., Wang, C. (eds.) Computer Aided Verification: 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21–24, 2020, Proceedings, Part I, pp. 177–200. Springer International Publishing, Cham (2020). https://doi.org/10.1007/978-3-030-53288-8_10
2. Ansótegui, C., Bonet, M.L., Levy, J.: Sat-based MaxSAT algorithms. Artif. Intell. 196, 77–105 (2013)
3. Balint, A., Schöning, U.: Choosing probability distributions for stochastic local search and the role of make versus break. In: Proceedings of SAT 2012, pp. 16–29 (2012)
4. Biere, A., Splatz, L., Plingeling, T.: YalSAT entering the SAT competition 2016. In: Proceedings of SAT Competition 2016, pp. 44–45 (2016)
5. Bjørner, N.S., Phan, A.D.: $$\nu $$z-maximal satisfaction with z3. Scss 30, 1–9 (2014)