{"type":"ScholarlyArticle","title":"An Improved Decision-DNNF Compiler","authors":[{"name":"Jean-Marie Lagniez","slug":"jean-marie-lagniez","given":"Jean-Marie","family":"Lagniez","affiliation":"U. Artois & CNRS , F-62300 Lens , France,"},{"name":"Pierre Marquis","slug":"pierre-marquis","given":"Pierre","family":"Marquis","affiliation":"U. Artois & CNRS , F-62300 Lens , France,"}],"abstract":"We present and evaluate a new compiler, called d4, targeting the Decision-DNNF language.\r\nAs the state-of-the-art compilers C2D and Dsharp targeting the same language, \r\nd4 is a top-down tree-search algorithm exploring the space of propositional \r\ninterpretations. d4 is based on the same ingredients as those considered in C2D and Dsharp \r\n(mainly, disjoint component analysis, conflict analysis and non-chronological backtracking, component caching).\r\nd4 takes advantage of a dynamic decomposition approach based on hypergraph partitioning, used sparingly.\r\nSome simplification rules are also used to minimize the time spent in the partitioning steps and to promote the \r\nquality of the decompositions. Experiments show that the compilation times and the sizes of the\r\nDecision-DNNF representations computed by d4  are in many cases significantly lower than the \r\nones obtained by C2D and Dsharp.","doi":"10.24963/ijcai.2017/93","url":"https://ijcai.org/proceedings/2017/93","pdf":"https://ijcai.org/proceedings/2017/0093.pdf","markdown":"https://ijcai.org/proceedings/2017/93.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/93","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Constraints and Satisfiability","track":"Main track","number":93,"pages":{"first":667,"last":673},"keywords":["Knowledge Representation, Reasoning, and Logic: Tractable languages and knowledge compilation","Constraints and Satisfiability: Solvers and Tools"],"videos":[],"references":[{"position":1,"raw":"[Cadoli and Donini, 1998] Marco Cadoli and Francesco M. Donini. A survey on knowledge compilation. AI Commu- nications, 10(3-4):137-150, 1998.","title":"A survey on knowledge compilation","authors":"Donini Cadoli, Marco Cadoli, Francesco M Donini","year":"1998","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Catalyürek and Aykanat, 2011] Umit V. Catalyürek and Cevdet Aykanat. PaToH (Partitioning Tool for Hyper- graphs), pages 1479-1487. Encyclopedia of Parallel Com- puting. 2011.","title":"PaToH (Partitioning Tool for Hypergraphs","authors":"V Umit, Cevdet Catalyürek, Aykanat","year":"2011","venue":"Encyclopedia of Parallel Computing","doi":null,"url":null,"internal_url":null},{"position":3,"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":4,"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":5,"raw":"[Darwiche, 2014] Adnan Darwiche. Tractable Knowledge Representation Formalisms, pages 141-172. Tractability -Practical Approaches to Hard Problems. Cambridge Uni- versity Press, 2014. [Eén and Sörensson, 2003] Niklas Eén and Niklas Sörensson. An extensible SAT-solver. In Proc. of SAT'03, pages 502-518. 2003.","title":"Tractability -Practical Approaches to Hard Problems","authors":"Adnan Darwiche, ; Niklas Eén, Niklas Sörensson","year":"2003","venue":"Proc. of SAT'03","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Fargier and Marquis, 2006] Hélène Fargier and Pierre Mar- quis. On the use of partially ordered decision graphs in knowledge compilation and quantified Boolean formulae. In Proc. of AAAI'06, pages 42-47, 2006.","title":"Hélène Fargier and Pierre Marquis. On the use of partially ordered decision graphs in knowledge compilation and quantified Boolean formulae","authors":"Marquis Fargier","year":"2006","venue":"Proc. of AAAI'06","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Huang and Darwiche, 2007] Jinbo Huang and Adnan Dar- wiche. The language of search. Journal of Artificial Intel- ligence Research (JAIR), 29:191-219, 2007.","title":"Jinbo Huang and Adnan Darwiche. The language of search","authors":"Darwiche Huang","year":"2007","venue":"Journal of Artificial Intelligence Research (JAIR)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Koriche et al., 2015] Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, and Samuel Thomas. Compiling constraint networks into multivalued decomposable decision graphs. In Proc. of IJCAI'15, pages 332-338, 2015.","title":"Compiling constraint networks into multivalued decomposable decision graphs","authors":"Koriche","year":"2015","venue":"Proc. of IJCAI'15","doi":null,"url":null,"internal_url":"/proceedings/2015/53"},{"position":9,"raw":"[Lagniez and Marquis, 2014] Jean-Marie Lagniez and Pierre Marquis. Preprocessing for propositional model counting. In Proc. of AAAI'14, pages 2688-2694, 2014.","title":"Preprocessing for propositional model counting","authors":"Marquis ; Jean-Marie Lagniez, Pierre Lagniez, Marquis","year":"2014","venue":"Proc. of AAAI'14","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Marquis, 2015] Pierre Marquis. Compile! In Proc. of AAAI'15, pages 4112-4118, 2015.","title":"Compile!","authors":"Pierre Marquis, Marquis","year":"2015","venue":"Proc. of AAAI'15","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Moskewicz et al., 2001] Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In Proc. of DAC'01, pages 530-535, 2001.","title":"Chaff: Engineering an efficient SAT solver","authors":"Matthew W Moskewicz, F Conor, Ying Madigan, Lintao Zhao, Sharad Zhang, Malik","year":"2001","venue":"Proc. of DAC'01","doi":null,"url":null,"internal_url":null},{"position":12,"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":13,"raw":"[Oztok and Darwiche, 2014] Umut Oztok and Adnan Dar- wiche. On compiling CNF into Decision-DNNF. In Proc. of CP'14, pages 42-57, 2014.","title":"Umut Oztok and Adnan Darwiche. On compiling CNF into Decision-DNNF","authors":"Darwiche Oztok","year":"2014","venue":"Proc. of CP'14","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Oztok and Darwiche, 2015a] 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":15,"raw":"[Oztok and Darwiche, 2015b] 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":16,"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":17,"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":18,"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},{"position":19,"raw":"[Zhang and Stickel, 1996] Hantao Zhang and Mark E. Stickel. An efficient algorithm for unit propagation. In Proc. of ISAIM'96, pages 166-169, 1996.","title":"An efficient algorithm for unit propagation","authors":"Stickel ; ] Hantao Zhang, Mark E Zhang, Stickel","year":"1996","venue":"Proc. of ISAIM'96","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}