{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:40:03Z","timestamp":1752381603452,"version":"3.41.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1021950728713","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T18:56:29Z","timestamp":1048272989000},"page":"79-97","source":"Crossref","is-referenced-by-count":3,"title":["General Properties and Termination Conditions for Soft Constraint Propagation"],"prefix":"10.1007","volume":"8","author":[{"given":"S.","family":"Bistarelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Gennari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"5112283_CR1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"K. Apt","year":"1999","unstructured":"Apt, K. (1999a). The essence ofconstraint propagation. Theoretical Computer Science, 221(1-2): 179\u2013210.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Apt, K. (1999b). The rough guide to constraint propagation (corrected version). In Proc. of the 5th International Conference on Principles and Practice of Constraint Programming (CP'99), pp. 1\u201323.","key":"5112283_CR2","DOI":"10.1007\/978-3-540-48085-3_1"},{"issue":"6","key":"5112283_CR3","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1145\/371880.371884","volume":"22","author":"K. Apt","year":"2000","unstructured":"Apt, K. (2000). The role ofcommutativity in constraint propagation algorithms. ACM TOPLAS, 22(6): 1002\u20131036.","journal-title":"ACM TOPLAS"},{"unstructured":"Bistarelli, S. (2001). Soft constraint solving and programming: A general framework. Ph.D. thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa, Italy.","key":"5112283_CR4"},{"doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Codognet, P., Georget, Y., & Rossi, F. (2000a). Labeling and partial local consistency for soft constraint programming. In Proc. of the 2nd International Workshop on Practical Aspects of Declarative Languages (PADL'00).","key":"5112283_CR5","DOI":"10.1007\/3-540-46584-7_16"},{"doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Codognet, P., & Rossi, F. (2000b). An abstraction framework for soft constraint and its relationship with constraint propagation. In Proc. SARA2000 Symposium on Abstraction, Reformulation and Approximation.","key":"5112283_CR6","DOI":"10.1007\/3-540-44914-0_5"},{"doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Gennari, R., & Rossi, F. (2000c). Constraint propagation for soft constraint satisfaction problems: Generalization and termination conditions. In Proc. Sixth Int. Conf. on Principles and Practice of Constraint Programming (CP2000).","key":"5112283_CR7","DOI":"10.1007\/3-540-45349-0_8"},{"issue":"2","key":"5112283_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/256303.256306","volume":"44","author":"S. Bistarelli","year":"1997","unstructured":"Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring-based constraint solving and optimization. Journal of the ACM, 44(2): 201\u2013236.","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Dubois, D., Fargier, H., & Prade, H. (1993). The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In Proc. IEEE International Conference on Fuzzy Systems, pp. 1131\u20131136.","key":"5112283_CR9","DOI":"10.1109\/FUZZY.1993.327356"},{"doi-asserted-by":"crossref","unstructured":"Fargier, H., & Lang, J. (1993). Uncertainty in constraint satisfaction problems: A probabilistic approach. In Proc. European Conference on Symbolic and Qualitative Approaches to Reasoning and Uncertainty (ECSQARU), pp. 97\u2013104.","key":"5112283_CR10","DOI":"10.1007\/BFb0028188"},{"doi-asserted-by":"crossref","unstructured":"Freuder, E., & Wallace, R. (1992). Partial constraint satisfaction. AI Journal, 58.","key":"5112283_CR11","DOI":"10.1016\/0004-3702(92)90004-H"},{"doi-asserted-by":"crossref","unstructured":"Gennari, R. (2000). Arc consistency algorithms via iterations ofsubsumed functions. In Proc. of the 1st International Conference on Computational Logic (CL'00), pp. 358\u2013372.","key":"5112283_CR12","DOI":"10.1007\/3-540-44957-4_24"},{"doi-asserted-by":"crossref","unstructured":"Marriott, K, & Stuckey, P. (1998). Programming with Constraints. MIT Press.","key":"5112283_CR13","DOI":"10.7551\/mitpress\/5625.001.0001"},{"unstructured":"Schiex, T., Fargier, H., & Verfaille, G. (1995). Valued constraint satisfaction problems: Hard and easy problems. In Proc. IJCAI95. San Francisco, CA, pp. 631\u2013637.","key":"5112283_CR14"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021950728713.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021950728713\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021950728713.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:08:46Z","timestamp":1752379726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021950728713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5112283"],"URL":"https:\/\/doi.org\/10.1023\/a:1021950728713","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}