SBDS in GNU Prolog
A new implementation of SBDS in GNU Prolog (Symmetry Breaking During Search) is available here. This algorithm allows to break all specified symmetries of
a CSP problem thanks to a new labeling function. A presentation of this program has been made in JFPLC'03 (you can find the corresponding paper here).