A Local Search Algorithm for MaxSMT(LIA)
<|reference_start|>A Local Search Algorithm for MaxSMT(LIA): MaxSAT 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.<|reference_end|>
@article{he2024a,
    title={A Local Search Algorithm for MaxSMT(LIA)},
    author={Xiang He, Bohan Li, Mengyu Zhao and Shaowei Cai},
    journal={arXiv preprint arXiv:2406.15782},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.15782},
    primaryClass={cs.SC cs.LO}
}