Download PDFOpen PDF in browserSAT Encodings for the Car Sequencing Problem13 pages•Published: July 28, 2014AbstractCar sequencing is a well known NP-complete problem. Thispaper introduces encodings of this problem into CNF based on sequential counters. We demonstrate that SAT solvers are powerful in this domain and report new lower bounds for the benchmark set in the CSPlib. Keyphrases: application of sat, car sequencing, decomposition into cnf, sat encodings In: Daniel Le Berre (editor). POS-13. Pragmatics of SAT 2013, vol 29, pages 15-27.
|