The long-term goal of our research is to provide syntactic criteria for the automatic reformulation of combinatorial and constraint problems specifications, in order to improve solver efficiency. Our current investigations focus on the selection of constraints that can be safely “delayed” and solved afterwards, yet guaranteeing that every solution of the reformulated spec can be reconduced, via the application of the delayed constraints, to a solution of the original one. A consequence of this approach is that the set of solutions is enlarged, thus hopefully obtaining a speed-up in the solving process.
Reformulation techniques for a class of permutation problems / Mancini, Toni. - STAMPA. - 2833:(2003), pp. 984-984. (Intervento presentato al convegno Ninth International Conference on Principles and Practice of Constraint Programming (CP 2003) tenutosi a Kinsale, Ireland nel September 29 - October 3, 2003) [10.1007/978-3-540-45193-8_108].
Reformulation techniques for a class of permutation problems
MANCINI, Toni
2003
Abstract
The long-term goal of our research is to provide syntactic criteria for the automatic reformulation of combinatorial and constraint problems specifications, in order to improve solver efficiency. Our current investigations focus on the selection of constraints that can be safely “delayed” and solved afterwards, yet guaranteeing that every solution of the reformulated spec can be reconduced, via the application of the delayed constraints, to a solution of the original one. A consequence of this approach is that the set of solutions is enlarged, thus hopefully obtaining a speed-up in the solving process.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
