A Meta Constraint Satisfaction Optimization Problem for the Optimization of Regular Constraint Satisfaction Problems

摘要

This paper describes a new approach on optimization of regular constraint satisfaction problems (rCSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects areas with a potentially high number of conflicts. The purpose of this approach is to remove conflicts by the combination of regular constraints with intersection and concatenation of their underlying deterministic finite automatons (DFAs). This. eventually, often allows to significantly speed-up the solution process of the original rCSP.