{"type":"ScholarlyArticle","title":"Structured d-DNNF Is Not Closed under Negation","authors":[{"name":"Harry Vinall-Smeeth","slug":"harry-vinall-smeeth","given":"Harry","family":"Vinall-Smeeth","affiliation":"Technische Universität Ilmenau , Germany"}],"abstract":"Both structured d-DNNF and SDD can be exponentially more succinct than OBDD. Moreover, SDD is essentially as tractable as OBDD. But this leaves left two important open questions. Firstly, does OBDD support more tractable transformations than structured d-DNNF? And secondly, is structured d-DNNF more succinct than SDD? In this paper, we answer both questions in the affirmative. For the first question we show that, unlike OBDD, structured d-DNNF does not support polytime negation, disjunction, or existential quantification operations. As a corollary, we deduce that there are functions with an equivalent polynomial-sized structured d-DNNF but with no such representation as an SDD, thus answering the second question. We also lift this second result to arithmetic circuits (AC) to show a succinctness gap between PSDD and the positive AC analogue to structured d-DNNF.","doi":"10.24963/ijcai.2024/398","url":"https://ijcai.org/proceedings/2024/398","pdf":"https://ijcai.org/proceedings/2024/0398.pdf","markdown":"https://ijcai.org/proceedings/2024/398.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/398","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":398,"pages":{"first":3593,"last":3601},"keywords":["Knowledge Representation and Reasoning: KRR: Knowledge compilation"],"videos":[],"references":[{"position":1,"raw":"[Amarilli et al., 2020] Antoine Amarilli, Florent Capelli, Mikaël Monet, and Pierre Senellart. Connecting Knowl- edge Compilation Classes and Width Parameters. Theory Comput. Syst., 64(5):861-914, 2020.","title":"Connecting Knowledge Compilation Classes and Width Parameters","authors":"Amarilli","year":"2020","venue":"Theory Comput. Syst","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Balodis et al., 2021] Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, and Robin Kothari. Unam- biguous DNFs and Alon-Saks-Seymour. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 116-124. IEEE, 2021.","title":"Unambiguous DNFs and Alon-Saks-Seymour","authors":"Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari","year":"2021","venue":"IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Beame and Liew, 2015] Paul Beame and Vincent Liew. New Limits for Knowledge Compilation and Applications to Exact Model Counting. In Marina Meila and Tom Hes- kes, editors, Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, UAI 2015, July 12- 16, 2015, Amsterdam, The Netherlands, pages 131-140. AUAI Press, 2015.","title":"New Limits for Knowledge Compilation and Applications to Exact Model Counting","authors":"Liew Beame, Paul Beame, Vincent Liew","year":"2015","venue":"Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, UAI 2015","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bollig and Farenholtz, 2021] Beate Bollig and Martin Farenholtz. On the Relation Between Structured d- DNNFs and SDDs. Theory Comput. Syst., 65(2):274-295, 2021.","title":"On the Relation Between Structured d-DNNFs and SDDs","authors":"Farenholtz Bollig, Beate Bollig, Martin Farenholtz","year":"2021","venue":"Theory Comput. Syst","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bova and Szeider, 2017] Simone Bova and Stefan Szeider. Circuit Treewidth, Sentential Decision, and Query Com- pilation. In Emanuel Sallinger, Jan Van den Buss- che, and Floris Geerts, editors, Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017, pages 233-246. ACM, 2017.","title":"Circuit Treewidth, Sentential Decision, and Query Compilation","authors":"Simone Bova, Stefan Szeider","year":"2017","venue":"Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bova et al., 2016] Simone Bova, Florent Capelli, Stefan Mengel, and Friedrich Slivovsky. Knowledge Compilation Meets Communication Complexity. In Subbarao Kamb- hampati, editor, Proceedings of the Twenty-Fifth Interna- tional Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pages 1008- 1014. IJCAI/AAAI Press, 2016.","title":"Knowledge Compilation Meets Communication Complexity","authors":"Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky","year":"2016","venue":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016","doi":null,"url":null,"internal_url":"/proceedings/2016/147"},{"position":7,"raw":"[Bova, 2016] Simone Bova. SDDs Are Exponentially More Succinct than OBDDs. In Dale Schuurmans and Michael P. Wellman, editors, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12- 17, 2016, Phoenix, Arizona, USA, pages 929-935. AAAI Press, 2016.","title":"SDDs Are Exponentially More Succinct than OBDDs","authors":"Simone Bova","year":"2016","venue":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bryant, 1986] Randal E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Comput- ers, 35(8):677-691, 1986.","title":"Graph-Based Algorithms for Boolean Function Manipulation","authors":"Randal E Bryant","year":"1986","venue":"IEEE Trans. Computers","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Darwiche and Marquis, 2002] Adnan Darwiche and Pierre Marquis. A Knowledge Compilation Map. J. Artif. Intell. Res., 17:229-264, 2002.","title":"A Knowledge Compilation Map","authors":"Adnan Darwiche, Pierre Marquis","year":"2002","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Darwiche, 2001a] Adnan Darwiche. Decomposable nega- tion normal form. J. ACM, 48(4):608-647, 2001.","title":"Decomposable negation normal form","authors":"Adnan Darwiche, Darwiche","year":"2001","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Darwiche, 2001b] Adnan Darwiche. On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision. J. Appl. Non Class. Log- ics, 11(1-2):11-34, 2001.","title":"On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision","authors":"Adnan Darwiche, Darwiche","year":"2001","venue":"J. Appl. Non Class. Logics","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Darwiche, 2011] Adnan Darwiche. SDD: A new canoni- cal representation of propositional knowledge bases. In Toby Walsh, editor, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pages 819-826. IJCAI/AAAI, 2011.","title":"SDD: A new canonical representation of propositional knowledge bases","authors":"Adnan Darwiche","year":"2011","venue":"IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2011/143"},{"position":13,"raw":"[de Colnet and Mengel, 2021] Alexis de Colnet and Stefan Mengel. A Compilation of Succinctness Results for Arith- metic Circuits. In Meghyn Bienvenu, Gerhard Lakemeyer, and Esra Erdem, editors, Proceedings of the 18th Interna- tional Conference on Principles of Knowledge Represen- tation and Reasoning, KR 2021, Online event, November 3-12, 2021, pages 205-215, 2021.","title":"Alexis de Colnet and Stefan Mengel. A Compilation of Succinctness Results for Arithmetic Circuits","authors":"Colnet De, Mengel","year":"2021","venue":"Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Online event","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gogic et al., 1995] Goran Gogic, Henry A. Kautz, Chris- tos H. Papadimitriou, and Bart Selman. The Comparative Linguistics of Knowledge Representation. In Proceedings of the Fourteenth International Joint Conference on Arti- ficial Intelligence, IJCAI 95, Montréal Québec, Canada, August 20-25 1995, 2 Volumes, pages 862-869.","title":"The Comparative Linguistics of Knowledge Representation","authors":"Goran Gogic, Henry A Kautz, Christos H Papadimitriou, Bart Selman","year":"1995","venue":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95","doi":null,"url":null,"internal_url":"/proceedings/1995/112"},{"position":15,"raw":"Morgan Kaufmann, 1995.","title":null,"authors":"Morgan Kaufmann","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Göös et al., 2016] Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, and David Zuckerman. Rect- angles Are Nonnegative Juntas. SIAM J. Comput., 45(5):1835-1869, 2016.","title":"Rectangles Are Nonnegative Juntas","authors":"Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman","year":"2016","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Göös et al., 2022] Mika Göös, Stefan Kiefer, and Weiqiang Yuan. Lower Bounds for Unambiguous Automata via Communication Complexity. In Mikolaj Bojanczyk, Emanuela Merelli, and David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France, volume 229 of LIPIcs, pages 126:1-126:13. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2022.","title":"Lower Bounds for Unambiguous Automata via Communication Complexity","authors":"Mika Göös, Stefan Kiefer, Weiqiang Yuan","year":"2022","venue":"49th International Colloquium on Automata, Languages, and Programming, ICALP 2022","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kisa et al., 2014] Doga Kisa, Guy Van den Broeck, Arthur Choi, and Adnan Darwiche. Probabilistic Sentential De- cision Diagrams. In Chitta Baral, Giuseppe De Giacomo, and Thomas Eiter, editors, Principles of Knowledge Rep- resentation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014. AAAI Press, 2014.","title":"Probabilistic Sentential Decision Diagrams","authors":"Kisa","year":"2014","venue":"Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Knop, 2017] Alexander Knop. IPS-like Proof Systems Based on Binary Decision Diagrams. Electron. Collo- quium Comput. Complex., TR17-179, 2017.","title":"IPS-like Proof Systems Based on Binary Decision Diagrams","authors":"Alexander Knop","year":"2017","venue":"Electron. Colloquium Comput. Complex","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kushilevitz and Nisan, 1997] Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge Univer- sity Press, 1997.","title":"Communication Complexity","authors":"Eyal Kushilevitz, Noam Nisan","year":"1997","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lam and Ruzzo, 1992] Tak Wah Lam and Walter L. Ruzzo. Results on Communication Complexity Classes. J. Com- put. Syst. Sci., 44(2):324-342, 1992.","title":"Results on Communication Complexity Classes","authors":"Ruzzo ; ] Lam, Wah Tak, Walter L Lam, Ruzzo","year":"1992","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Pipatsrisawat and Darwiche, 2008] Knot Pipatsrisawat and Adnan Darwiche. New Compilation Languages Based on Structured Decomposability. In Dieter Fox and Carla P. Gomes, editors, Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008, pages 517-522. AAAI Press, 2008.","title":"Knot Pipatsrisawat and Adnan Darwiche. New Compilation Languages Based on Structured Decomposability","authors":"Darwiche Pipatsrisawat","year":"2008","venue":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Pipatsrisawat and Darwiche, 2010] Thammanit Pipatsri- sawat and Adnan Darwiche. A Lower Bound on the Size of Decomposable Negation Normal Form. In Maria Fox and David Poole, editors, Proceedings of the Twenty- Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010, pages 345-350. AAAI Press, 2010.","title":"Thammanit Pipatsrisawat and Adnan Darwiche. A Lower Bound on the Size of Decomposable Negation Normal Form","authors":"Darwiche Pipatsrisawat","year":"2010","venue":"Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Poon and Domingos, 2011] Hoifung Poon and Pedro M. Domingos. Sum-product networks: A new deep archi- tecture. In IEEE International Conference on Computer Vision Workshops, ICCV 2011 Workshops, Barcelona, Spain, November 6-13, 2011, pages 689-690. IEEE Com- puter Society, 2011.","title":"Sum-product networks: A new deep architecture","authors":"Domingos Poon, Hoifung Poon, Pedro M Domingos","year":"2011","venue":"IEEE International Conference on Computer Vision Workshops, ICCV 2011 Workshops","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Segerlind, 2008] Nathan Segerlind. On the Relative Ef- ficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pages 100-111. IEEE Computer Society, 2008.","title":"On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs","authors":"Nathan Segerlind","year":"2008","venue":"Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Shen et al., 2016] Yujia Shen, Arthur Choi, and Adnan Dar- wiche. Tractable Operations for Arithmetic Circuits of Probabilistic Models. In Daniel D. Lee, Masashi Sugiyama, Ulrike von Luxburg, Isabelle Guyon, and Ro- man Garnett, editors, Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain, pages 3936-3944, 2016.","title":"Tractable Operations for Arithmetic Circuits of Probabilistic Models","authors":"Yujia Shen, Arthur Choi, Adnan Darwiche","year":"2016","venue":"Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Somenzi, 2009] Fabio Somenzi. CUDD: CU decision dia- gram package release 2.4. 2. University of Colorado at Boulder, 2009.","title":"CUDD: CU decision diagram package release 2.4. 2","authors":"Fabio Somenzi","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Van den Broeck and Darwiche, 2015] Guy Van den Broeck and Adnan Darwiche. On the Role of Canonicity in Knowledge Compilation. In Blai Bonet and Sven Koenig, editors, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA, pages 1641-1648. AAAI Press, 2015.","title":"On the Role of Canonicity in Knowledge Compilation","authors":"Broeck Van Den, Darwiche, Guy Van Den Broeck, Adnan Darwiche","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Wegman and Carter, 1981] Mark N Wegman and J Lawrence Carter. New hash functions and their use in authentication and set equality. Journal of computer and system sciences, 22(3):265-279, 1981.","title":"New hash functions and their use in authentication and set equality","authors":"N Mark, J Wegman, Carter Lawrence","year":"1981","venue":"Journal of computer and system sciences","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}