Industrial-Size Scheduling with ASP+CP

摘要

Answer Set Programming (ASP) combines a powerful, the oretically principled knowledge representation formalism and powerful solvers. To improve efficiency of computation on certain classes of prob lems, researchers have recently developed hybrid languages and solvers, combining ASP with language constructs and solving techniques from Constraint Programming (CP). The resulting ASP+CP solvers exhibit remarkable performance on "toy" problems. To the best of our knowl edge, however, no hybrid ASP+CP language and solver have been used in practical, industrial-size applications. In this paper, we report on the first such successful application, consisting of the use of the hybrid ASP+CP system EZCSP to solve sophisticated industrial-size scheduling problems.