2011 IEEE 23rd International Conference on Tools with Artificial Intelligence (2011)
Boca Raton, Florida USA
Nov. 7, 2011 to Nov. 9, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2011.54
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.
Parallel Search, Maximum Satisfiability, Cardinality Encodings
I. Lynce, R. Martins and V. Manquinho, "Exploiting Cardinality Encodings in Parallel Maximum Satisfiability," 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence(ICTAI), Boca Raton, Florida USA, 2011, pp. 313-320.