{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:18:15Z","timestamp":1725524295336},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540883081"},{"type":"electronic","value":"9783540883098"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-88309-8_8","type":"book-chapter","created":{"date-parts":[[2009,1,12]],"date-time":"2009-01-12T19:43:38Z","timestamp":1231789418000},"page":"73-82","source":"Crossref","is-referenced-by-count":0,"title":["Using Indexed Finite Set Variables for Set Bounds Propagation"],"prefix":"10.1007","author":[{"given":"Ruben Duarte","family":"Viegas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Correia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Barahona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Azevedo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00137870","volume":"1","author":"C. Gervet","year":"1997","unstructured":"Gervet, C.: Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints journal\u00a01(3), 191\u2013244 (1997)","journal-title":"Constraints journal"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10601-006-9012-6","volume":"12","author":"F. Azevedo","year":"2007","unstructured":"Azevedo, F.: Cardinal: A finite sets constraint solver. Constraints journal\u00a012(1), 93\u2013129 (2007)","journal-title":"Constraints journal"},{"key":"8_CR3","unstructured":"ECLiPSE Constraint System, http:\/\/eclipse.crosscoreop.com\/"},{"key":"8_CR4","unstructured":"Correia, M., Barahona, P., Azevedo, F.: Casper: A programming environment for development and integration of constraint solvers. In: Azevedo, F., Gervet, C., Pontelli, E. (eds.) Proceedings of the First International Workshop on Constraint Programming Beyond Finite Integer Domains (BeyondFD 2005), pp. 59\u201373 (2005)"},{"key":"8_CR5","unstructured":"CaSPER: Constraint Solving Programming Environment for Research, http:\/\/proteina.di.fct.unl.pt\/casper\/"},{"key":"8_CR6","series-title":"Frontiers in Artificial Intelligence and Applications","volume-title":"Constraint Solving over Multi-Valued Logics","author":"F. Azevedo","year":"2003","unstructured":"Azevedo, F.: Constraint Solving over Multi-Valued Logics. Frontiers in Artificial Intelligence and Applications, vol.\u00a091. IOS Press, Amsterdam (2003)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-74970-7_30","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"M. Lagerkvist","year":"2007","unstructured":"Lagerkvist, M., Schulte, C.: Advisors for incremental propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 409\u2013422. Springer, Heidelberg (2007)"},{"key":"8_CR8","unstructured":"Viegas, R.D., Azevedo, F.: GRASPER: A Framework for Graph CSPs. In: Lee, J., Stuckey, P. (eds.) Proceedings of the Sixth International Workshop on Constraint Modelling and Reformulation (ModRef 2007), Providence, Rhode Island, USA (September 2007)"},{"key":"8_CR9","unstructured":"Viegas, R.D., Azevedo, F.: GRASPER: A Framework for Graph Constraint Satisfaction Problems. In: Analide, C., Novais, P., Henriques, P. (eds.) Simp\u00f3sio Doutoral em Intelig\u00eancia Artificial, Guimar\u00e3es, Portugal (December 2007)"},{"key":"8_CR10","unstructured":"Viegas, R.D., Azevedo, F.: GRASPER: A Framework for Graph Constraint Satisfaction Problems. In: Azevedo, F., Lynce, I., Manquinho, V. (eds.) Search Techniques for Constraint Satisfaction, Guimar\u00e3es, Portugal (December 2007)"},{"key":"8_CR11","unstructured":"Viegas, R.D.: Constraint Solving over Finite Graphs. Master\u2019s thesis, Faculdade de Ci\u00eancias e Tecnologia, Universidade Nova de Lisboa (2008)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Padberg, M.W.: Covering, Packing and Knapsack Problems. Annals of Discrete Mathematics, vol.\u00a04 (1979)","DOI":"10.1016\/S0167-5060(08)70831-8"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"J. Beasley","year":"1987","unstructured":"Beasley, J.: An algorithm for set covering problems. European Journal of Operational Research\u00a031, 85\u201393 (1987)","journal-title":"European Journal of Operational Research"},{"key":"8_CR14","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"J. Beasley","year":"1990","unstructured":"Beasley, J.: A Lagrangian Heuristic for Set-Covering problems. Naval Research Logistics (NRL)\u00a037(1), 151\u2013164 (1990)","journal-title":"Naval Research Logistics (NRL)"},{"key":"8_CR16","unstructured":"Mathews, C., van Holde, K.: Biochemistry, 2nd edn. Benjamin Cummings (1996)"},{"key":"8_CR17","volume-title":"Introduction to Bioinformatics","author":"T. Attwood","year":"1999","unstructured":"Attwood, T., Parry-Smith, D.: Introduction to Bioinformatics. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1007\/978-3-540-45193-8_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M.: Cost-based filtering for shorter path constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 694\u2013708. Springer, Heidelberg (2003)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Dooms, G.: The CP(Graph) Computation Domain in Constraint Programming. PhD thesis, Facult\u00e9 des Sciences Appliqu\u00e9es, Universit\u00e9 Catholique de Louvain (2006)","DOI":"10.1007\/11564751_18"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2013 IBERAMIA 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88309-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T12:00:55Z","timestamp":1619524855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88309-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540883081","9783540883098"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88309-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}