{"type":"ScholarlyArticle","title":"DMC: A Distributed Model Counter","authors":[{"name":"Jean-Marie Lagniez","slug":"jean-marie-lagniez","given":"Jean-Marie","family":"Lagniez","affiliation":"CRIL-CNRS UMR 8188 , Université d'Artois , Lens , France"},{"name":"Pierre Marquis","slug":"pierre-marquis","given":"Pierre","family":"Marquis","affiliation":"CRIL-CNRS UMR 8188 , Université d'Artois , Lens , France; Institut Universitaire de France"},{"name":"Nicolas Szczepanski","slug":"nicolas-szczepanski","given":"Nicolas","family":"Szczepanski","affiliation":"CRIL-CNRS UMR 8188 , Université d'Artois , Lens , France"}],"abstract":"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.","doi":"10.24963/ijcai.2018/185","url":"https://ijcai.org/proceedings/2018/185","pdf":"https://ijcai.org/proceedings/2018/0185.pdf","markdown":"https://ijcai.org/proceedings/2018/185.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/185","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Constraints and SAT","track":"Main track","number":185,"pages":{"first":1331,"last":1338},"keywords":["Constraints and SAT: SAT","Constraints and SAT: SAT: Solvers and Tools"],"videos":[],"references":[{"position":1,"raw":"[Apsel and Brafman, 2012] Udi Apsel and Ronen I. Braf- man. Lifted MEU by weighted model counting. In Proc. of AAAI'12, 2012.","title":"Udi Apsel and Ronen I. Brafman. Lifted MEU by weighted model counting","authors":"Brafman Apsel","year":"2012","venue":"Proc. of AAAI'12","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Audemard et al., 2013] Gilles Audemard, Jean-Marie Lagniez, and Laurent Simon. Just-in-time compilation of knowledge bases. In Proc. of IJCAI'13, pages 447-453, 2013.","title":"Just-in-time compilation of knowledge bases","authors":"Gilles Audemard, Jean-Marie Lagniez, Laurent Simon","year":"2013","venue":"Proc. of IJCAI'13","doi":null,"url":null,"internal_url":"/proceedings/2013/74"},{"position":3,"raw":"[Blumofe and Leiserson, 1999] Robert D. Blumofe and Charles E. Leiserson. Scheduling multithreaded com- putations by work stealing. Journal of the ACM, 46(5):720-748, 1999.","title":"Scheduling multithreaded computations by work stealing","authors":"Robert D Blumofe, Charles E Leiserson","year":"1999","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Burchard et al., 2015] Jan Burchard, Tobias Schubert, and Bernd Becker. Laissez-faire caching for parallel #sat solv- ing. In Proc. of SAT'15, pages 46-61, 2015.","title":"Laissez-faire caching for parallel #sat solving","authors":"Burchard","year":"2015","venue":"Proc. of SAT'15","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Burchard et al., 2016] Jan Burchard, Tobias Schubert, and Bernd Becker. Distributed parallel #sat solving. In Proc. of CLUSTER'16, pages 326-335, 2016.","title":"Distributed parallel #sat solving","authors":"Burchard","year":"2016","venue":"Proc. of CLUSTER'16","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chakraborty et al., 2016] Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. Algorithmic improvements in approximate counting for probabilistic inference: From linear to logarithmic SAT calls. In Proc. of IJCAI'16, pages 3569-3576, 2016.","title":"Algorithmic improvements in approximate counting for probabilistic inference: From linear to logarithmic SAT calls","authors":"Supratik Chakraborty, Kuldeep S Meel, Moshe Y Vardi","year":"2016","venue":"Proc. of IJCAI'16","doi":null,"url":null,"internal_url":"/proceedings/2016/503"},{"position":7,"raw":"[Chavira and Darwiche, 2008] Mark Chavira and Adnan Darwiche. On probabilistic inference by weighted model counting. Artificial Intelligence, 172(6-7):772-799, 2008.","title":"On probabilistic inference by weighted model counting","authors":"Darwiche Chavira, Mark Chavira, Adnan Darwiche","year":"2008","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Darwiche, 2001] Adnan Darwiche. Decomposable negation normal form. Journal of the Association for Computing Machinery, 48(4):608-647, 2001.","title":"Decomposable negation normal form","authors":"Adnan Darwiche","year":"2001","venue":"Journal of the Association for Computing Machinery","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Darwiche, 2004] Adnan Darwiche. New advances in com- piling cnf into decomposable negation normal form. In Proc. of ECAI'04, pages 328-332, 2004.","title":"New advances in compiling cnf into decomposable negation normal form","authors":"Adnan Darwiche","year":"2004","venue":"Proc. of ECAI'04","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Darwiche, 2011] Adnan Darwiche. SDD: A new canonical representation of propositional knowledge bases. In Proc. of IJCAI'11, pages 819-826, 2011.","title":"SDD: A new canonical representation of propositional knowledge bases","authors":"Adnan Darwiche","year":"2011","venue":"Proc. of IJCAI'11","doi":null,"url":null,"internal_url":"/proceedings/2011/143"},{"position":11,"raw":"[Domshlak and Hoffmann, 2006] Carmel Domshlak and Jörg Hoffmann. Fast probabilistic planning through weighted model counting. In Proc. of ICAPS'06, pages 243-252, 2006.","title":"Carmel Domshlak and Jörg Hoffmann. Fast probabilistic planning through weighted model counting","authors":"Hoffmann Domshlak","year":"2006","venue":"Proc. of ICAPS'06","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Feiten et al., 2012] Linus Feiten, Matthias Sauer, Tobias Schubert, Alexander Czutro, Eberhard Böhl, Ilia Polian, and Bernd Becker. #SAT-based vulnerability analysis of security components -A case study. In Proc. of DFT'12, pages 49-54, 2012.","title":"#SAT-based vulnerability analysis of security components -A case study","authors":"Feiten","year":"2012","venue":"Proc. of DFT'12","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Klebanov et al., 2013] Vladimir Klebanov, Norbert Man- they, and Christian J. Muise. Sat-based analysis and quan- tification of information flow in programs. In Proc. of QUEST'13, pages 177-192, 2013.","title":"Sat-based analysis and quantification of information flow in programs","authors":"Vladimir Klebanov, Norbert Manthey, Christian J Muise","year":"2013","venue":"Proc. of QUEST'13","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lagniez and Marquis, 2017a] Jean-Marie Lagniez and Pierre Marquis. An Improved Decision-DNNF Compiler. In Proc. of IJCAI'17, pages 667-673, 2017.","title":"An Improved Decision-DNNF Compiler","authors":"Marquis ; Jean-Marie Lagniez, Pierre Lagniez, Marquis","year":"2017","venue":"Proc. of IJCAI'17","doi":null,"url":null,"internal_url":"/proceedings/2017/93"},{"position":15,"raw":"[Lagniez and Marquis, 2017b] Jean-Marie Lagniez and Pierre Marquis. On preprocessing techniques and their impact on propositional model counting. J. Autom. Reasoning, 58(4):413-481, 2017.","title":"On preprocessing techniques and their impact on propositional model counting","authors":"Marquis ; Jean-Marie Lagniez, Pierre Lagniez, Marquis","year":"2017","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Monasson et al., 1999] Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, and Lidror Troyansky. Determining computational complexity from characteristic 'phase transitions'. Nature, 33:133-137, 1999.","title":"Determining computational complexity from characteristic 'phase transitions","authors":"Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, Lidror Troyansky","year":"1999","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Muise et al., 2012] Christian J. Muise, Sheila A. McIlraith, J. Christopher Beck, and Eric I. Hsu. Dsharp: Fast d- DNNF compilation with sharpSAT. In Proc. of AI'12, pages 356-361, 2012.","title":"Dsharp: Fast d-DNNF compilation with sharpSAT","authors":"Christian J Muise, Sheila A Mcilraith, J Christopher Beck, Eric I Hsu","year":"2012","venue":"Proc. of AI'12","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Oztok and Darwiche, 2015] Umut Oztok and Adnan Dar- wiche. A top-down compiler for sentential decision dia- grams. In Proc. of IJCAI'15, pages 3141-3148, 2015.","title":"Umut Oztok and Adnan Darwiche. A top-down compiler for sentential decision diagrams","authors":"Darwiche Oztok","year":"2015","venue":"Proc. of IJCAI'15","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Palacios et al., 2005] Héctor Palacios, Blai Bonet, Adnan Darwiche, and Hector Geffner. Pruning conformant plans by counting models on compiled d-DNNF representations. In Proc. of ICAPS'05, pages 141-150, 2005.","title":"Pruning conformant plans by counting models on compiled d-DNNF representations","authors":"Héctor Palacios, Blai Bonet, Adnan Darwiche, Hector Geffner","year":"2005","venue":"Proc. of ICAPS'05","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Piette et al., 2008] Cédric Piette, Youssef Hamadi, and Lakhdar Saïs. Vivifying propositional clausal formulae. In Proc. of ECAI'08, pages 525-529, 2008.","title":"Vivifying propositional clausal formulae","authors":"Cédric Piette, Youssef Hamadi, Lakhdar Saïs","year":"2008","venue":"Proc. of ECAI'08","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Samer and Szeider, 2010] Marko Samer and Stefan Szeider. Algorithms for propositional model counting. J. Discrete Algorithms, 8(1):50-64, 2010.","title":"Algorithms for propositional model counting","authors":"Marko Samer, Stefan Szeider","year":"2010","venue":"J. Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Sang et al., 2004] Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, and Toniann Pitassi. Combining com- ponent caching and clause learning for effective model counting. In Proc. of SAT'04, 2004.","title":"Combining component caching and clause learning for effective model counting","authors":"Tian Sang, Fahiem Bacchus, Paul Beame, Henry A Kautz, Toniann Pitassi","year":"2004","venue":"Proc. of SAT'04","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Sang et al., 2005] Tian Sang, Paul Beame, and Henry A. Kautz. Performing Bayesian inference by weighted model counting. In Proc. of AAAI'05, pages 475-482, 2005.","title":"Performing Bayesian inference by weighted model counting","authors":"Tian Sang, Paul Beame, Henry A Kautz","year":"2005","venue":"Proc. of AAAI'05","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Schubert et al., 2010] Tobias Schubert, Matthew D. T. Lewis, and Bernd Becker. Antom -solver description, 2010. SAT Race.","title":"Antom -solver description","authors":"Tobias Schubert, D T Matthew, Bernd Lewis, Becker","year":"2010","venue":"SAT Race","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Thurley, 2006] Marc Thurley. sharpSAT -counting models with advanced component caching and implicit BCP. In Proc. of SAT'06, pages 424-429, 2006.","title":"sharpSAT -counting models with advanced component caching and implicit BCP","authors":"Marc Thurley","year":"2006","venue":"Proc. of SAT'06","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}