{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:27Z","timestamp":1750308087582,"version":"3.41.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2005,3]]},"abstract":"<jats:p>\n            Constraint Logic Programming languages on Finite Domains, CLP(\n            <jats:italic>FD<\/jats:italic>\n            ), provide a declarative framework for Artificial Intelligence problems. However, in many real life cases, domains are not known and must be acquired or computed. In systems that interact with the outer world, domain elements synthesize information on the environment, they are not all known at the beginning of the computation, and must be retrieved through an expensive acquisition process.In this article, we extend the CLP(\n            <jats:italic>FD<\/jats:italic>\n            ) language by combining it with a new sort (called Incrementally specified Sets,\n            <jats:italic>I-Set<\/jats:italic>\n            ). In the resulting language, CLP(\n            <jats:italic>FD<\/jats:italic>\n            +\n            <jats:italic>I-Set<\/jats:italic>\n            ), FD variables can be defined on partially or fully unknown domains (\n            <jats:italic>I-Set<\/jats:italic>\n            ). Domains can be linked each other through relations, and constraints can be imposed on them. We describe a propagation algorithm (called\n            <jats:italic>Known Arc Consistency<\/jats:italic>\n            (KAC)) based on known domain elements, and theoretically compare it with arc-consistency.The language can be implemented on top of different CLP systems, thus letting the user exploit different possible semantics for domains (e.g., lists, sets or streams). We state the specifications that the employed system should provide, and we show that two different CLP systems (Conjunto and {\n            <jats:italic>log<\/jats:italic>\n            }) can be effectively used.We provide motivating examples and describe promising applications.\n          <\/jats:p>","DOI":"10.1145\/1057387.1057389","type":"journal-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:30:55Z","timestamp":1123057855000},"page":"236-263","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Dealing with incomplete knowledge on CLP(\n            <i>FD<\/i>\n            ) variable domains"],"prefix":"10.1145","volume":"27","author":[{"given":"Marco","family":"Gavanelli","sequence":"first","affiliation":[{"name":"University of Ferrara, Ferrara, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evelina","family":"Lamma","sequence":"additional","affiliation":[{"name":"University of Ferrara, Ferrara, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Mello","sequence":"additional","affiliation":[{"name":"University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michela","family":"Milano","sequence":"additional","affiliation":[{"name":"University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,3]]},"reference":[{"volume-title":"Release 5.2. IC-Parc","author":"Aggoun A.","key":"e_1_2_1_1_1","unstructured":"Aggoun , A. , Chan , D. , Dufresne , P. , Falvey , E. , Grant , H. , Harvey , W. , Herold , A. , Macartney , G. , Meier , M. , Miller , D. , Mudambi , S. , Novello , S. , Perez , B. , van Rossum , E. , Schimpf , J. , Shen , K. , Tsahageas , P. A. , and de Villeneuve , D. H. 2001. ECLiPSe User Manual , Release 5.2. IC-Parc , Imperial College , London, UK .]] Aggoun, A., Chan, D., Dufresne, P., Falvey, E., Grant, H., Harvey, W., Herold, A., Macartney, G., Meier, M., Miller, D., Mudambi, S., Novello, S., Perez, B., van Rossum, E., Schimpf, J., Shen, K., Tsahageas, P. A., and de Villeneuve, D. H. 2001. ECLiPSe User Manual, Release 5.2. IC-Parc, Imperial College, London, UK.]]"},{"key":"e_1_2_1_2_1","unstructured":"Alberti M. Gavanelli M. Lamma E. Mello P. and Milano M. 2005. A CHR-based implementation of known arc-consistency. Theory Prac. Logic Prog. To appear.]] 10.1017\/S147106840500236X   Alberti M. Gavanelli M. Lamma E. Mello P. and Milano M. 2005. A CHR-based implementation of known arc-consistency. Theory Prac. Logic Prog. To appear.]] 10.1017\/S147106840500236X"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00147-3"},{"key":"e_1_2_1_4_1","volume-title":"Computational Logics: Theory and Applications","author":"Baader F.","year":"2001","unstructured":"Baader , F. and Schulz , K . 2001 . Combining constraint solving. In Constraints in Computational Logics: Theory and Applications , H. Comon, C. March\u00e9, and R. Treinen, Eds. Lecture Notes in Computer Science, vol. 2002 . Springer-Verlag , Berlin, Germany, 104--158.]] Baader, F. and Schulz, K. 2001. Combining constraint solving. In Constraints in Computational Logics: Theory and Applications, H. Comon, C. March\u00e9, and R. Treinen, Eds. Lecture Notes in Computer Science, vol. 2002. Springer-Verlag, Berlin, Germany, 104--158.]]"},{"key":"e_1_2_1_5_1","volume-title":"5th European Conference on Planning, ECP'99","volume":"1809","author":"Barruffi R.","unstructured":"Barruffi , R. , Lamma , E. , Mello , P. , and Milano , M . 1999. Least commitment on variable binding in presence of incomplete knowledge. In Recent Advances in AI Planning , 5th European Conference on Planning, ECP'99 ( Durham, UK). S. Biundo and M. Fox, Eds. Lecture Notes in Computer Science , vol. 1809 . Springer-Verlag, New York, pp. 159--171.]] Barruffi, R., Lamma, E., Mello, P., and Milano, M. 1999. Least commitment on variable binding in presence of incomplete knowledge. In Recent Advances in AI Planning, 5th European Conference on Planning, ECP'99 (Durham, UK). S. Biundo and M. Fox, Eds. Lecture Notes in Computer Science, vol. 1809. Springer-Verlag, New York, pp. 159--171.]]"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90041-8"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00105-2"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0743-1066(95)00121-2","article-title":"Compiling constraints in clp(FD)","volume":"27","author":"Codognet P.","year":"1996","unstructured":"Codognet , P. and Diaz , D. 1996 . Compiling constraints in clp(FD) . J. Logic Prog. 27 , 3 (June), 185--226.]] Codognet, P. and Diaz, D. 1996. Compiling constraints in clp(FD). J. Logic Prog. 27, 3 (June), 185--226.]]","journal-title":"J. Logic Prog."},{"key":"e_1_2_1_9_1","unstructured":"Cohen J. Koiran P. and Perrin C. 1993. Meta-level interpretation of CLP(lists). In Constraint Logic Programming---Selected Research (Marseilles France). F. Benhamou and A. Colmerauer Eds. MIT Press Cambridge Mass. 457--481.]]   Cohen J. Koiran P. and Perrin C. 1993. Meta-level interpretation of CLP(lists). In Constraint Logic Programming---Selected Research (Marseilles France). F. Benhamou and A. Colmerauer Eds. MIT Press Cambridge Mass. 457--481.]]"},{"volume-title":"Proceedings of the 16th International Joint Conference on Artificial Intelligence","author":"Cucchiara R.","key":"e_1_2_1_10_1","unstructured":"Cucchiara , R. , Gavanelli , M. , Lamma , E. , Mello , P. , Milano , M. , and Piccardi , M . 1999a. Constraint propagation and value acquisition: why we should do it interactively . In Proceedings of the 16th International Joint Conference on Artificial Intelligence ( Stockholm, Sweden). T. Dean, Ed. Morgan-Kaufmann, San Francisco, Calif., 468--477.]] Cucchiara, R., Gavanelli, M., Lamma, E., Mello, P., Milano, M., and Piccardi, M. 1999a. Constraint propagation and value acquisition: why we should do it interactively. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (Stockholm, Sweden). T. Dean, Ed. Morgan-Kaufmann, San Francisco, Calif., 468--477.]]"},{"volume-title":"Proceedings of the 1st International Conference on the Practical Application of Constraint Technologies and Logic Programming. Practical Application Company","author":"Cucchiara R.","key":"e_1_2_1_11_1","unstructured":"Cucchiara , R. , Gavanelli , M. , Lamma , E. , Mello , P. , Milano , M. , and Piccardi , M . 1999b. Extending CLP(FD) with interactive data acquisition for 3D visual object recognition . In Proceedings of the 1st International Conference on the Practical Application of Constraint Technologies and Logic Programming. Practical Application Company , London, U.K., 137--155.]] Cucchiara, R., Gavanelli, M., Lamma, E., Mello, P., Milano, M., and Piccardi, M. 1999b. Extending CLP(FD) with interactive data acquisition for 3D visual object recognition. In Proceedings of the 1st International Conference on the Practical Application of Constraint Technologies and Logic Programming. Practical Application Company, London, U.K., 137--155.]]"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037573"},{"volume-title":"Proceedings of the 7th National Conference on Artificial Intelligence (St. Paul, Minn.), T. M. Smith and Reid G. Mitchell, Eds., Morgan-Kaufmann","author":"Dechter R.","key":"e_1_2_1_13_1","unstructured":"Dechter , R. and Dechter , A . 1988. Belief maintenance in dynamic constraint networks . In Proceedings of the 7th National Conference on Artificial Intelligence (St. Paul, Minn.), T. M. Smith and Reid G. Mitchell, Eds., Morgan-Kaufmann , San Francisco, Calif., 37--42.]] Dechter, R. and Dechter, A. 1988. Belief maintenance in dynamic constraint networks. In Proceedings of the 7th National Conference on Artificial Intelligence (St. Paul, Minn.), T. M. Smith and Reid G. Mitchell, Eds., Morgan-Kaufmann, San Francisco, Calif., 37--42.]]"},{"volume-title":"Proceedings of the 6th International Conference on Tools with Artificial Intelligence (ICTAI '94)","author":"Dent M.","key":"e_1_2_1_14_1","unstructured":"Dent , M. and Mercer , R . 1994. Minimal forward checking . In Proceedings of the 6th International Conference on Tools with Artificial Intelligence (ICTAI '94) (New Orleans, La). IEEE Computer Society Press, Los Alamitos, Calif., 432--438.]] Dent, M. and Mercer, R. 1994. Minimal forward checking. In Proceedings of the 6th International Conference on Tools with Artificial Intelligence (ICTAI '94) (New Orleans, La). IEEE Computer Society Press, Los Alamitos, Calif., 432--438.]]"},{"volume-title":"Proceedings of the International Conference on 5th Generation Computer System, I. for New Generation Computer Technology (ICOT), Ed. OHMSHA Ltd. Tokyo and Springer-Verlag","author":"Dincbas M.","key":"e_1_2_1_15_1","unstructured":"Dincbas , M. , Hentenryck , P. V. , Simonis , H. , Aggoun , A. , Graf , T. , and Berthier , F . 1988. The constraint logic programming language CHIP . In Proceedings of the International Conference on 5th Generation Computer System, I. for New Generation Computer Technology (ICOT), Ed. OHMSHA Ltd. Tokyo and Springer-Verlag , Tokyo, Japan, 693--702.]] Dincbas, M., Hentenryck, P. V., Simonis, H., Aggoun, A., Graf, T., and Berthier, F. 1988. The constraint logic programming language CHIP. In Proceedings of the International Conference on 5th Generation Computer System, I. for New Generation Computer Technology (ICOT), Ed. OHMSHA Ltd. Tokyo and Springer-Verlag, Tokyo, Japan, 693--702.]]"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(95)00147-6","article-title":"&lcub;log&rcub;: A language for programming in logic with finite sets","volume":"28","author":"Dovier A.","year":"1996","unstructured":"Dovier , A. , Omodeo , E. , Pontelli , E. , and Rossi , G. 1996 . &lcub;log&rcub;: A language for programming in logic with finite sets . J. Logic Prog. 28 , 1 (July), 1--44.]] Dovier, A., Omodeo, E., Pontelli, E., and Rossi, G. 1996. &lcub;log&rcub;: A language for programming in logic with finite sets. J. Logic Prog. 28, 1 (July), 1--44.]]","journal-title":"J. Logic Prog."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/365151.365169"},{"volume-title":"Proceedings of the 1993 International Symposium on Logic Programming","author":"Dovier A.","key":"e_1_2_1_18_1","unstructured":"Dovier , A. and Rossi , G . 1993. Embedding extensional finite sets in CLP . In Proceedings of the 1993 International Symposium on Logic Programming ( Vancouver, B.C., Canada), D. Miller, Ed. MIT Press, Cambridge, Mass., 540--556.]] Dovier, A. and Rossi, G. 1993. Embedding extensional finite sets in CLP. In Proceedings of the 1993 International Symposium on Logic Programming (Vancouver, B.C., Canada), D. Miller, Ed. MIT Press, Cambridge, Mass., 540--556.]]"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Freuder E. 1996. In pursuit of the holy grail. ACM Comput. Surv. 28 4es (Dec.) 63.]] 10.1145\/242224.242304   Freuder E. 1996. In pursuit of the holy grail. ACM Comput. Surv. 28 4es (Dec.) 63.]] 10.1145\/242224.242304","DOI":"10.1145\/242224.242304"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322292"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00137870","article-title":"Propagation to reason about sets: Definition and implementation of a practical language","volume":"1","author":"Gervet C.","year":"1997","unstructured":"Gervet , C. 1997 . Propagation to reason about sets: Definition and implementation of a practical language . Constraints 1 , 3, 191 -- 244 .]] Gervet, C. 1997. Propagation to reason about sets: Definition and implementation of a practical language. Constraints 1, 3, 191--244.]]","journal-title":"Constraints"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90020-X"},{"volume-title":"Proceedings of the Conference on Principle of Programming Languages","author":"Jaffar J.","key":"e_1_2_1_23_1","unstructured":"Jaffar , J. and Lassez , J . 1987. Constraint logic programming . In Proceedings of the Conference on Principle of Programming Languages ( Munich, Germany).]] 10.1145\/41625.41635 Jaffar, J. and Lassez, J. 1987. Constraint logic programming. In Proceedings of the Conference on Principle of Programming Languages (Munich, Germany).]] 10.1145\/41625.41635"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Jaffar J. and Maher M. 1994. Constraint logic programming: A survey. J. Logic Prog. 19--20 503--582.]]  Jaffar J. and Maher M. 1994. Constraint logic programming: A survey. J. Logic Prog. 19--20 503--582.]]","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"e_1_2_1_25_1","first-page":"1","article-title":"The semantics of constraint logic programs","volume":"37","author":"Jaffar J.","year":"1998","unstructured":"Jaffar , J. , Maher , M. , Marriott , K. , and Stuckey , P. 1998 . The semantics of constraint logic programs . J. Logic Prog. 37 , 1 -- 3 (Oct.), 1--46.]] Jaffar, J., Maher, M., Marriott, K., and Stuckey, P. 1998. The semantics of constraint logic programs. J. Logic Prog. 37, 1--3 (Oct.), 1--46.]]","journal-title":"J. Logic Prog."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 10th International World Wide Web Conference, WWW 10","author":"Knoblock C.","year":"1920","unstructured":"Knoblock , C. , Minton , S. , Ambite , J. , Muslea , M. , Oh , J. , and Frank , M . 2001. Mixed-initiative, multi-source information assistants . In Proceedings of the 10th International World Wide Web Conference, WWW 10 ( Hong Kong, China). ACM, New York, 697--707.]] 10.1145\/37 1920 .372185 Knoblock, C., Minton, S., Ambite, J., Muslea, M., Oh, J., and Frank, M. 2001. Mixed-initiative, multi-source information assistants. In Proceedings of the 10th International World Wide Web Conference, WWW 10 (Hong Kong, China). ACM, New York, 697--707.]] 10.1145\/371920.372185"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 3rd International Symposium on Programming Language Implementation and Logic Programming (PLILP91)","volume":"528","author":"Legeard B.","unstructured":"Legeard , B. and Legros , E . 1991. Short overview of the CLPS system . In Proceedings of the 3rd International Symposium on Programming Language Implementation and Logic Programming (PLILP91) (Passau, Germany), J. Maluszy\u0144ski and M. Wirsing, Eds. Lecture Notes in Computer Science , vol. 528 . Springer-Verlag, New York, 431--433.]] Legeard, B. and Legros, E. 1991. Short overview of the CLPS system. In Proceedings of the 3rd International Symposium on Programming Language Implementation and Logic Programming (PLILP91) (Passau, Germany), J. Maluszy\u0144ski and M. Wirsing, Eds. Lecture Notes in Computer Science, vol. 528. Springer-Verlag, New York, 431--433.]]"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth A.","year":"1977","unstructured":"Mackworth , A. 1977 . Consistency in networks of relations . Artif. Intel. 8 , 1 (Feb.), 99--118.]] Mackworth, A. 1977. Consistency in networks of relations. Artif. Intel. 8, 1 (Feb.), 99--118.]]","journal-title":"Artif. Intel."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0890060498124101"},{"volume-title":"Proceedings of the 8th National Conference on Artificial Intelligence. AAAI Press\/The MIT Press","author":"Mittal S.","key":"e_1_2_1_30_1","unstructured":"Mittal , S. and Falkenhainer , B . 1990. Dynamic constraint satisfaction problems . In Proceedings of the 8th National Conference on Artificial Intelligence. AAAI Press\/The MIT Press , Boston, Mass., 25--32.]] Mittal, S. and Falkenhainer, B. 1990. Dynamic constraint satisfaction problems. In Proceedings of the 8th National Conference on Artificial Intelligence. AAAI Press\/The MIT Press, Boston, Mass., 25--32.]]"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90083-4"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: Fundamental properties and applications to picture processing","volume":"7","author":"Montanari U.","year":"1974","unstructured":"Montanari , U. 1974 . Networks of constraints: Fundamental properties and applications to picture processing . Inf. Sci. 7 , 2 (Apr.), 95--132.]] Montanari, U. 1974. Networks of constraints: Fundamental properties and applications to picture processing. Inf. Sci. 7, 2 (Apr.), 95--132.]]","journal-title":"Inf. Sci."},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference (AAAI 96)","volume":"1","author":"Schiex T.","unstructured":"Schiex , T. , R\u00e9gin , J. , Gaspin , C. , and Verfaillie , G . 1996. Lazy arc consistency . In Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference (AAAI 96) (Menlo Park, N.J.). Vol. 1 . AAAI Press\/The MIT Press, Cambridge, Mass., 216--221.]] Schiex, T., R\u00e9gin, J., Gaspin, C., and Verfaillie, G. 1996. Lazy arc consistency. In Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference (AAAI 96) (Menlo Park, N.J.). Vol. 1. AAAI Press\/The MIT Press, Cambridge, Mass., 216--221.]]"},{"volume-title":"Proceedings of the 5th International Conference on Tools with Artificial Intelligence. IEEE Computer Society Press, Los Alamitos, Calif., 48--55","author":"Schiex T.","key":"e_1_2_1_34_1","unstructured":"Schiex , T. and Verfaillie , G . 1993. Nogood recording for static and dynamic constraint satisfaction problems . In Proceedings of the 5th International Conference on Tools with Artificial Intelligence. IEEE Computer Society Press, Los Alamitos, Calif., 48--55 .]] Schiex, T. and Verfaillie, G. 1993. Nogood recording for static and dynamic constraint satisfaction problems. In Proceedings of the 5th International Conference on Tools with Artificial Intelligence. IEEE Computer Society Press, Los Alamitos, Calif., 48--55.]]"},{"volume-title":"A query-the-user facility for logic programming","author":"Sergot M. J.","key":"e_1_2_1_35_1","unstructured":"Sergot , M. J. 1983. A query-the-user facility for logic programming . In Integrated Interactive Computing Systems, P. Degano and E. Sandewall, Eds. North-Holland, Amsterdam , The Netherlands , 27--41.]] Sergot, M. J. 1983. A query-the-user facility for logic programming. In Integrated Interactive Computing Systems, P. Degano and E. Sandewall, Eds. North-Holland, Amsterdam, The Netherlands, 27--41.]]"},{"volume-title":"1987. Concurrent Prolog -","author":"Shapiro E.","key":"e_1_2_1_36_1","unstructured":"Shapiro , E. , Ed. 1987. Concurrent Prolog - Vol. I . MIT Press , Cambridge, Mass .]] Shapiro, E., Ed. 1987. Concurrent Prolog - Vol. I. MIT Press, Cambridge, Mass.]]"},{"volume-title":"The Psychology of Computer Vision","author":"Waltz D.","key":"e_1_2_1_37_1","unstructured":"Waltz , D. 1975. Generating Semantic Descriptions from Drawings of Scenes with Shadows . In The Psychology of Computer Vision , P. Winston, Ed. McGraw-Hill, New York , Chap . 3.]] Waltz, D. 1975. Generating Semantic Descriptions from Drawings of Scenes with Shadows. In The Psychology of Computer Vision, P. Winston, Ed. McGraw-Hill, New York, Chap. 3.]]"},{"volume-title":"Proceedings of the 11th International Joint Conference on Artificial Intelligence (Detroit, Mich.), N. S. Sridharan, Ed. Morgan-Kaufmann","author":"Zweben M.","key":"e_1_2_1_38_1","unstructured":"Zweben , M. and Eskey , M . 1989. Constraint satisfaction with delayed evaluation . In Proceedings of the 11th International Joint Conference on Artificial Intelligence (Detroit, Mich.), N. S. Sridharan, Ed. Morgan-Kaufmann , San Francisco, Calif., 875--880.]] Zweben, M. and Eskey, M. 1989. Constraint satisfaction with delayed evaluation. In Proceedings of the 11th International Joint Conference on Artificial Intelligence (Detroit, Mich.), N. S. Sridharan, Ed. Morgan-Kaufmann, San Francisco, Calif., 875--880.]]"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1057387.1057389","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1057387.1057389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:51Z","timestamp":1750262871000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1057387.1057389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["10.1145\/1057387.1057389"],"URL":"https:\/\/doi.org\/10.1145\/1057387.1057389","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"type":"print","value":"0164-0925"},{"type":"electronic","value":"1558-4593"}],"subject":[],"published":{"date-parts":[[2005,3]]},"assertion":[{"value":"2005-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}