{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:29:48Z","timestamp":1763641788203,"version":"3.40.4"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070452"},{"type":"electronic","value":"9783319070469"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07046-9_19","type":"book-chapter","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T02:07:28Z","timestamp":1399860448000},"page":"268-283","source":"Crossref","is-referenced-by-count":3,"title":["SAT and Hybrid Models of the Car Sequencing Problem"],"prefix":"10.1007","author":[{"given":"Christian","family":"Artigues","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Mayer-Eichberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Siala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Generic ILP versus specialized 0-1 ILP: An update. In: Proceedings of ICCAD, pp. 450\u2013457 (2002)","DOI":"10.1145\/774572.774638"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-74970-7_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"F. Bacchus","year":"2007","unstructured":"Bacchus, F.: GAC Via Unit Propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 133\u2013147. Springer, Heidelberg (2007)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/SAT190075","volume":"7","author":"D.L. Berre","year":"2010","unstructured":"Berre, D.L., Parrain, A.: The Sat4j library, release 2.2. Journal on Satisfiability, Boolean Modeling and Computation\u00a07, 59\u201364 (2010)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"19_CR4","unstructured":"Biere., A., Heule., M., van Maaren., H., Walsh, T.: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press (2009)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-74970-7_17","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S. Brand","year":"2007","unstructured":"Brand, S., Narodytska, N., Quimper, C.-G., Stuckey, P.J., Walsh, T.: Encodings of the Sequence Constraint. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 210\u2013224. Springer, Heidelberg (2007)"},{"key":"19_CR6","unstructured":"Cambazard, H.: R\u00e9solution de problmes combinatoires par des approches fond\u00e9es sur la notion dexplication. PhD thesis, Ecole des mines de Nantes (2006)"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10601-006-9002-8","volume":"11","author":"H. Cambazard","year":"2006","unstructured":"Cambazard, H., Jussien, N.: Identifying and exploiting problem structures using explanation-based constraint programming. Constraints\u00a011(4), 295\u2013313 (2006)","journal-title":"Constraints"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"19_CR9","unstructured":"Dixon, H.: Automating Pseudo-Boolean Inference within a DPLL Framework. PhD thesis, University of Oregon (2004)"},{"key":"19_CR10","unstructured":"Dixon, H.E., Ginsberg, M.L.: Inference Methods for a Pseudo-Boolean Satisability Solver. In: Proceedings of AAAI, pp. 635\u2013640 (2002)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating Pseudo-Boolean Constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 1\u201326 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"19_CR12","unstructured":"Feydy, T., Schutt, A., Stuckey, P.: Semantic Learning for Lazy Clause Generation. In: TRICS workshop, held alongside CP (2013)"},{"key":"19_CR13","unstructured":"Gent, I.P.: Arc Consistency in SAT. In: Proceedings of ECAI, pp. 121\u2013125 (2002)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Walsh, T.: CSPlib: A benchmark library for constraints (1999)","DOI":"10.1007\/978-3-540-48085-3_36"},{"key":"19_CR15","unstructured":"G. Katsirelos.: Nogood Processing in CSPs. PhD thesis, University of Toronto (2008)"},{"key":"19_CR16","unstructured":"Katsirelos, G., Bacchus, F.: Generalized NoGoods in CSPs. In: Proceedings of AAAI, pp. 390\u2013396 (2005)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: DAC, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10601-005-0552-y","volume":"10","author":"C.-G. Quimper","year":"2005","unstructured":"Quimper, C.-G., Golynski, A., L\u00f3pez-Ortiz, A., Beek, P.V.: An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. Constraints\u00a010(2), 115\u2013135 (2005)","journal-title":"Constraints"},{"key":"19_CR19","unstructured":"R\u00e9gin, J.C.: Generalized Arc Consistency for Global Cardinality Constraint. In: Proceedings of AAAI, vol.\u00a02, pp. 209\u2013215 (1996)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0017428","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"J.-C. R\u00e9gin","year":"1997","unstructured":"R\u00e9gin, J.-C., Puget, J.-F.: A Filtering Algorithm for Global Sequencing Constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 32\u201346. Springer, Heidelberg (1997)"},{"key":"19_CR21","unstructured":"Rossi, F., Beek, P.V., Walsh, T.: Handbook of Constraint Programming. Elsevier (2006)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Schiex, T., Verfaillie, G.: Nogood Recording for Static and Dynamic CSP. In: Proceeding of ICTAI, pp. 48\u201355 (1993)","DOI":"10.1109\/TAI.1993.633935"},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/s10601-013-9150-6","volume":"19","author":"M. Siala","year":"2014","unstructured":"Siala, M., Hebrard, E., Huguet, M.-J.: An optimal arc consistency algorithm for a particular case of sequence constraint. Constraints\u00a019(1), 30\u201356 (2014)","journal-title":"Constraints"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C. Sinz","year":"2005","unstructured":"Sinz, C.: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 827\u2013831. Springer, Heidelberg (2005)"},{"key":"19_CR25","unstructured":"Smith, B.M.: Succeed-first or Fail-first: A Case Study in Variable and Value Ordering (1996)"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C. Solnon","year":"2008","unstructured":"Solnon, C., Cung, V.D., Nguyen, A., Artigues, C.: The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF 2005 challenge problem. European Journal of Operational Research\u00a0191, 912\u2013927 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"19_CR27","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10601-008-9067-7","volume":"14","author":"W.J. van Hoeve","year":"2009","unstructured":"van Hoeve, W.J., Pesant, G., Rousseau, L.-M., Sabharwal, A.: New Filtering Algorithms for Combinations of Among Constraints. Constraints\u00a014(2), 273\u2013292 (2009)","journal-title":"Constraints"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-45349-0_32"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07046-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T21:47:20Z","timestamp":1746222440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07046-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070452","9783319070469"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07046-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}