Solving the all-interval series problem: SAT vs CP

摘要: Although Boolean satisfiability (abbreviated as SAT) is a sub-field of constraint programming (CP), the former states and solves problems black-box approach, whereas latter aims at being tunable programmable. many researches bridging SAT CP have been provided, surprisingly, only few researchers compared approaches on particular problem. This paper studies how to solve all-interval series problem through both approaches. We will show that by using state-of-the-art solver an appropriate encoding approach obtains significantly higher performance over approach. Furthermore, we also provide result for several instances.