DMC: A Distributed Model Counter

We present and evaluate DMC, a distributed model counter for propositional CNF formulae based on the state-of-the-art sequential model counter D4. DMC can take advantage of a (possibly large) number of sequential model counters running on (possibly heterogeneous) computing units spread over a network of computers. For ensuring an efficient workload distribution, the model counting task is shared between the model counters following a policy close to work stealing. The number and the sizes of the messages which are exchanged by the jobs are kept small. The results obtained show DMC as a much more efficient counter than D4, the distribution of the computation yielding large improvements for some benchmarks. DMC appears also as a serious challenger to the parallel model counter CountAntom and to the distributed model counter dCountAntom.

[1]  Gilles Audemard,et al.  Just-In-Time Compilation of Knowledge Bases , 2013, IJCAI.

[2]  Bernd Becker,et al.  Distributed Parallel #SAT Solving , 2016, 2016 IEEE International Conference on Cluster Computing (CLUSTER).

[3]  Bernd Becker,et al.  #SAT-based vulnerability analysis of security components — A case study , 2012, 2012 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT).

[4]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.

[5]  Robert D. Blumofe,et al.  Scheduling multithreaded computations by work stealing , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Bernd Becker,et al.  Laissez-Faire Caching for Parallel #SAT Solving , 2015, SAT.

[7]  Adnan Darwiche,et al.  New Advances in Compiling CNF into Decomposable Negation Normal Form , 2004, ECAI.

[8]  Toniann Pitassi,et al.  Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.

[9]  Lakhdar Sais,et al.  Vivifying Propositional Clausal Formulae , 2008, ECAI.

[10]  Carmel Domshlak,et al.  Fast Probabilistic Planning through Weighted Model Counting , 2006, ICAPS.

[11]  Adnan Darwiche,et al.  On probabilistic inference by weighted model counting , 2008, Artif. Intell..

[12]  Ronen I. Brafman,et al.  Lifted MEU by Weighted Model Counting , 2012, AAAI.

[13]  Jean-Marie Lagniez,et al.  On Preprocessing Techniques and Their Impact on Propositional Model Counting , 2017, Journal of Automated Reasoning.

[14]  Umut Oztok,et al.  A Top-Down Compiler for Sentential Decision Diagrams , 2015, IJCAI.

[15]  Blai Bonet,et al.  Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations , 2005, ICAPS.

[16]  Jean-Marie Lagniez,et al.  An Improved Decision-DNNF Compiler , 2017, IJCAI.

[17]  Marc Thurley,et al.  sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP , 2006, SAT.

[18]  Supratik Chakraborty,et al.  Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls , 2016, IJCAI.

[19]  Adnan Darwiche,et al.  Decomposable negation normal form , 2001, JACM.

[20]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

[21]  Vladimir Klebanov,et al.  SAT-Based Analysis and Quantification of Information Flow in Programs , 2013, QEST.

[22]  Marko Samer,et al.  Algorithms for propositional model counting , 2007, J. Discrete Algorithms.

[23]  Christian J. Muise,et al.  Dsharp: Fast d-DNNF Compilation with sharpSAT , 2012, Canadian Conference on AI.