{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:05:34Z","timestamp":1794337534960,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540309116","type":"print"},{"value":"9783540324256","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601548_6","type":"book-chapter","created":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T00:39:45Z","timestamp":1134175185000},"page":"55-69","source":"Crossref","is-referenced-by-count":2,"title":["Explaining Constraint Programming"],"prefix":"10.1007","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"The ECLiPSe Constraint Logic Programming System, http:\/\/www-icparc.doc.ic.ac.uk\/eclipse\/"},{"key":"6_CR2","unstructured":"ELAN, Version 3.3, http:\/\/www.iist.unu.edu\/~alumni\/software\/other\/inria\/elan\/elan-presentation.html"},{"key":"6_CR3","unstructured":"SICStus Prolog, http:\/\/www.sics.se\/isl\/sicstuswww\/site\/index.html"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/976706.976707","volume":"5","author":"S. Abdennadher","year":"2004","unstructured":"Abdennadher, S., Rigotti, C.: Automatic generation of rule-based constraint solvers over finite domains. ACM Transactions on Computational Logic\u00a05(2), 177\u2013205 (2004)","journal-title":"ACM Transactions on Computational Logic"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Abdennadher, S., Rigotti, C.: Automatic generation of CHR constraint solvers. Theory and Practice of Logic Programming (2005) (to appear)","DOI":"10.1017\/S1471068405002371"},{"issue":"3","key":"6_CR6","first-page":"263","volume":"33","author":"K.R. Apt","year":"1998","unstructured":"Apt, K.R.: A proof theoretic view of constraint programming. Fundamenta Informaticae\u00a033(3), 263\u2013293 (1998), Available via, http:\/\/arXiv.org\/archive\/cs\/","journal-title":"Fundamenta Informaticae"},{"issue":"1-2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"K.R. Apt","year":"1999","unstructured":"Apt, K.R.: The essence of constraint propagation. Theoretical Computer Science\u00a0221(1-2), 179\u2013210 (1999), Available via, http:\/\/arXiv.org\/archive\/cs\/","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1145\/371880.371884","volume":"22","author":"K.R. Apt","year":"2000","unstructured":"Apt, K.R.: The role of commutativity in constraint propagation algorithms. ACM Transactions on Programming Languages and Systems\u00a022(6), 1002\u20131036 (2000) Available via, http:\/\/arXiv.org\/archive\/cs\/","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-44654-0_5","volume-title":"New Trends in Constraints","author":"K.R. Apt","year":"2000","unstructured":"Apt, K.R.: Some remarks on Boolean constraint propagation. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol.\u00a01865, pp. 91\u2013107. Springer, Heidelberg (2000)"},{"key":"6_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K.R. Apt","year":"2003","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1017\/S1471068401000072","volume":"1","author":"K.R. Apt","year":"2001","unstructured":"Apt, K.R., Monfroy, E.: Constraint programming viewed as rule-based programming. Theory and Practice of Logic Programming\u00a01(6), 713\u2013750 (2001), Available via, http:\/\/arXiv.org\/archive\/cs\/","journal-title":"Theory and Practice of Logic Programming"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-61735-3_4","volume-title":"Algebraic and Logic Programming","author":"F. Benhamou","year":"1996","unstructured":"Benhamou, F.: Heterogeneous constraint solving. In: Hanus, M., Rodr\u00edguez-Artalejo, M. (eds.) ALP 1996. LNCS, vol.\u00a01139, pp. 62\u201376. Springer, Heidelberg (1996)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-45349-0_8","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"S. Bistarelli","year":"2000","unstructured":"Bistarelli, S., Gennari, R., Rossi, F.: Constraint propagation for soft constraint satisfaction problems: Generalization and termination conditions. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 83\u201397. Springer, Heidelberg (2000)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Brand, S., Apt, K.R.: Schedulers and redundancy for a class of constraint propagation rules. Theory and Practice of Logic Programming (2005) (to appear)","DOI":"10.1017\/S1471068405002401"},{"issue":"3","key":"6_CR15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.3233\/FI-1998-34303","volume":"33","author":"C. Castro","year":"1998","unstructured":"Castro, C.: Building constraint satisfaction problem solvers using rewrite rules and strategies. Fundamenta Informaticae\u00a033(3), 263\u2013293 (1998)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR16","unstructured":"Colmerauer, A.: Opening the PROLOG-III universe. BYTE Magazine\u00a012(9) (August 1987)"},{"issue":"1-3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0743-1066(98)10008-0","volume":"37","author":"F. Fages","year":"1998","unstructured":"Fages, F., Fowler, J., Sola, T.: Experiments in reactive constraint logic programming. Journal of Logic Programming\u00a037(1-3), 185\u2013212 (1998)","journal-title":"Journal of Logic Programming"},{"issue":"1-3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and practice of Constraint Handling Rules. Journal of Logic Programming\u00a037(1-3), 95\u2013138 (October 1998); Special Issue on Constraint Logic Programming, Stuckey P. J., Marriot, K.: (eds.)","journal-title":"Journal of Logic Programming"},{"key":"6_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-44957-4_24","volume-title":"Computational Logic - CL 2000","author":"R. Gennari","year":"2000","unstructured":"Gennari, R.: Arc consistency via subsumed functions. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 358\u2013372. Springer, Heidelberg (2000)"},{"key":"6_CR20","unstructured":"ILOG. Ilog white papers (2003), Available via, http:\/\/www.ilog.com\/products\/optimization\/papers.cfm"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/41625.41635","volume-title":"POPL 1987: Proceedings 14th ACM Symposium on Principles of Programming Languages","author":"J. Jaffar","year":"1987","unstructured":"Jaffar, J., Lassez, J.-L.: Constraint logic programming. In: POPL 1987: Proceedings 14th ACM Symposium on Principles of Programming Languages, pp. 111\u2013119. ACM, New York (1987)"},{"issue":"3","key":"6_CR22","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/FI-1998-34302","volume":"34","author":"C. Kirchner","year":"1998","unstructured":"Kirchner, C., Ringeissen, C.: Rule-based constraint programming. Fundamenta Informaticae\u00a034(3), 225\u2013262 (1998)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR23","unstructured":"Koalog (2005), http:\/\/www.koalog.com"},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. Mackworth","year":"1977","unstructured":"Mackworth, A.: Consistency in networks of relations. Artificial Intelligence\u00a08(1), 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"6_CR25","unstructured":"Mohr, R., Masini, G.: Good old discrete relaxation. In: Kodratoff, Y. (ed.) Proceedings of the 8th European Conference on Artificial Intelligence (ECAI), pp. 651\u2013656. Pitman Publishers (1988)"},{"key":"6_CR26","series-title":"Scientific Computing Track","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/298151.298170","volume-title":"Proceedings of the 14th ACM Symposium on Applied Computing, ACM SAC 1999","author":"E. Monfroy","year":"1999","unstructured":"Monfroy, E., R\u00e9ty, J.-H.: Chaotic iteration for distributed constraint propagation. In: Carroll, J., Haddad, H., Oppenheim, D., Bryant, B., Lamont, G. (eds.) Proceedings of the 14th ACM Symposium on Applied Computing, ACM SAC 1999, San Antonio, Texas, USA, March 1999. Scientific Computing Track, pp. 19\u201324. ACM Press, New York (1999)"},{"key":"6_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-44654-0_8","volume-title":"New Trends in Constraints","author":"C. Ringeissen","year":"2000","unstructured":"Ringeissen, C., Monfroy, E.: Generating propagation rules for finite domains: a mixed approach. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol.\u00a01865, pp. 150\u2013172. Springer, Heidelberg (2000)"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/3-540-61732-9_65","volume-title":"Artificial Intelligence and Symbolic Mathematical Computation","author":"V. Telerman","year":"1996","unstructured":"Telerman, V., Ushakov, D.: Data types in subdefinite models. In: Pfalzgraf, J., Calmet, J., Campbell, J. (eds.) AISMC 1996. LNCS, vol.\u00a01138, pp. 305\u2013319. Springer, Heidelberg (1996)"},{"issue":"1-3","key":"6_CR29","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","volume":"37","author":"P. Hentenryck Van","year":"1998","unstructured":"Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(fd). Journal of Logic Programming\u00a037(1-3), 139\u2013164 (1998); Special Issue on Constraint Logic Programming (P. J. Stuckey and K. Marriot, Eds.)","journal-title":"Journal of Logic Programming"},{"key":"6_CR30","first-page":"19","volume-title":"The Psychology of Computer Vision","author":"D.L. Waltz","year":"1975","unstructured":"Waltz, D.L.: Generating semantic descriptions from drawings of scenes with shadows. In: Winston, P.H. (ed.) The Psychology of Computer Vision, pp. 19\u201391. McGraw Hill, New York (1975)"}],"container-title":["Lecture Notes in Computer Science","Processes, Terms and Cycles: Steps on the Road to Infinity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601548_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:26:06Z","timestamp":1586597166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601548_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309116","9783540324256"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11601548_6","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11601548","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}