Solving complex problems using model transformations: from set constraint modeling to SAT instance solving

作者：

Highlights：

• Use of the expressivity of CSP modeling and the power of SAT solving.

• Efficient CSP-SAT transformations.

• Best ad hoc solver for the Sports Tournament Scheduling competed.

摘要

•Use of the expressivity of CSP modeling and the power of SAT solving.•Efficient CSP-SAT transformations.•Best ad hoc solver for the Sports Tournament Scheduling competed.

论文关键词：Model transformations,Constraint programming,Set constraints,SAT encoding,Combinatorial problem

论文评审过程：Received 17 March 2019, Revised 23 January 2020, Accepted 24 January 2020, Available online 31 January 2020, Version of Record 8 February 2020.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.113243