{"type":"ScholarlyArticle","title":"Solving the Identifying Code Set Problem with Grouped Independent Support","authors":[{"name":"Anna L.D. Latour","slug":"anna-l-d-latour","given":"Anna L.D.","family":"Latour","affiliation":"National University of Singapore , Singapore"},{"name":"Arunabha Sen","slug":"arunabha-sen","given":"Arunabha","family":"Sen","affiliation":"Arizona State University , Tempe , AZ , USA"},{"name":"Kuldeep S. Meel","slug":"kuldeep-s-meel","given":"Kuldeep S.","family":"Meel","affiliation":"National University of Singapore , Singapore"}],"abstract":"An important problem in network science is finding an optimal placement of sensors in nodes in order to uniquely detect failures in the network. This problem can be modelled as an identifying code set (ICS) problem, introduced by Karpovsky et al. in 1998. The ICS problem aims to find a cover of a set S, such that the elements in the cover define a unique signature for each of the elements of S, and to minimise the cover’s cardinality. In this work, we study a generalised identifying code set (GICS) problem, where a unique signature must be found for each subset of S that has a cardinality of at most k (instead of just each element of S). The concept of an independent support of a Boolean formula was introduced by Chakraborty et al. in 2014 to speed up propositional model counting, by identifying a subset of variables whose truth assignments uniquely define those of the other variables.\r\n\r\nIn this work, we introduce an extended version of independent support, grouped independent support (GIS), and show how to reduce the GICS problem to the GIS problem. We then propose a new solving method for finding a GICS, based on finding a GIS. We show that the prior state-of-the-art approaches yield integer-linear programming (ILP) models whose sizes grow exponentially with the problem size and k, while our GIS encoding only grows polynomially with the problem size and k. While the ILP approach can solve the GICS problem on networks of at most 494 nodes, the GIS-based method can handle networks of up to 21 363 nodes; a ∼40× improvement. The GIS-based method shows up to a 520× improvement on the ILP-based method in terms of median solving time. For the majority of the instances that can be encoded and solved by both methods, the cardinality of the solution returned by the GIS-based method is less than 10% larger than the cardinality of the solution found by the ILP method.","doi":"10.24963/ijcai.2023/219","url":"https://ijcai.org/proceedings/2023/219","pdf":"https://ijcai.org/proceedings/2023/0219.pdf","markdown":"https://ijcai.org/proceedings/2023/219.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/219","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":219,"pages":{"first":1971,"last":1978},"keywords":["Constraint Satisfaction and Optimization: CSO: Satisfiabilty","Constraint Satisfaction and Optimization: CSO: Constraint programming","Constraint Satisfaction and Optimization: CSO: Modeling"],"videos":[],"references":[{"position":1,"raw":"[Basu and Sen, 2021a] Kaustav Basu and Arunabha Sen. Epidemiological model independent misinformation source identification. In ICWSM Workshops, 2021.","title":"Epidemiological model independent misinformation source identification","authors":"Sen Basu, Kaustav Basu, Arunabha Sen","year":"2021","venue":"ICWSM Workshops","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Basu and Sen, 2021b] Kaustav Basu and Arunabha Sen. Identifying individuals associated with organized crimi- nal networks: A social network analysis. Soc. Networks, 64:42-54, 2021.","title":"Identifying individuals associated with organized criminal networks: A social network analysis","authors":"Sen Basu, Kaustav Basu, Arunabha Sen","year":"2021","venue":"Soc. Networks","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Chakraborty et al., 2014a] Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, and Moshe Y. Vardi. Distribution-aware sampling and weighted model counting for SAT. In AAAI, pages 1722-1730. AAAI Press, 2014.","title":"Distribution-aware sampling and weighted model counting for SAT","authors":"Supratik Chakraborty, Daniel J Fremont, Kuldeep S Meel, A Sanjit, Moshe Y Seshia, Vardi","year":"2014","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chakraborty et al., 2014b] Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. Balancing scalability and uniformity in SAT witness generator. In DAC, pages 60:1-60:6. ACM, 2014.","title":"Balancing scalability and uniformity in SAT witness generator","authors":"Supratik Chakraborty, Kuldeep S Meel, Moshe Y Vardi","year":"2014","venue":"DAC","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Ivrii et al., 2016] Alexander Ivrii, Sharad Malik, Kuldeep S. Meel, and Moshe Y. Vardi. On computing minimal in- dependent support and its applications to sampling and counting. Constraints An Int. J., 21(1):41-58, 2016.","title":"On computing minimal independent support and its applications to sampling and counting","authors":"Alexander Ivrii, Sharad Malik, Kuldeep S Meel, Moshe Y Vardi","year":"2016","venue":"Constraints An Int. J","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Karpovsky et al., 1998] Mark G. Karpovsky, Krishnendu Chakrabarty, and Lev B. Levitin. On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory, 44(2):599-611, 1998.","title":"On a new class of codes for identifying vertices in graphs","authors":"G Mark, Krishnendu Karpovsky, Lev B Chakrabarty, Levitin","year":"1998","venue":"IEEE Trans. Inf. Theory","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Lagniez et al., 2016] Jean-Marie Lagniez, Emmanuel Lonca, and Pierre Marquis. Improving model counting by leveraging definability. In IJCAI, pages 751-757. IJCAI/AAAI Press, 2016.","title":"Improving model counting by leveraging definability","authors":"Lagniez","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/112"},{"position":8,"raw":"[Lagniez et al., 2020] Jean-Marie Lagniez, Emmanuel Lonca, and Pierre Marquis. Definability for model counting. Artif. Intell., 281:103229, 2020.","title":"Definability for model counting","authors":"Lagniez","year":"2020","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Nadel, 2010] Alexander Nadel. Boosting minimal unsatis- fiable core extraction. In FMCAD, pages 221-229. IEEE, 2010.","title":"Boosting minimal unsatisfiable core extraction","authors":"Alexander Nadel","year":"2010","venue":"FMCAD","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Padhee et al., 2020] Malhar Padhee, Reetam Sen Biswas, Anamitra Pal, Kaustav Basu, and Arunabha Sen. Identify- ing unique power system signatures for determining vul- nerability of critical power system assets. SIGMETRICS Perform. Evaluation Rev., 47(4):8-11, 2020.","title":"Identifying unique power system signatures for determining vulnerability of critical power system assets","authors":"Malhar Padhee, Sen Reetam, Anamitra Biswas, Kaustav Pal, Arunabha Basu, Sen","year":"2020","venue":"SIGMETRICS Perform. Evaluation Rev","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Padoa, 1901] A. Padoa. Essai d'une théorie algébrique des nombres entiers, précédé d'une introduction logique à une theorie déductive quelconque. Bibliothèque du Congrès international de philosophie, 3:309-365, 1901.","title":"Essai d'une théorie algébrique des nombres entiers, précédé d'une introduction logique à une theorie déductive quelconque","authors":"A Padoa","year":"1901","venue":"Bibliothèque du Congrès international de philosophie","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Philipp and Steinke, 2015] Tobias Philipp and Peter Steinke. Pblib -A library for encoding pseudo-boolean constraints into CNF. In SAT, volume 9340 of Lecture Notes in Computer Science, pages 9-16. Springer, 2015.","title":"Pblib -A library for encoding pseudo-boolean constraints into CNF","authors":"Steinke Philipp, Tobias Philipp, Peter Steinke","year":"2015","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Rossi and Ahmed, 2015] Ryan A. Rossi and Nesreen K. Ahmed. The network data repository with interactive graph analytics and visualization. In AAAI, 2015.","title":"The network data repository with interactive graph analytics and visualization","authors":"Ryan A Rossi, Nesreen K Ahmed","year":"2015","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Sen et al., 2019] Arunabha Sen, Victoria Horan Goliber, Kaustav Basu, Chenyang Zhou, and Sumitava Ghosh. On upper and lower bounds of identifying code set for soc- cer ball graph with application to satellite deployment. In ICDCN, pages 307-316. ACM, 2019.","title":"On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment","authors":"Arunabha Sen, Victoria Horan Goliber, Kaustav Basu, Chenyang Zhou, Sumitava Ghosh","year":"2019","venue":"ICDCN","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Sinz, 2005] Carsten Sinz. Towards an optimal CNF encod- ing of boolean cardinality constraints. In CP, volume 3709 of Lecture Notes in Computer Science, pages 827-831. Springer, 2005.","title":"Towards an optimal CNF encoding of boolean cardinality constraints","authors":"Carsten Sinz, Sinz","year":"2005","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Soos and Meel, 2022] Mate Soos and Kuldeep S. Meel. Ar- jun: An efficient independent support computation tech- nique and its applications to counting and sampling. In ICCAD, page 71. ACM, 2022.","title":"Arjun: An efficient independent support computation technique and its applications to counting and sampling","authors":"Meel ; ] Mate Soos, Kuldeep S Soos, Meel","year":"2022","venue":"ICCAD","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Soos et al., 2009] Mate Soos, Karsten Nohl, and Claude Castelluccia. Extending SAT solvers to cryptographic problems. In SAT, volume 5584 of Lecture Notes in Com- puter Science, pages 244-257. Springer, 2009.","title":"Extending SAT solvers to cryptographic problems","authors":"Soos","year":"2009","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Yang et al., 2022] Jiong Yang, Supratik Chakraborty, and Kuldeep S. Meel. Projected model counting: Beyond inde- pendent support. In ATVA, volume 13505 of Lecture Notes in Computer Science, pages 171-187. Springer, 2022.","title":"Projected model counting: Beyond independent support","authors":"Jiong Yang, Supratik Chakraborty, Kuldeep S Meel","year":"2022","venue":"ATVA","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}