{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T15:24:57Z","timestamp":1791127497299,"version":"4.1.0"},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Car sequencing is a well known NP-complete problem. This<\/jats:p><jats:p>paper introduces encodings of this problem into CNF based on sequential<\/jats:p><jats:p>counters. We demonstrate that SAT solvers are powerful in this domain<\/jats:p><jats:p>and report new lower bounds for the benchmark set in the CSPlib.<\/jats:p>","DOI":"10.29007\/jrsp","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:02:53Z","timestamp":1516730573000},"page":"15-1","source":"Crossref","is-referenced-by-count":1,"title":["SAT Encodings for the Car Sequencing Problem"],"prefix":"10.29007","volume":"29","author":[{"given":"Valentin","family":"Mayer-Eichberger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"11545","event":{"name":"POS-13. Pragmatics of SAT 2013"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:02:54Z","timestamp":1516730574000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/JXzd"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/jrsp","relation":{},"ISSN":["2398-7340"],"issn-type":[{"value":"2398-7340","type":"print"}],"subject":[]}}