TY - GEN
T1 - Constraint generation via automated theory formation
AU - Colton, Simon
AU - Miguel, Ian
N1 - Funding: This work is supported by EPSRC grants GR/M98012 and GR/N16129.
PY - 2001/11/19
Y1 - 2001/11/19
N2 - Adding constraints to a basic CSP model can significantly reduce search,e.g. for Golomb rulers [6]. The generation process is usually performed by hand, although some recent work has focused on automatically generating symmetry breaking constraints [4]and (less so)on generating implied constraints [5]. We describe an approach to generating implied,symmetry breaking and specialisation constraints and apply this technique to quasigroup construction [10].
AB - Adding constraints to a basic CSP model can significantly reduce search,e.g. for Golomb rulers [6]. The generation process is usually performed by hand, although some recent work has focused on automatically generating symmetry breaking constraints [4]and (less so)on generating implied constraints [5]. We describe an approach to generating implied,symmetry breaking and specialisation constraints and apply this technique to quasigroup construction [10].
UR - https://doi.org/10.1007/3-540-45578-7
U2 - 10.1007/3-540-45578-7_42
DO - 10.1007/3-540-45578-7_42
M3 - Conference contribution
AN - SCOPUS:84947916612
SN - 9783540428633
T3 - Lecture notes in computer science
SP - 575
EP - 579
BT - Principles and practice of constraint programming
A2 - Walsh, Toby
PB - Springer-Verlag
CY - Heidelberg
T2 - 7th International Conference on Principles and Practice of Constraint Programming, CP 2001
Y2 - 26 November 2001 through 1 December 2001
ER -