CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability

The maximum satisfiability (MAX-SAT) problem, especially the weighted version, has extensive applications. Weighted MAX-SAT instances encoded from real-world applications may be very large, which calls for efficient approximate methods, mainly stochastic local search (SLS) ones. However, few works exist on SLS algorithms for weighted MAX-SAT. In this paper, we propose a new heuristic called CCM for weighted MAX-SAT. The CCM heuristic prefers to select a CCMP variable. By combining CCM with random walk, we design a simple SLS algorithm dubbed CCLS for weighted MAX-SAT. The CCLS algorithm is evaluated against a state-of-the-art SLS solver IRoTS and two state-of-the-art complete solvers namely akmaxsat_ls and New WPM2, on a broad range of weighted MAX-SAT instances. Experimental results illustrate that the quality of solution found by CCLS is much better than that found by IRoTS, akmaxsat_ls and New WPM2 on most industrial, crafted and random instances, indicating the efficiency and the robustness of the CCLS algorithm. Furthermore, CCLS is evaluated in the weighted and unweighted MAX-SAT tracks of incomplete solvers in the Eighth Max-SAT Evaluation (Max-SAT 2013), and wins four tracks in this evaluation, illustrating that the performance of CCLS exceeds the current state-of-the-art performance of SLS algorithms on solving MAX-SAT instances.

[1]  Thomas Stützle,et al.  Iterated Robust Tabu Search for MAX-SAT , 2003, Canadian Conference on AI.

[2]  Matthias Poloczek,et al.  An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem , 2016, SEA.

[3]  Djamal Habet,et al.  Inference Rules in Local Search for Max-SAT , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[4]  Daniel Berend,et al.  The Normalized Autocorrelation Length of Random Max r -Sat Converges in Probability to (1-1/2^r)/r , 2016, SAT.

[5]  Holger H. Hoos,et al.  UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT , 2004, SAT.

[6]  Vasco M. Manquinho,et al.  Exploiting Cardinality Encodings in Parallel Maximum Satisfiability , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[7]  Maria Luisa Bonet,et al.  A New Algorithm for Weighted Partial MaxSAT , 2010, AAAI.

[8]  Ke Xu,et al.  Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..

[9]  Sean Safarpour,et al.  Improved Design Debugging Using Maximum Satisfiability , 2007 .

[10]  Toshihide Ibaraki,et al.  Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation , 2001, J. Heuristics.

[11]  Steven Trimberger,et al.  Security in SRAM FPGAs , 2007, IEEE Design & Test of Computers.

[12]  Henry A. Kautz,et al.  Solving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAX-SAT , 1995 .

[13]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[14]  Bin Liu,et al.  Parallel AES Encryption Engines for Many-Core Processor Arrays , 2013, IEEE Transactions on Computers.

[15]  Felip Manyà,et al.  Exploiting Cycle Structures in Max-SAT , 2009, SAT.

[16]  Abdul Sattar,et al.  Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..

[17]  Daniel Le Berre,et al.  The Sat4j library, release 2.2 , 2010, J. Satisf. Boolean Model. Comput..

[18]  Ke Xu,et al.  A Simple Model to Generate Hard Satisfiable Instances , 2005, IJCAI.

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

[20]  Quentin L. Burrell,et al.  The 80/20 Rule: Library Lore or Statistical Law? , 1985, J. Documentation.

[21]  Adam Prügel-Bennett,et al.  Maximum Satisfiability: Anatomy of the Fitness Landscape for a Hard Combinatorial Optimization Problem , 2012, IEEE Transactions on Evolutionary Computation.

[22]  Maria Luisa Bonet,et al.  SAT-based MaxSAT algorithms , 2013, Artif. Intell..

[23]  Kaile Su,et al.  Improving Local Search for Random 3-SAT Using Quantitative Configuration Checking , 2012, ECAI.

[24]  Arash Reyhani-Masoleh,et al.  Concurrent Structure-Independent Fault Detection Schemes for the Advanced Encryption Standard , 2010, IEEE Transactions on Computers.

[25]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[26]  Majid Sarrafzadeh,et al.  Pattern routing: use and theory for increasing predictability andavoiding coupling , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[27]  Wei Wu,et al.  Double Configuration Checking in Stochastic Local Search for Satisfiability , 2014, AAAI.

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

[29]  Qiang Yang,et al.  Learning action models from plan examples using weighted MAX-SAT , 2007, Artif. Intell..

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

[31]  Kaile Su,et al.  Local Search with Configuration Checking for SAT , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[32]  Maria Luisa Bonet,et al.  Improving WPM2 for (Weighted) Partial MaxSAT , 2013, CP.

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

[34]  Miyuki Koshimura,et al.  QMaxSAT: A Partial Max-SAT Solver , 2012, J. Satisf. Boolean Model. Comput..

[35]  Muhammad Rizwan,et al.  Application of 80/20 rule in software engineering Waterfall Model , 2009, 2009 International Conference on Information and Communication Technologies.

[36]  Christian Scheideler,et al.  Can ISPS and P2P users cooperate for improved performance? , 2007, CCRV.

[37]  Wei Wu,et al.  Focused Random Walk with Configuration Checking and Break Minimum for Satisfiability , 2013, CP.

[38]  Adrian Kügel,et al.  Improved Exact Solver for the Weighted MAX-SAT Problem , 2010, POS@SAT.

[39]  Felip Manyà,et al.  New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..

[40]  William A. Britten A use statistic for collection management: The 80/20 rule revisited , 1990 .

[41]  El-Ghazali Talbi,et al.  GPU Computing for Parallel Local Search Metaheuristic Algorithms , 2013, IEEE Transactions on Computers.

[42]  Carlos Ansótegui,et al.  Solving (Weighted) Partial MaxSAT with ILP , 2013, CPAIOR.

[43]  Edward P. K. Tsang,et al.  Guided Local Search for Solving SAT and Weighted MAX-SAT Problems , 2004, Journal of Automated Reasoning.

[44]  Joao Marques-Silva,et al.  Automated Design Debugging With Maximum Satisfiability , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[45]  Dmitri V. Krioukov,et al.  AS relationships: inference and validation , 2006, CCRV.

[46]  Jin-Kao Hao,et al.  A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite , 2001, Comput. Optim. Appl..

[47]  Joel Sokol,et al.  Optimal Protein Structure Alignment Using Maximum Cliques , 2005, Oper. Res..

[48]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

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

[50]  Weixiong Zhang,et al.  Backbone Guided Local Search for Maximum Satisfiability , 2003, IJCAI.

[51]  Kaile Su,et al.  Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving , 2008, AAAI.

[52]  James D. Park Using weighted MAX-SAT engines to solve MPE , 2002, AAAI/IAAI.

[53]  Joao Marques-Silva,et al.  Core-Guided Binary Search Algorithms for Maximum Satisfiability , 2011, AAAI.

[54]  Benjamin W. Wah,et al.  Discrete Lagrangian-Based Search for Solving MAX-SAT Problems , 1997, IJCAI.