{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:02:50Z","timestamp":1760608970518,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,12,15]],"date-time":"2016-12-15T00:00:00Z","timestamp":1481760000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10601-016-9261-y","type":"journal-article","created":{"date-parts":[[2016,12,15]],"date-time":"2016-12-15T04:36:31Z","timestamp":1481776591000},"page":"403-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constraint-directed search for all-interval series"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8922-7938","authenticated-orcid":false,"given":"Md Masbaul Alam","family":"Polash","sequence":"first","affiliation":[]},{"given":"M. A. Hakim","family":"Newton","sequence":"additional","affiliation":[]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,15]]},"reference":[{"key":"9261_CR1","unstructured":"Ilog solver. http:\/\/www.cs.cornell.edu\/w8\/iisi\/ilog\/cp11\/usrsolver\/usrsolverpreface.html ."},{"key":"9261_CR2","unstructured":"Minizinc challenge 2013 results. https:\/\/www.minizinc.org\/challenge2013\/results2013.html ."},{"key":"9261_CR3","unstructured":"Adamaszek, M. (2006). Efficient enumeration of graceful permutations. arXiv: math\/0608513 ."},{"key":"9261_CR4","doi-asserted-by":"crossref","unstructured":"Alsinet, T., Bejar, R., Cabiscol, A., Fernandez, C., & Manya, F. (2002). Minimal and redundant SAT encodings for the all-interval series problem. In Topics in artificial intelligence, 5th catalonian conference on AI (CCIA), LNCS, (Vol. 2504 pp. 139\u2013144).","DOI":"10.1007\/3-540-36079-4_12"},{"key":"9261_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling, 20, 97\u2013123.","journal-title":"Journal of Mathematical and Computer Modelling"},{"issue":"12","key":"9261_CR6","doi-asserted-by":"crossref","first-page":"1613","DOI":"10.1016\/j.dam.2005.10.020","volume":"155","author":"R B\u00e9jar","year":"2007","unstructured":"B\u00e9jar, R., Many\u00e0, F., Cabiscol, A., Fern\u00e0ndez, C., & Gomes, C. (2007). Regular-sat: a many-valued approach to solving combinatorial problems. Discrete Applied Mathematics, 155(12), 1613\u20131626.","journal-title":"Discrete Applied Mathematics"},{"key":"9261_CR7","unstructured":"Choi, C., & Lee, J. (2002). On the pruning behaviour of minimal combined models for permutation csps. In International workshop on reformulating constraint satisfaction problems."},{"key":"9261_CR8","doi-asserted-by":"crossref","unstructured":"Codognet, P., & Diaz, D. (2001). Yet another local search method for constraint solving. In Proceedings of the international symposium on stochastic algorithms: foundations and applications, SAGA \u201901 (pp. 73\u201390): Springer.","DOI":"10.1007\/3-540-45322-9_5"},{"key":"9261_CR9","volume-title":"Grove\u2019s dictionary of music and musicians","author":"H Colles","year":"1940","unstructured":"Colles, H. (1940). Grove\u2019s dictionary of music and musicians. New York: The MacMillan Company."},{"key":"9261_CR10","doi-asserted-by":"publisher","unstructured":"Dent, M.J., & Mercer, R.E. (1994). Minimal forward checking. In Proceedings of the 6th international conference on tools with artificial intelligence. (pp. 432\u2013438): IEEE.doi: 10.1109\/TAI.1994.346460","DOI":"10.1109\/TAI.1994.346460"},{"key":"9261_CR11","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/978-3-642-04238-6_50","volume":"5753","author":"M Gebser","year":"2009","unstructured":"Gebser, M., Kaufmann, B., & Schaub, T. (2009). The conflict-driven answer set solver Clasp. Lecture Notes in Computer Science, Springer, 5753, 509\u2013514.","journal-title":"Lecture Notes in Computer Science, Springer"},{"key":"9261_CR12","unstructured":"Gent, I. P., McDonald, I., & Smith, B. M. (2003). Conditional symmetry in the all-interval series problem. In Proceedings of the 3rd international workshop on symmetry in constraint satisfaction problems, (Vol. 3 pp. 55\u201365)."},{"key":"9261_CR13","unstructured":"Hoos, H. H. (1998). Stochastic local search - methods, models, applications. Ph.D. thesis, Department of Computer Science, Technical University of Darmstadt, Germany."},{"issue":"3","key":"9261_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/117009.117012","volume":"13","author":"S Hudson","year":"1991","unstructured":"Hudson, S. (1991). Incremental attribute evaluation: a flexible algorithm for lazy update. ACM Transactions on Programming Language and Systems, 13(3), 315\u2013341. doi: 10.1145\/117009.117012 .","journal-title":"ACM Transactions on Programming Language and Systems"},{"key":"9261_CR15","doi-asserted-by":"crossref","DOI":"10.1525\/9780520334977","volume-title":"Horizons circled-reflections on my music","author":"E Krenek","year":"1974","unstructured":"Krenek, E. (1974). Horizons circled-reflections on my music. Berkeley: University of California Press."},{"key":"9261_CR16","doi-asserted-by":"crossref","unstructured":"Moisan, T., Gaudreault, J., & Quimper, C. G. (2013). Parallel discrepancy-based search. In International conference on principles and practice of constraint programming (pp. 30\u201346): Springer.","DOI":"10.1007\/978-3-642-40627-0_6"},{"key":"9261_CR17","first-page":"645","volume":"6876","author":"M Newton","year":"2011","unstructured":"Newton, M., Pham, D., Sattar, A., & Maher, M. (2011). Kangaroo: an efficient constraint-based local search system using lazy propagation. CP. LNCS, Springer, Heidelberg, 6876, 645\u2013659.","journal-title":"CP. LNCS, Springer, Heidelberg"},{"key":"9261_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen, V., & Son, M. (2014). Solving the all-interval series problem: SAT vs CP. In Proceedings of the 5th symposium on information and communication technology (pp. 65\u201374).","DOI":"10.1145\/2676585.2676605"},{"key":"9261_CR19","doi-asserted-by":"crossref","unstructured":"Petrie, K. E., & Smith, B. M. (2003). Symmetry breaking in graceful graphs. In Rossi, F. (Ed.) Proceedings of principles and practice of constraint programming: Springer.","DOI":"10.1007\/978-3-540-45193-8_81"},{"key":"9261_CR20","unstructured":"Puget, J., & Regin, J. Solving the all-interval problem. http:\/\/www.cs.st-andrews.ac.uk\/ianm\/CSPLib\/prob\/prob007\/puget.pdf ."},{"key":"9261_CR21","unstructured":"Remzi, H.A.D., & Andrea, C.A.D. (2014). Operating systems: three easy steps Arpaci-Dusseau books."},{"key":"9261_CR22","first-page":"297","volume-title":"Proceedings of the 17th national conference on artificial intelligence (AAAI-2000)","author":"D Schuurmans","year":"2000","unstructured":"Schuurmans, D., & Southey, F. (2000). Local search characteristics of incomplete SAT procedures. In Proceedings of the 17th national conference on artificial intelligence (AAAI-2000) (pp. 297\u2013302). Austin\/TX, USA: AAAI Press."},{"key":"9261_CR23","unstructured":"Simonis, H., Beldiceanu, N., & Sa, C. (1998). A note on CSPLIB prob007. Tech. rep., Normale."},{"key":"9261_CR24","unstructured":"Solnon, C. (2000). Solving permutation constraint satisfaction problems with artificial ants. In Proceedings of ECAI\u20192000 (pp. 118\u2013122): IOS Press."},{"key":"9261_CR25","unstructured":"Toro, M., Rueda, C., Agon, C., & Assayag, G. (2015). Gelisp: a library to represent musical csps and search strategies. Computing Research Repository. arXiv: 1510.02828 ."},{"key":"9261_CR26","unstructured":"Truchet, C., Richoux, F., & Codognet, P. (2012). Prediction of parallel speed-ups for las vegas algorithms. arXiv: 1212.4287 ."},{"key":"9261_CR27","doi-asserted-by":"crossref","unstructured":"Walsh, T. (2010). Parameterized complexity results in symmetry breaking. In Proceedings of 5th international symposium, IPEC, Chennai, India, LNCS, (Vol. 6478 pp. 4\u201313): Springer.","DOI":"10.1007\/978-3-642-17493-3_3"},{"key":"9261_CR28","doi-asserted-by":"publisher","unstructured":"Worister, M., Steinlechner, H., Maierhofer, S., & Tobler, R. (2013). Lazy incremental computation for efficient scene graph rendering. In Proceedings of the 5th high-performance graphics conference. doi: 10.1145\/2492045.2492051 (pp. 53\u201362). New York, NY, USA: ACM.","DOI":"10.1145\/2492045.2492051"},{"key":"9261_CR29","unstructured":"Yadav, S.C., & Singh, S.K. (2009). An introduction to Client\/Server Computing, New Age International Publishers Limited."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-016-9261-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9261-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9261-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T08:16:55Z","timestamp":1658045815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-016-9261-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,15]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["9261"],"URL":"https:\/\/doi.org\/10.1007\/s10601-016-9261-y","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2016,12,15]]}}}