{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:03:41Z","timestamp":1725483821771},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_36","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:59:47Z","timestamp":1179208787000},"page":"541-556","source":"Crossref","is-referenced-by-count":9,"title":["Indexical-Based Solver Learning"],"prefix":"10.1007","author":[{"given":"Thi Bich Hanh","family":"Dao","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Lallouet","sequence":"additional","affiliation":[]},{"given":"Andrei","family":"Legtchenko","sequence":"additional","affiliation":[]},{"given":"Lionel","family":"Martin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"36_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-45349-0_4","volume-title":"Constraint Programming","author":"S. Abdennadher","year":"2000","unstructured":"S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for finite domains. In Rina Dechter, editor, Constraint Programming, volume 1894 of LNCS, pages 18\u201334, Singapore, 2000. Springer."},{"key":"36_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-45578-7_3","volume-title":"Constraint Programming","author":"S. Abdennadher","year":"2001","unstructured":"S. Abdennadher and C. Rigotti. Towards inductive constraint solving. In Toby Walsh, editor, Constraint Programming, volume 2239 of LNCS, pages 31\u201345. Springer, Nov 26\u2013Dec 1 2001."},{"issue":"1-2","key":"36_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"K. R. Apt","year":"1999","unstructured":"K. R. Apt. The essence of constraint propagation. Theoretical Computer Science, 221(1-2):179\u2013210, 1999.","journal-title":"Theoretical Computer Science"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"K. R. Apt and E. Monfroy. Automatic generation of constraint propagation algorithms for small finite domains. In Constraint Programming CP\u201999, 1999.","DOI":"10.1007\/978-3-540-48085-3_5"},{"issue":"6","key":"36_CR5","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1017\/S1471068401000072","volume":"1","author":"K. R. Apt","year":"2001","unstructured":"K. R. Apt and E. Monfroy. Constraint programming viewed as rule-based programming. Theory and Practice of Logic Programming, 1(6):713\u2013750, 2001.","journal-title":"Theory and Practice of Logic Programming"},{"key":"36_CR6","volume-title":"Research Report RR-LIFO-2002-07, LIFO","author":"M. Berg\u00e8re","year":"2002","unstructured":"Michel Berg\u00e8re, Thi Bich Hanh Dao, AbdelAli Ed-Dbali, G\u00e9rard Ferrand, Arnaud Lallouet, Andrei Legtchenko, Lionel Martin, and Christel Vrain. Learning interval bounds of indexical-based solvers. Research Report RR-LIFO-2002-07, LIFO, Universit\u00e9 d\u2019Orl\u00e9ans, BP 6759, F-45067 Orl\u00e9ans Cedex 2, 2002."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Stephano Bistarelli, Ugo Montanari, and Francesca Rossi. Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2):201\u2013236, March 1997.","DOI":"10.1145\/256303.256306"},{"key":"36_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"M. Carlsson","year":"1997","unstructured":"Mats Carlsson, Greger Ottosson, and Bj\u00f6r Carlson. An open-ended finite domain constraint solver. In Hugh Glaser, Pieter H. Hartel, and Herbert Kuchen, editors, Programming Languages: Implementations, Logics, and Programs, volume 1292 of LNCS, pages 191\u2013206, Southampton, UK, September 3-5 1997. Springer."},{"key":"36_CR9","unstructured":"Philippe Codognet and Daniel Diaz. A minimal extension of the wam for clp(fd). In David Scott Warren, editor, International Conference on Logic Programming, pages 774\u2013790, Budapest, Hungary, June 21-25 1993. MIT Press."},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0743-1066(95)00121-2","volume":"27","author":"P. Codognet","year":"1996","unstructured":"Philippe Codognet and Daniel Diaz. Compiling constraints in clp(fd). Journal of Logic Programming, 27(3):185\u2013226, 1996.","journal-title":"Journal of Logic Programming"},{"key":"36_CR11","unstructured":"Daniel Diaz and Philippe Codognet. Design and implementation of the gnu prolog system. Journal of Functional and Logic Programming, 2001(6), 2001."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Mehmet Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, and A. Herold. The CHIP System: Constraint Handling in Prolog. In Ewing Lusk and Ross Overbeek, editors, 9th International Conference on Automated Deduction, Argonne, May 1988. Springer.","DOI":"10.1007\/BFb0012892"},{"issue":"1-3","key":"36_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0743-1066(98)10008-0","volume":"37","author":"F. Fages","year":"1998","unstructured":"Fran\u00e7ois Fages, Julian Fowler, and Thierry Sola. Experiments in reactive constraint logic programming. Journal of Logic Programming, 37(1-3):185\u2013212, 1998.","journal-title":"Journal of Logic Programming"},{"issue":"1-3","key":"36_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fcwirth","year":"1998","unstructured":"Thom Fr\u00fcwirth. Theory and practice of Constraint Handling Rules. Journal of Logic Programming, 37(1-3):95\u2013138, 1998.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"36_CR15","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/129393.129398","volume":"14","author":"J. Jaffar","year":"1992","unstructured":"Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339\u2013395, 1992.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"36_CR16","unstructured":"Fran\u00e7ois Laburthe and the OCRE project. Choco: implementing a CP kernel. In TRICS, Techniques foR Implementing Constraint programming Systems, CP 2000 post-conference workshop, Technical report TRA9\/00, Singapore, sep 2000."},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0743-1066(93)90047-K","volume":"16","author":"T. Provost Le","year":"1993","unstructured":"Thierry Le Provost and Mark Wallace. Generalized constraint propagation over the CLP Scheme. Journal of Logic Programming, 16:319\u2013359, 1993.","journal-title":"Journal of Logic Programming"},{"key":"36_CR18","unstructured":"Jean-Francois Puget and Michel Leconte. Beyond the glass box: Constraints as objects. In John W. Lloyd, editor, International Logic Programming Symposium, pages 513\u2013527, Portland, Oregon, 1995. MIT Press."},{"key":"36_CR19","unstructured":"Jean-Charles R\u00e9gin. A filtering algorithm for constraints of difference in csps. In AAAI, National Conference on Artificial Intelligence, pages 362\u2013367, Seattle, WA, USA,, 1994. AAAI Press."},{"key":"36_CR20","unstructured":"Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993."},{"key":"36_CR21","unstructured":"P. van Hentenryck, V. Saraswat, and Y. Deville. Constraint processing in cc(fd). draft, 1991."},{"key":"36_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The Nature of Statistical Learning Theory","author":"V. N. Vapnik","year":"1995","unstructured":"V. N. Vapnik. The Nature of Statistical Learning Theory. Springer, New York, 1995."},{"key":"36_CR23","unstructured":"Neng-Fa Zhou. A high-level intermediate language and the algorithms for compiling finite-domain constraints. In Joxan Jaffar, editor, Joint International Conference and Symposium on Logic Programming, pages 70\u201384, Manchester, UK, 15-19 June 1998. MIT Press."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:25:24Z","timestamp":1556411124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}