{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:16Z","timestamp":1725486256285},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433811"},{"type":"electronic","value":"9783540459880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45988-x_14","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:19:02Z","timestamp":1181182742000},"page":"177-192","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Constraints for Domain Managing in CLP(FD)"],"prefix":"10.1007","author":[{"given":"Marco","family":"Gavanelli","sequence":"first","affiliation":[]},{"given":"Evelina","family":"Lamma","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Mello","sequence":"additional","affiliation":[]},{"given":"Michela","family":"Milano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"14_CR1","volume-title":"Structure and Interpretation of Computer Programs","author":"H. Abelson","year":"1985","unstructured":"H. Abelson, G.J. Sussman, and J. Sussman. Structure and Interpretation of Computer Programs. MIT Press, USA, 6 edition, 1985.","edition":"6 edition"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"R. Barruffi, E. Lamma, P. Mello, and M. Milano. Least commitment on variable binding in presence of incomplete knowledge. In Proceedings of the European Conference on Planning (ECP99), 1999.","DOI":"10.1007\/10720246_13"},{"key":"14_CR3","unstructured":"M. Carlsson, J. Wid\u00e9n, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, and T. Sj\u00f6land. SICStus Prolog user\u2019s manual. Technical Report T91:15, Swedish Institute of Computer Science, June 1995."},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0743-1066(95)00121-2","volume":"27","author":"P. Codognet","year":"1996","unstructured":"P. Codognet and D. Diaz. Compiling constraints in clp(FD). Journal of Logic Programming, 27(3):185\u2013226, June 1996.","journal-title":"Journal of Logic Programming"},{"key":"14_CR5","unstructured":"J. Cohen, P. Koiran, and C. Perrin. Meta-level interpretation of CLP(lists). In F. Benhamou and A. Colmerauer, eds., Constraint Logic Programming-Selected Research, pages 457\u2013481, 1993."},{"key":"14_CR6","unstructured":"R. Cucchiara, M. Gavanelli, E. Lamma, P. Mello, M. Milano, and M. Piccardi. Constraint propagation and value acquisition: why we should do it interactively. In T. Dean, ed., Sixteenth International Joint Conference on Artificial Intelligence, pages 468\u2013477, Stockholm, Sweden, July 31\u2013August 6 1999. Morgan Kaufmann."},{"key":"14_CR7","unstructured":"R. Cucchiara, M. Gavanelli, E. Lamma, P. Mello, M. Milano, and M. Piccardi. Extending CLP(FD) with interactive data acquisition for 3D visual object recognition. In Proceedings PACLP\u201999, pages 137\u2013155, 1999."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"M.J. Dent and R.E. Mercer. Minimal forward checking. In Proceedings of the Sixth International Conference on Tools with Artificial Intelligence, pages 432\u2013438, 1994.","DOI":"10.1109\/TAI.1994.346460"},{"issue":"5","key":"14_CR9","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1145\/365151.365169","volume":"22","author":"A. Dovier","year":"2000","unstructured":"A. Dovier, C. Piazza, E. Pontelli, and G. Rossi. Sets and constraint logic programming. ACM TOPLAS, 22(5):861\u2013931, 2000.","journal-title":"ACM TOPLAS"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"A. Dovier, A. Policriti, and G. Rossi. Integrating lists, multisets, and sets in a logic programming framework. In F. Baader and K. U. Schulz, eds., Frontiers of Combining Systems: 1st International Workshop, pages 303\u2013320, Munich, Germany, March 1996. Kluwer Academic Publishers.","DOI":"10.1007\/978-94-009-0349-4_16"},{"key":"14_CR11","unstructured":"M. Gavanelli, E. Lamma, P. Mello, and M. Milano. Channelling information through FD domains. Technical report, LIA, DEIS, University of Bologna, 2001."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00137870","volume":"1","author":"C. Gervet","year":"1997","unstructured":"C. Gervet. Propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1:191\u2013244, 1997.","journal-title":"Constraints"},{"issue":"1\u20133","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J. Jaffar","year":"1998","unstructured":"J. Jaffar, M.J. Maher, K. Marriott, and P. Stuckey. The semantics of constraint logic programs. Journal of Logic Programming, 37(1\u20133):1\u201346, 1998.","journal-title":"Journal of Logic Programming"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"C.A. Knoblock, S. Minton, J.L. Ambite, M. Muslea, J. Oh, and M. Frank. Mixedinitiative, multi-source information assistants. In Tenth International World Wide Web Conference, pages 697\u2013707, Hong Kong, China, May 1\u20135 2001. ACM.","DOI":"10.1145\/371920.372185"},{"key":"14_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/3-540-54444-5_123","volume-title":"Short overview of the CLPS system","author":"B. Legard","year":"1991","unstructured":"B. Legard and E. Legros. Short overview of the CLPS system. In 3rd Int. Symposium on Programming Language Implementation and Logic Programming, PLILP91, LNCS, pages 431\u2013433, Passau, Germany, August 1991. Springer-Verlag."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99\u2013118, 1977.","journal-title":"Artificial Intelligence"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1017\/S0890060498124101","volume":"12","author":"D. Mailharro","year":"1998","unstructured":"D. Mailharro. A classification and constraint-based framework for configuration. Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 12:383\u2013397, 1998.","journal-title":"Artificial Intelligence for Engineering Design, Analysis and Manufacturing"},{"key":"14_CR18","unstructured":"T. Schiex, J.C. R\u00e9gin, C. Gaspin, and G. Verfaillie. Lazy arc consistency. In Proc. of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, pages 216\u2013221, Menlo Park, August 4\u20138 1996. AAAI Press \/ MIT Press."},{"key":"14_CR19","unstructured":"M. Sergot. A query-the-user facility for logic programming. In P. Degano and E. Sandewall, eds., Integrated Interactive Computing Systems, pages 27\u201341. North-Holland, 1983."},{"key":"14_CR20","unstructured":"M. Zweben and M. Eskey. Constraint satisfaction with delayed evaluation. In IJCAI 89, pages 875\u2013880, Detroit, August 20\u201325 1989."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45988-X_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:43:51Z","timestamp":1556480631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45988-X_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433811","9783540459880"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45988-x_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}