{"type":"ScholarlyArticle","title":"Eliminating the Computation of Strongly Connected Components in Generalized Arc Consistency Algorithm for AllDifferent Constraint","authors":[{"name":"Luhan Zhen","slug":"luhan-zhen","given":"Luhan","family":"Zhen","affiliation":"College of Computer Science and Technology , Jilin University , Changchun 130012 , China; Key Laboratory of Symbolic Computation and Knowledge Engineering ( Jilin University) , Ministry of Education , Changchun 130012 , China"},{"name":"Zhanshan Li","slug":"zhanshan-li","given":"Zhanshan","family":"Li","affiliation":"College of Computer Science and Technology , Jilin University , Changchun 130012 , China; Key Laboratory of Symbolic Computation and Knowledge Engineering ( Jilin University) , Ministry of Education , Changchun 130012 , China"},{"name":"Yanzhi Li","slug":"yanzhi-li","given":"Yanzhi","family":"Li","affiliation":"College of Software , Jilin University , Changchun , 130012 , China; Key Laboratory of Symbolic Computation and Knowledge Engineering ( Jilin University) , Ministry of Education , Changchun 130012 , China"},{"name":"Hongbo Li","slug":"hongbo-li","given":"Hongbo","family":"Li","affiliation":"School of Information Science and Technology , Northeast Normal University , Changchun , China"}],"abstract":"AllDifferent constraint is widely used in Constraint Programming to model real world problems. Existing Generalized Arc Consistency (GAC) algorithms map an AllDifferent constraint onto a bipartite graph and utilize the structure of Strongly Connected Components (SCCs) in the graph to filter values. Calculating SCCs is time-consuming in the existing algorithms, so we propose a novel GAC algorithm for AllDifferent constraint in this paper, which eliminates the computation of SCCs. We prove that all redundant edges in the bipartite graph point to some alternating cycles. Our algorithm exploits this property and uses a more efficient method to filter values, which is based on breadth-first search. Experimental results on the XCSP3 benchmark suite show that our algorithm considerably outperforms the state-of-the-art GAC algorithms.","doi":"10.24963/ijcai.2023/228","url":"https://ijcai.org/proceedings/2023/228","pdf":"https://ijcai.org/proceedings/2023/0228.pdf","markdown":"https://ijcai.org/proceedings/2023/228.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/228","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":228,"pages":{"first":2049,"last":2057},"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. American Elsevier Publishing Company, 1973.","title":"Graphs and hypergraphs","authors":"Claude Berge, Berge","year":"1973","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bessiere and Régin, 1997] Christian Bessiere and Jean- Charles Régin. Arc consistency for general constraint net- works: preliminary results. In IJCAI, volume 2, pages 398-404.","title":"Christian Bessiere and Jean-Charles Régin. Arc consistency for general constraint networks: preliminary results","authors":"Régin Bessiere","year":"1997","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bessiere et al., 2004] Christian Bessiere, Emmanuel He- brard, Brahim Hnich, and Toby Walsh. Disjoint, partition and intersection constraints for set and multiset variables. CP, 4:138-152, 2004.","title":"Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, and Toby Walsh. Disjoint, partition and intersection constraints for set and multiset variables","authors":"Bessiere","year":"2004","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Boussemart et al., 2004] Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, and Lakhdar Sais. Boost- ing systematic search by weighting constraints. In ECAI, volume 16, page 146, 2004.","title":"Boosting systematic search by weighting constraints","authors":"Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Sais","year":"2004","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":5,"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":6,"raw":"[Bundy and Wallen, 1984] Alan Bundy and Lincoln Wallen. Breadth-first search. In Catalogue of artificial intelligence tools, pages 13-13. Springer, 1984.","title":"Alan Bundy and Lincoln Wallen. Breadth-first search","authors":"Wallen Bundy","year":"1984","venue":"Catalogue of artificial intelligence tools","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Fellows et al., 2013] Michael Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, and Frances Rosa- mond. Constraint satisfaction problems: Convexity makes alldifferent constraints tractable. Theoretical Computer Science, 472:81-89, 2013.","title":"Constraint satisfaction problems: Convexity makes alldifferent constraints tractable","authors":"Michael Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances Rosamond","year":"2013","venue":"Theoretical Computer Science","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 alldif- ferent constraint: An empirical survey. AI, 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":"AI","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Jean-Charles, 1996] Régin Jean-Charles. Generalized arc consistency for global cardinality constraint. American Association for Artificial Intelligence (AAAI 1996), pages 209-215, 1996.","title":"Régin Jean-Charles. Generalized arc consistency for global cardinality constraint","authors":"Jean-Charles","year":"1996","venue":"American Association for Artificial Intelligence (AAAI 1996)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Kuhn, 1955] Harold W Kuhn. The hungarian method for the assignment problem. Naval research logistics quarterly, 2(1-2):83-97, 1955.","title":"The hungarian method for the assignment problem","authors":"Harold W Kuhn","year":"1955","venue":"Naval research logistics quarterly","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Lauriere, 1978] Jena-Lonis Lauriere. A language and a pro- gram for stating and solving combinatorial problems. AI, 10(1):29-127, 1978.","title":"A language and a program for stating and solving combinatorial problems","authors":"Jena-Lonis Lauriere","year":"1978","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":12,"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 IJCAI, volume 3, 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":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2003/36"},{"position":13,"raw":"[Prud'homme et al., 2016] Charles Prud'homme, Jean- Guillaume Fages, and Xavier Lorca. Choco solver documentation. TASC, INRIA Rennes, LINA CNRS UMR, 6241, 2016.","title":"Choco solver documentation","authors":"Prud'homme","year":"2016","venue":"Charles Prud'homme","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Puget, 1998] Jean-Franc ¸ois Puget. A fast algorithm for the bound consistency of alldiff constraints. In AAAI, pages 359-366, 1998.","title":"A fast algorithm for the bound consistency of alldiff constraints","authors":"Jean-Franc ¸ois Puget","year":"1998","venue":"AAAI","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 AAAI, volume 94, pages 362-367, 1994.","title":"A filtering algorithm for constraints of difference in csps","authors":"Jean-Charles Régin","year":"1994","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Rossi et al., 2006] Francesca Rossi, Peter Van Beek, and Toby Walsh. Handbook of constraint programming. El- sevier, 2006.","title":"Handbook of constraint programming","authors":"Francesca Rossi, Peter Van Beek, Toby Walsh","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Shaw, 2004] Paul Shaw. A constraint for bin packing. In Principles and Practice of Constraint Programming-CP 2004: 10th International Conference, CP 2004, Toronto, Canada, September 27-October 1, 2004. Proceedings 10, pages 648-662. Springer, 2004.","title":"A constraint for bin packing","authors":"Paul Shaw","year":"2004","venue":"Principles and Practice of Constraint Programming-CP 2004: 10th International Conference, CP 2004","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Suijlen et al., 2022] Wijnand Suijlen, Félix de Framond, Arnaud Lallouet, and Antoine Petitet. A parallel algorithm for gac filtering of the alldifferent constraint. In Interna- tional Conference on Integration of Constraint Program- ming, Artificial Intelligence, and Operations Research, pages 390-407. Springer, 2022.","title":"A parallel algorithm for gac filtering of the alldifferent constraint","authors":"Wijnand Suijlen, Félix De Framond, Arnaud Lallouet, Antoine Petitet","year":"2022","venue":"International Conference on Integration of Constraint Program-ming, Artificial Intelligence, and Operations Research","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Tardivo et al., 2022] Fabio Tardivo, Agostino Dovier, An- drea Formisano, Laurent Michel, and Enrico Pontelli. Constraints propagation on gpu: A case study for alldif- ferent. In PCILC, CEUR-WS, 2022.","title":"Constraints propagation on gpu: A case study for alldifferent","authors":"Fabio Tardivo, Agostino Dovier, Andrea Formisano, Laurent Michel, Enrico Pontelli","year":"2022","venue":"PCILC, CEUR-WS","doi":null,"url":null,"internal_url":null},{"position":20,"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":21,"raw":"[Van Hoeve et al., 2006] Willem-Jan Van Hoeve, Gilles Pe- sant, Louis-Martin Rousseau, and Ashish Sabharwal. Re- visiting the sequence constraint. In Principles and Prac- tice of Constraint Programming-CP 2006: 12th Interna- tional Conference, CP 2006, Nantes, France, September 25-29, 2006. Proceedings 12, pages 620-634. Springer, 2006.","title":"Revisiting the sequence constraint","authors":"Van Hoeve","year":"2006","venue":"Principles and Practice of Constraint Programming-CP 2006: 12th International Conference, CP 2006","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Van Hoeve, 2001] Willem-Jan Van Hoeve. The alldifferent constraint: A survey. arXiv preprint cs/0105015, 2001.","title":"The alldifferent constraint: A survey","authors":"; Willem-Jan Van Hoeve, Van Hoeve","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Van Kessel and Quimper, 2012] Philippe Van Kessel and Claude-Guy Quimper. Filtering algorithms based on the word-ram model. In AAAI, volume 26, pages 577-583, 2012.","title":"Filtering algorithms based on the word-ram model","authors":"Van Kessel, Philippe Quimper, Claude-Guy Van Kessel, Quimper","year":"2012","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Wallace, 1996] Mark Wallace. Practical applications of constraint programming. Constraints, 1(1):139-168, 1996.","title":"Practical applications of constraint programming","authors":"Mark Wallace","year":"1996","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Zhang et al., 2018] Xizhe Zhang, Qian Li, and Weixiong Zhang. A fast algorithm for generalized arc consistency of the alldifferent constraint. In IJCAI, pages 1398-1403, 2018.","title":"A fast algorithm for generalized arc consistency of the alldifferent constraint","authors":"Zhang","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/194"},{"position":26,"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 IJCAI, pages 1126-1133, 2020.","title":"Early and efficient identification of useless constraint propagation for alldifferent constraints","authors":"Zhang","year":"2020","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2020/157"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}