{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T01:58:04Z","timestamp":1761962284894,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153952"},{"type":"electronic","value":"9783642153969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15396-9_37","type":"book-chapter","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T07:00:16Z","timestamp":1283756416000},"page":"460-474","source":"Crossref","is-referenced-by-count":11,"title":["A Generic Visualization Platform for CP"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Simonis","sequence":"first","affiliation":[]},{"given":"Paul","family":"Davern","sequence":"additional","affiliation":[]},{"given":"Jacob","family":"Feldman","sequence":"additional","affiliation":[]},{"given":"Deepak","family":"Mehta","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Quesada","sequence":"additional","affiliation":[]},{"given":"Mats","family":"Carlsson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"37_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling problems. Journal of Mathematical and Computer Modelling\u00a017(7), 57\u201373 (1993)","journal-title":"Journal of Mathematical and Computer Modelling"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-74970-7_15","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N. Beldiceanu","year":"2007","unstructured":"Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., Truchet, C.: A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 180\u2013194. Springer, Heidelberg (2007)"},{"key":"37_CR3","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global constraint catalog. Technical Report T2005:08, SICS (May 2005)"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-540-27775-0_36","volume-title":"Logic Programming","author":"P. Deransart","year":"2004","unstructured":"Deransart, P.: Main results of the OADymPPaC project. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 456\u2013457. Springer, Heidelberg (2004)"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/10722311","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"P. Deransart","year":"2000","unstructured":"Deransart, P., Hermenegildo, M.V., Ma\u0142uszy\u0144ski, J.: DiSCiPl 1999. LNCS, vol.\u00a01870. Springer, Heidelberg (2000)"},{"key":"37_CR6","unstructured":"Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The constraint logic programming language CHIP. In: FGCS, pp. 693\u2013702 (1988)"},{"issue":"3","key":"37_CR7","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/s10601-008-9063-y","volume":"14","author":"G. Dooms","year":"2009","unstructured":"Dooms, G., Hentenryck, P.V., Michel, L.: Model-driven visualizations of constraint-based local search. Constraints\u00a014(3), 294\u2013324 (2009)","journal-title":"Constraints"},{"key":"37_CR8","volume-title":"SARA","author":"S.L. Epstein","year":"2009","unstructured":"Epstein, S.L., Li, X.: Cluster graphs as abstractions for constraint satisfaction problems. In: Bulitko, V., Beck, J.C. (eds.) SARA. AAAI, Menlo Park (2009)"},{"key":"37_CR9","unstructured":"Hulubei, T.: Refutation Analysis for Constraint Satisfaction Problems. PhD thesis, University College Cork (2007)"},{"key":"37_CR10","unstructured":"Lesaint, D., Mehta, D., O\u2019Sullivan, B., Quesada, L., Wilson, N.: A Soft Global Precedence Constraint. In: IJCAI 2009, Pasadena, CA, USA (2009)"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Lesaint, D., Mehta, D., O\u2019Sullivan, B., Quesada, L., Wilson, N.: Consistency techniques for finding an optimal relaxation of a feature subscription. In: Proceeding of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), pp. 283\u2013290 (2008)","DOI":"10.1109\/ICTAI.2008.61"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/3-540-60299-2_13","volume-title":"Principles and Practice of Constraint Programming - CP \u201995","author":"M. Meier","year":"1995","unstructured":"Meier, M.: Debugging constraint programs. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol.\u00a0976, pp. 204\u2013221. Springer, Heidelberg (1995)"},{"key":"37_CR13","unstructured":"Nieuwenhuis, R.: A cumulative scheduling problem. Personal Communication (2008)"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Schulte, C.: Oz Explorer: A visual constraint programming tool. In: ICLP, Leuven, Belgium, pp. 286\u2013300 (1997)","DOI":"10.7551\/mitpress\/4299.003.0026"},{"key":"37_CR15","unstructured":"Simonis, H.: An ECLiPSe ELearning course (2009), http:\/\/4c.ucc.ie\/~hsimonis\/ELearning\/index.htm"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Simonis, H., Aggoun, A.: Search-tree visualisation. In: Deransart et\u00a0al [5], pp. 191\u2013208.","DOI":"10.1007\/10722311_8"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Simonis, H., Aggoun, A., Beldiceanu, N., Bourreau, E.: Complex constraint abstraction: Global constraint visualisation. In: Deransart et\u00a0al [5], 299\u2013317","DOI":"10.1007\/10722311_13"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15396-9_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T05:22:31Z","timestamp":1711776151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15396-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153952","9783642153969"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15396-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}