Parallel MUS extraction

  • Authors:

  • Anton Belov;Norbert Manthey;Joao Marques-Silva

  • Affiliations:

  • Complex and Adaptive Systems Laboratory, University College Dublin, Ireland;Institute of Artificial Intelligence, Technische Universität Dresden, Germany;Complex and Adaptive Systems Laboratory, University College Dublin, Ireland,IST/INESC-ID, Technical University of Lisbon, Portugal

  • Venue:
  • SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Parallelization is a natural direction towards the improvements in the scalability of algorithms for the computation of Minimally Unsatisfiable Subformulas (MUSes), and group-MUSes, of CNF formulas. In this paper we propose and analyze a number of approaches to parallel MUS computation. Just as it is the case with the parallel CDCL-based SAT solving, the communication, i.e. the exchange of learned clauses between the solvers running in parallel, emerges as an important component of parallel MUS extraction algorithms. However, in the context of MUS computation the communication might be unsound. We argue that the assumption-based approach to the incremental CDCL-based SAT solving is the key enabling technology for effective sound communication in the context of parallel MUS extraction, and show that fully unrestricted communication is possible in this setting. Furthermore, we propose a number of techniques to improve the quality of communication, as well as the quality of job distribution in the parallel MUS extractor. We evaluate the proposed techniques empirically on industrially-relevant instances of both plain and group MUS problems, and demonstrate significant (up to an order of magnitude) improvements due to the parallelization.