{"type":"ScholarlyArticle","title":"A Bitwise GAC Algorithm for Alldifferent Constraints","authors":[{"name":"Zhe Li","slug":"zhe-li","given":"Zhe","family":"Li","affiliation":"National University of Defense Technology , Changsha , China"},{"name":"Yaohua Wang","slug":"yaohua-wang","given":"Yaohua","family":"Wang","affiliation":"National University of Defense Technology , Changsha , China"},{"name":"Zhanshan Li","slug":"zhanshan-li","given":"Zhanshan","family":"Li","affiliation":"Jilin University , Changchun , China"}],"abstract":"The generalized arc consistency (GAC) algorithm is the prevailing solution for alldifferent constraint problems. The core part of GAC for alldifferent constraints is excavating and enumerating all the strongly connected components (SCCs) of the graph model. This causes a large amount of complex data structures to maintain the node information, leading to a large overhead both in time and memory space. More critically, the complexity of the data structures further precludes the coordination of different optimization schemes for GAC. To solve this problem, the key observation of this paper is that the GAC algorithm only cares whether a node of the graph model is in an SCC or not, rather than which SCCs it belongs to. Based on this observation, we propose AllDiffbit, which employs bitwise data structures and operations to efficiently determine if a node is in an SCC. This greatly reduces the corresponding overhead, and enhances the ability to incorporate existing optimizations to work in a synergistic way. Our experiments show that AllDiffbit outperforms the state-of-the-art GAC algorithms over 60%.","doi":"10.24963/ijcai.2023/221","url":"https://ijcai.org/proceedings/2023/221","pdf":"https://ijcai.org/proceedings/2023/0221.pdf","markdown":"https://ijcai.org/proceedings/2023/221.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/221","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":221,"pages":{"first":1988,"last":1995},"keywords":["Constraint Satisfaction and Optimization: CSO: Constraint satisfaction","Constraint Satisfaction and Optimization: CSO: Constraint programming"],"videos":[],"references":[{"position":1,"raw":"[Berge, 1973] Claude Berge. Graphs and Hypergraphs. North-Holland Publishing Company, 1973.","title":"Graphs and Hypergraphs","authors":"Claude Berge","year":"1973","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bessiere et al., 2009] Christian Bessiere, George Katsire- los, Nina Narodytska, Claude-Guy Quimper, and Toby Walsh. Decompositions of all different, global cardinality and related constraints. In International Joint Conference on Artificial Intelligence, pages 419-424, 2009.","title":"Decompositions of all different, global cardinality and related constraints","authors":"Bessiere","year":"2009","venue":"International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2009/77"},{"position":3,"raw":"[Boussemart et al., 2016] Frédéric Boussemart, Christophe Lecoutre, Gilles Audemard, and Cédric Piette. Xcsp3: an integrated format for benchmarking combinatorial con- strained problems. arXiv preprint arXiv:1611.03398, 2016.","title":"Xcsp3: an integrated format for benchmarking combinatorial constrained problems","authors":"Frédéric Boussemart, Christophe Lecoutre, Gilles Audemard, Cédric Piette","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cheriyan and Mehlhorn, 1996] Joseph Cheriyan and Kurt Mehlhorn. Algorithms for dense graphs and networks on the random access computer. Algorithmica, 15(6):521- 549, 1996.","title":"Algorithms for dense graphs and networks on the random access computer","authors":"Mehlhorn Cheriyan, Joseph Cheriyan, Kurt Mehlhorn","year":"1996","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dechter and Meiri, 1994] Rina Dechter and Itay Meiri. Ex- perimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence, 68(2):211-241, 1994.","title":"Experimental evaluation of preprocessing algorithms for constraint satisfaction problems","authors":"Rina Dechter, Itay Meiri","year":"1994","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Demeulenaere et al., 2016] Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, and Pierre Schaus. Compact- table: efficiently filtering table constraints with reversible sparse bit-sets. In Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings 22, pages 207-223. Springer, 2016.","title":"Compacttable: efficiently filtering table constraints with reversible sparse bit-sets","authors":"Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus","year":"2016","venue":"Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Ford and Fulkerson, 1956] L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399-404, 1956.","title":"Maximal flow through a network","authors":"L R Ford, D R Fulkerson","year":"1956","venue":"Canadian Journal of Mathematics","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gent et al., 2008] Ian P Gent, Ian Miguel, and Peter Nightingale. Generalised arc consistency for the alldiffer- ent constraint: An empirical survey. Artificial Intelligence, 172(18):1973-2000, 2008.","title":"Generalised arc consistency for the alldifferent constraint: An empirical survey","authors":"Ian P Gent, Ian Miguel, Peter Nightingale","year":"2008","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Lauriere, 1978] Jena-Lonis Lauriere. A language and a pro- gram for stating and solving combinatorial problems. Ar- tificial intelligence, 10(1):29-127, 1978.","title":"A language and a program for stating and solving combinatorial problems","authors":"Jena-Lonis Lauriere","year":"1978","venue":"Artificial intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Leconte, 1996] Michel Leconte. A bounds-based reduction scheme for constraints of difference. In Proceedings of the Constraint-96 International Workshop on Constraint- Based Reasoning, pages 19-28, 1996.","title":"A bounds-based reduction scheme for constraints of difference","authors":"Michel Leconte","year":"1996","venue":"Proceedings of the Constraint-96 International Workshop on Constraint-Based Reasoning","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Lecoutre and Vion, 2008] Christophe Lecoutre and Julien Vion. Enforcing arc consistency using bitwise operations. Constraint Programming Letters (CPL), 2:21-35, 2008.","title":"Enforcing arc consistency using bitwise operations","authors":"Christophe Lecoutre, Julien Vion","year":"2008","venue":"Constraint Programming Letters (CPL)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Li et al., 2021] Zhe Li, Zhezhou Yu, Hongbo Li, Jinsong Guo, and Zhanshan Li. Revisiting the efficacy of weak consistencies: a study of forward checking. Science China Information Sciences, 64:1-3, 2021.","title":"Revisiting the efficacy of weak consistencies: a study of forward checking","authors":"Zhe Li, Zhezhou Yu, Hongbo Li, Jinsong Guo, Zhanshan Li","year":"2021","venue":"Science China Information Sciences","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[López-Ortiz et al., 2003] Alejandro López-Ortiz, Claude- Guy Quimper, John Tromp, and Peter Van Beek. A fast and simple algorithm for bounds consistency of the alld- ifferent constraint. In International Joint Conference on Artificial Intelligence, pages 245-250, 2003.","title":"A fast and simple algorithm for bounds consistency of the alldifferent constraint","authors":"Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp, Peter Van Beek","year":"2003","venue":"International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2003/36"},{"position":14,"raw":"[Prud'homme et al., 2017] Charles Prud'homme, Jean- Guillaume Fages, and Xavier Lorca. Choco Documenta- tion. TASC -LS2N CNRS UMR 6241, COSLING S.A.S., 2017.","title":"Charles Prud'homme","authors":"Prud'homme","year":"2017","venue":"Choco Documentation. TASC -LS2N CNRS UMR 6241","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Régin, 1994] Jean-Charles Régin. A filtering algorithm for constraints of difference in csps. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 94, pages 362-367, 1994.","title":"A filtering algorithm for constraints of difference in csps","authors":"Jean-Charles Régin","year":"1994","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Tarjan, 1972] Robert Tarjan. Depth-first search and linear graph algorithms. SIAM journal on computing, 1(2):146- 160, 1972.","title":"Depth-first search and linear graph algorithms","authors":"Robert Tarjan","year":"1972","venue":"SIAM journal on computing","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Van Kessel and Quimper, 2012] Philippe Van Kessel and Claude-Guy Quimper. Filtering algorithms based on the word-ram model. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 26, 2012.","title":"Filtering algorithms based on the word-ram model","authors":"Van Kessel, Philippe Quimper, Claude-Guy Van Kessel, Quimper","year":"2012","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Wang et al., 2016] Ruiwei Wang, Wei Xia, Roland HC Yap, and Zhanshan Li. Optimizing simple tabular reduction with a bitwise representation. In International Joint Con- ference on Artificial Intelligence, pages 787-795, 2016.","title":"Optimizing simple tabular reduction with a bitwise representation","authors":"Wang","year":"2016","venue":"International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2016/117"},{"position":19,"raw":"[Zhang et al., 2017] Xizhe Zhang, Jianfei Han, and Weix- iong Zhang. An efficient algorithm for finding all possible input nodes for controlling complex networks. Scientific Reports, 7(1):10677, 2017.","title":"An efficient algorithm for finding all possible input nodes for controlling complex networks","authors":"Zhang","year":"2017","venue":"Scientific Reports","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Zhang et al., 2018] Xizhe Zhang, Qian Li, and Weixiong Zhang. A fast algorithm for generalized arc consistency of the alldifferent constraint. In International Joint Con- ference on Artificial Intelligence, pages 1398-1403, 2018.","title":"A fast algorithm for generalized arc consistency of the alldifferent constraint","authors":"Zhang","year":"2018","venue":"International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2018/194"},{"position":21,"raw":"[Zhang et al., 2020] Xizhe Zhang, Jian Gao, Yizhi Lv, and Weixiong Zhang. Early and efficient identification of use- less constraint propagation for alldifferent constraints. In International Joint Conference on Artificial Intelligence, pages 1126-1133, 2020.","title":"Early and efficient identification of useless constraint propagation for alldifferent constraints","authors":"Zhang","year":"2020","venue":"International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2020/157"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}