Exploiting Cardinality Encodings in Parallel Maximum Satisfiability

Cardinality constraints appear in many practical problems and have been well studied in the past. There are many CNF encodings for cardinality constraints, although it is not clear which encodings perform better. Indeed, different encodings can perform well over different problems. This paper examines a large number of cardinality encodings and evaluates their performance for solving the problem of Maximum Satisfiability (MaxSAT). Taking advantage of the diversification of cardinality encodings, we propose to exploit those encodings in parallel MaxSAT solving. Our parallel solver, pMAX, simultaneously searches in the lower and upper bound of the optimum value, and different cardinality encodings are used in each thread to increase the diversification of the search. Moreover, learned clauses are shared between threads during the search. Experimental results show that our parallel solver outperforms other sequential and parallel state-of-the-art MaxSAT solvers.

[1]  Armin Biere.  Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010 , 2010 .

[2]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[3]  Vasco M. Manquinho,et al.  Improving Unsatisfiability-Based Algorithms for Boolean Optimization , 2010, SAT.

[4]  Steven David Prestwich,et al.  Variable Dependency in Local Search: Prevention Is Better Than Cure , 2007, SAT.

[5]  Vasco M. Manquinho,et al.  Parallel Search for Boolean Optimization , 2011 .

[6]  Olivier Bailleux,et al.  Efficient CNF Encoding of Boolean Cardinality Constraints , 2003, CP.

[7]  Maria Luisa Bonet,et al.  Solving (Weighted) Partial MaxSAT through Satisfiability Testing , 2009, SAT.

[8]  Lakhdar Sais,et al.  Control-Based Clause Sharing in Parallel SAT Solving , 2009, IJCAI.

[9]  Gilles Audemard,et al.  Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.

[10]  Gihwon Kwon,et al.  Efficient CNF Encoding for Selecting 1 from N Objects , 2007 .

[11]  Alan M. Frisch,et al.  Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings , 2001, Journal of Automated Reasoning.

[12]  Lakhdar Sais,et al.  ManySAT: a Parallel SAT Solver , 2009, J. Satisf. Boolean Model. Comput..

[13]  Carlos Ansótegui,et al.  Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables , 2004, SAT.

[14]  Jussi Rintanen,et al.  Satisfiability Planning with Constraints on the Number of Actions , 2005, ICAPS.

[15]  Carsten Sinz,et al.  Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

[16]  Jingchao Chen,et al.  A New SAT Encoding of the At-Most-One Constraint , 2010 .

[17]  Niklas Sörensson,et al.  Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

[18]  Vasco M. Manquinho,et al.  Algorithms for Weighted Boolean Optimization , 2009, SAT.

[19]  Alan M. Frisch,et al.  SAT Encodings of the At-Most-k Constraint Some Old , Some New , Some Fast , Some Slow , 2010 .

[20]  Michael Codish,et al.  Pairwise Cardinality Networks , 2010, LPAR.

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

[22]  Sharad Malik,et al.  On Solving the Partial MAX-SAT Problem , 2006, SAT.

[23]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[24]  Albert Oliveras,et al.  Cardinality Networks: a theoretical and empirical study , 2011, Constraints.

[25]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.