Simulating game playing to solve Max-SAT

The Max-SAT can naturally model many practical optimization problems. In this paper, we propose an incomplete Max-SAT algorithm bgmaxsat, which utilizes boolean game to model and solve Max-SAT problems. Then we improve bgmaxsat by adding a new agents grouping criterion to solve massive instances, called bgmaxsat_m. In order to obtain quality solution quickly, we design two mechanisms to accelerate the game playing. Finally, we evaluate our algorithms against with the state-of-the-art SLS-based algorithms CCLS and Swcca-ms on 87 selected Max-SAT instances. The experimental results show that bgmaxsat finds optimal solutions on 65(65) general instances with competitive CPU time, and bgmaxsat_m finds better solutions on 19(22) massive instances with less CPU time.

[1]  Matthias Poloczek,et al.  Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds , 2017, SIAM J. Comput..

[2]  Zheng Zhu,et al.  borealis—A generalized global update algorithm for Boolean optimization problems , 2016, Optimization Letters.

[3]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[4]  Sarit Kraus,et al.  Manipulating Games by Sharing Information , 2014, Stud Logica.

[5]  Joao Marques-Silva,et al.  Iterative and core-guided MaxSAT solving: A survey and assessment , 2013, Constraints.

[6]  Jianer Chen,et al.  Tight Bound on Johnson's Algorithm for Maximum Satisfiability , 1999, J. Comput. Syst. Sci..

[7]  Roberto Battiti,et al.  Reactive search, a history-sensitive heuristic for MAX-SAT , 1997, JEAL.

[8]  Kaile Su,et al.  Configuration Checking with Aspiration in Local Search for SAT , 2012, AAAI.

[9]  Raghuram Ramanujan,et al.  Monte-Carlo Tree Search for the Maximum Satisfiability Problem , 2016, CP.

[10]  Kaile Su,et al.  Local search for Boolean Satisfiability with configuration checking and subscore , 2013, Artif. Intell..

[11]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[12]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[13]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[14]  Kaile Su,et al.  Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving , 2007, IJCAI.

[15]  Sarit Kraus,et al.  Manipulating Boolean Games through Communication , 2011, IJCAI.

[16]  Jing Liu,et al.  Solving SAT problem with a multiagent evolutionary algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[18]  Wei Wu,et al.  CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability , 2015, IEEE Transactions on Computers.

[19]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[20]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[21]  Asaf Shapira,et al.  Randomized greedy: new variants of some classic approximation algorithms , 2011, SODA '11.

[22]  Kaile Su,et al.  CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability , 2017, Artif. Intell..