{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/an-adaptive-prefix-assignment-technique-for","title":"An adaptive prefix-assignment technique for symmetry reduction","arxiv_id":"1706.08325","date":"2017-06-26","proceeding":null,"authors":["Tommi Junttila","Matti Karppa","Petteri Kaski","Jukka Kohonen"],"abstract":"This paper presents a technique for symmetry reduction that adaptively\nassigns a prefix of variables in a system of constraints so that the generated\nprefix-assignments are pairwise nonisomorphic under the action of the symmetry\ngroup of the system. The technique is based on McKay's canonical extension\nframework [J.~Algorithms 26 (1998), no.~2, 306--324]. Among key features of the\ntechnique are (i) adaptability---the prefix sequence can be user-prescribed and\ntruncated for compatibility with the group of symmetries; (ii)\nparallelizability---prefix-assignments can be processed in parallel\nindependently of each other; (iii) versatility---the method is applicable\nwhenever the group of symmetries can be concisely represented as the\nautomorphism group of a vertex-colored graph; and (iv) implementability---the\nmethod can be implemented relying on a canonical labeling map for\nvertex-colored graphs as the only nontrivial subroutine. To demonstrate the\npractical applicability of our technique, we have prepared an experimental\nopen-source implementation of the technique and carry out a set of experiments\nthat demonstrate ability to reduce symmetry on hard instances. Furthermore, we\ndemonstrate that the implementation effectively parallelizes to compute\nclusters with multiple nodes via a message-passing interface.","url_abs":"http://arxiv.org/abs/1706.08325v2","url_pdf":"http://arxiv.org/pdf/1706.08325v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"an-adaptive-prefix-assignment-technique-for","repo_url":"https://github.com/mkarppa/reduce","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"an-adaptive-prefix-assignment-technique-for","repo_url":"https://github.com/pkaski/reduce","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}