{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:54:20Z","timestamp":1725814460917},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319137698"},{"type":"electronic","value":"9783319137704"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13770-4_8","type":"book-chapter","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T08:36:05Z","timestamp":1418027765000},"page":"76-87","source":"Crossref","is-referenced-by-count":1,"title":["From Declarative Set Constraint Models to \u201cGood\u201d SAT Instances"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Lardeux","sequence":"first","affiliation":[]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Choco, \n                    \n                      http:\/\/www.emn.fr\/z-info\/choco-solver\/"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511615320"},{"key":"8_CR3","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":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O. Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 108\u2013122. Springer, Heidelberg (2003)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-24605-3_23","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Hebrard, E., Walsh, T.: Local consistencies in SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 299\u2013314. Springer, Heidelberg (2004)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible sat-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Fr\u00fcwirth, T.: Constraint Handling Rules. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511609886"},{"key":"8_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman & Company (1979)"},{"key":"8_CR9","unstructured":"Gent, I., Lynce, I.: A sat encoding for the social golfer problem. In: IJCAI 2005 Workshop on Modelling and Solving Problems with Constraints (2005)"},{"key":"8_CR10","unstructured":"Gervet, C.: Conjunto: Constraint propagation over set constraints with finite set domain variables. In: Proc. of ICLP 1994, p. 733. MIT Press (1994)"},{"key":"8_CR11","unstructured":"Lardeux, F., Monfroy, E., Crawford, B., Soto, R.: Set constraint model and automated encoding into sat: Application to the social golfer problem. Submitted to Annals of Operations Research"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-05258-3_32","volume-title":"MICAI 2009: Advances in Artificial Intelligence","author":"F. Lardeux","year":"2009","unstructured":"Lardeux, F., Monfroy, E., Saubion, F., Crawford, B., Castro, C.: SAT encoding and CSP reduction for interconnected alldiff constraints. In: Aguirre, A.H., Borja, R.M., Garci\u00e1, C.A.R. (eds.) MICAI 2009. LNCS, vol.\u00a05845, pp. 360\u2013371. Springer, Heidelberg (2009)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-54444-5_123","volume-title":"Programming Language Implementation and Logic Programming","author":"B. Legeard","year":"1991","unstructured":"Legeard, B., Legros, E.: Short overview of the CLPS system. In: Ma\u0142uszy\u0144ski, J., Wirsing, M. (eds.) PLILP 1991. LNCS, vol.\u00a0528, pp. 431\u2013433. Springer, Heidelberg (1991)"},{"key":"8_CR14","unstructured":"Mackworth, A.: Encyclopedia on Artificial Intelligence, chapter Constraint Satisfaction. John Wiley (1987)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Monfroy, E.: A coordination-based chaotic iteration algorithm for constraint propagation. In: Proc of ACM SAC 2000 (1), pp. 262\u2013269. ACM (2000)","DOI":"10.1145\/335603.335756"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-27775-0_21","volume-title":"Logic Programming","author":"E. Monfroy","year":"2004","unstructured":"Monfroy, E., Saubion, F., Lambert, T.: On hybridization of local search and constraint propagation. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 299\u2013313. Springer, Heidelberg (2004)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11493853_21","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S. Prestwich","year":"2005","unstructured":"Prestwich, S., Roli, A.: Symmetry breaking and local search spaces. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 273\u2013287. Springer, Heidelberg (2005)"},{"key":"8_CR18","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier (2006)"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10479-010-0702-5","volume":"194","author":"M. Triska","year":"2012","unstructured":"Triska, M., Musliu, N.: An improved sat formulation for the social golfer problem. Annals of Operations Research\u00a0194(1), 427\u2013438 (2012)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13770-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:42:51Z","timestamp":1559072571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13770-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319137698","9783319137704"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13770-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}