{"type":"ScholarlyArticle","title":"Switch-List Representations in a Knowledge Compilation Map","authors":[{"name":"Ondřej Čepek","slug":"ondrej-cepek","given":"Ondřej","family":"Čepek","affiliation":"Charles University , Faculty of Mathematics and Physics , Department of Theoretical Computer Science and Mathematical Logic , Malostranské nám. 25 , 118 00 Praha 1 , Czech Republic"},{"name":"Miloš Chromý","slug":"milos-chromy","given":"Miloš","family":"Chromý","affiliation":"Charles University , Faculty of Mathematics and Physics , Department of Theoretical Computer Science and Mathematical Logic , Malostranské nám. 25 , 118 00 Praha 1 , Czech Republic"}],"abstract":"In this paper we focus on a less usual way to represent Boolean functions, namely on representations by switch-lists. Given a truth table representation of a Boolean function f the switch-list representation (SLR) of f is a list of Boolean vectors from the truth table which have a different function value than the preceding Boolean vector in the truth table. The main aim of this paper is to include the language SL of all SLR in the Knowledge Compilation Map  [Darwiche and Marquis, 2002] and to argue, that SL may in certain situations constitute a reasonable choice for a target language in knowledge compilation. First we compare SL with a number of standard representation languages (such as CNF, DNF, and OBDD) with respect to their relative succinctness. As a by-product of this analysis we also give a short proof of a long standing open question from  [Darwiche and Marquis, 2002], namely the incomparability of MODS (models) and PI (prime implicates) languages. Next we analyze which standard transformations and queries (those considered in [Darwiche and Marquis, 2002] can be performed in poly-time with respect to the size of the input SLR. We show that this collection is quite broad and the combination of poly-time transformations and queries is quite unique.","doi":"10.24963/ijcai.2020/229","url":"https://ijcai.org/proceedings/2020/229","pdf":"https://ijcai.org/proceedings/2020/0229.pdf","markdown":"https://ijcai.org/proceedings/2020/229.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/229","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":229,"pages":{"first":1651,"last":1657},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Knowledge Representation and Reasoning: Automated Reasoning; Tractable Languages and Knowledge compilation","Knowledge Representation and Reasoning: Knowledge Representation Languages"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/26822/file_26822.m3u8","length_sec":924,"provider":"hls"}],"references":[{"position":1,"raw":"[Čepek and Hušek, 2017] Ondřej Čepek and Radek Hušek. Recognition of tractable dnfs representable by a constant number of intervals. Discrete Optimization, 23:1-19, 2017.","title":"Ondřej Čepek and Radek Hušek. Recognition of tractable dnfs representable by a constant number of intervals","authors":"Hušek Čepek","year":"2017","venue":"Discrete Optimization","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Čepek et al., 2008] Ondřej Čepek, David Kronus, and Petr Kučera. Recognition of interval Boolean functions. An- nals of Mathematics and Artificial Intelligence, 52(1):1- 24, 2008.","title":"Recognition of interval Boolean functions","authors":"Ondřej Čepek, David Kronus, Petr Kučera","year":"2008","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Darwiche and Marquis, 2002] Adnan Darwiche and Pierre Marquis. A knowledge compilation map. Journal Of Arti- ficial Intelligence Research, 17:229-264, 2002.","title":"A knowledge compilation map","authors":"Adnan Darwiche, Pierre Marquis","year":"2002","venue":"Journal Of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Huang and Cheng, 1999] Chung-Yang Huang and Kwang- Ting Cheng. Solving constraint satisfiability problem for automatic generation of design verification vectors. In Proceedings of the IEEE International High Level Design Validation and Test Workshop, 1999.","title":"Solving constraint satisfiability problem for automatic generation of design verification vectors","authors":"Chung-Yang Huang, Kwang-Ting Cheng","year":"1999","venue":"Proceedings of the IEEE International High Level Design Validation and Test Workshop","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Le Berre et al., 2018] Daniel Le Berre, Pierre Marquis, Ste- fan Mengel, and Romain Wallon. Pseudo-boolean con- straints from a knowledge representation perspective. In Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI'18, page 1891-1897. AAAI Press, 2018.","title":"Pseudo-boolean constraints from a knowledge representation perspective","authors":"Le Berre","year":"2018","venue":"Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI'18","doi":null,"url":null,"internal_url":"/proceedings/2018/261"},{"position":6,"raw":"[Lewin et al., 1995] Daniel Lewin, Laurent Fournier, Moshe Levinger, Evgeny Roytman, and Gil Shurek. Constraint satisfaction for test program generation. In IEEE 14th Phoenix Conference on Computers and Communications, pages 45-48, 1995.","title":"Constraint satisfaction for test program generation","authors":"Laurent Daniel Lewin, Moshe Fournier, Evgeny Levinger, Gil Roytman, Shurek","year":"1995","venue":"IEEE 14th Phoenix Conference on Computers and Communications","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Schieber et al., 2005] Baruch Schieber, Daniel Geist, and Ayal Zaks. Computing the minimum DNF representation of boolean functions defined by intervals. Discrete Applied Mathematics, 149:154-173, 2005.","title":"Computing the minimum DNF representation of boolean functions defined by intervals","authors":"Schieber","year":"2005","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Wegener, 2000] Ingo Wegener. Branching Programs and Binary Decision Diagrams: Theory and Applications. So- ciety for Industrial and Applied Mathematics, Philadel- phia, PA, USA, 2000.","title":"Branching Programs and Binary Decision Diagrams: Theory and Applications","authors":"Ingo Wegener","year":"2000","venue":"Society for Industrial and Applied Mathematics","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}