A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This paper presents a technique for symmetry reduction that adaptively assigns a prefix of variables in a system of constraints so that the generated prefix-assignments are pairwise nonisomorphic under the action of the symmetry group of the system. The technique is based on McKay's canonical extension framework [J. Algorithms 26 (1998), no. 2, 306-324]. Among key features of the technique are (i) adaptability-the prefix sequence can be user-prescribed and truncated for compatibility with thedoi:10.1007/978-3-319-66263-3_7 fatcat:eoxyvqrldrhk7blva45vvou57u