SAT Encodings for the Car Sequencing Problem

13 pages•Published: July 28, 2014

Valentin Mayer-Eichberger and Toby Walsh

Abstract

Car sequencing is a well known NP-complete problem. This
paper 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.

Links:	https://easychair.org/publications/paper/JXzd
	https://doi.org/10.29007/jrsp

BibTeX entry

@inproceedings{POS-13:SAT_Encodings_Car_Sequencing,
  author    = {Valentin Mayer-Eichberger and Toby Walsh},
  title     = {SAT Encodings for the Car Sequencing Problem},
  booktitle = {POS-13. Pragmatics of SAT 2013},
  editor    = {Daniel Le Berre},
  series    = {EPiC Series in Computing},
  volume    = {29},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/JXzd},
  doi       = {10.29007/jrsp},
  pages     = {15-27},
  year      = {2014}}

Download PDF Open PDF in browser