{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:39:31Z","timestamp":1743039571041,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381706"},{"type":"electronic","value":"9783642381713"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38171-3_4","type":"book-chapter","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T01:30:36Z","timestamp":1365643836000},"page":"44-60","source":"Crossref","is-referenced-by-count":1,"title":["Modeling Robustness in CSPs as Weighted CSPs"],"prefix":"10.1007","author":[{"given":"Laura","family":"Climent","sequence":"first","affiliation":[]},{"given":"Richard J.","family":"Wallace","sequence":"additional","affiliation":[]},{"given":"Miguel A.","family":"Salido","sequence":"additional","affiliation":[]},{"given":"Federico","family":"Barber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bofill, M., Busquets, D., Villaret, M.: A declarative approach to robust weighted Max-SAT. In: Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 2010), pp. 67\u201376 (2010)","DOI":"10.1145\/1836089.1836098"},{"key":"4_CR2","unstructured":"Climent, L., Salido, M., Barber, F.: Reformulating dynamic linear constraint satisfaction problems as weighted CSPs for searching robust solutions. In: Proceedings of the 9th Symposium of Abstraction, Reformulation, and Approximation (SARA 2011), pp. 34\u201341 (2011)"},{"key":"4_CR3","unstructured":"Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: Proceedings of the 7th National Conference on Artificial Intelligence (AAAI 1988), pp. 37\u201342 (1988)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0028188","volume-title":"Symbolic and Quantitative Approaches to Reasoning and Uncertainty","author":"H. Fargier","year":"1993","unstructured":"Fargier, H., Lang, J.: Uncertainty in constraint satisfaction problems: A probabilistic approach. In: Moral, S., Kruse, R., Clarke, E. (eds.) ECSQARU 1993. LNCS, vol.\u00a0747, pp. 97\u2013104. Springer, Heidelberg (1993)"},{"key":"4_CR5","unstructured":"Fargier, H., Lang, J., Schiex, T.: Mixed constraint satisfaction: A framework for decision problems under incomplete knowledge. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), pp. 175\u2013180 (1996)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-45349-0_38","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"D.W. Fowler","year":"2000","unstructured":"Fowler, D.W., Brown, K.N.: Branching constraint satisfaction problems for solutions robust under likely changes. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 500\u2013504. Springer, Heidelberg (2000)"},{"key":"4_CR7","volume-title":"Statistics for the social sciences","author":"W. Hays","year":"1973","unstructured":"Hays, W.: Statistics for the social sciences, 2nd edn., vol.\u00a0410. Holt, Rinehart and Winston, New York (1973)","edition":"2"},{"key":"4_CR8","unstructured":"Hebrard, E.: Robust Solutions for Constraint Satisfaction and Optimisation under Uncertainty. PhD thesis, University of New South Wales (2006)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Herrmann, H., Schneider, C., Moreira, A., Andrade Jr., J., Havlin, S.: Onion-like network topology enhances robustness against malicious attacks. Journal of Statistical Mechanics: Theory and Experiment\u00a02011(1), P01027 (2011)","DOI":"10.1088\/1742-5468\/2011\/01\/P01027"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2004.05.004","volume":"159","author":"J. Larrosa","year":"2004","unstructured":"Larrosa, J., Schiex, T.: Solving weighted CSP by maintaining arc consistency. Artificial Intelligence\u00a0159, 1\u201326 (2004)","journal-title":"Artificial Intelligence"},{"key":"4_CR11","unstructured":"Mackworth, A.: On reading sketch maps. In: Proceedings of the 5th International Joint Conference on Artificial Intelligence (IJCAI 1977), pp. 598\u2013606 (1977)"},{"key":"4_CR12","unstructured":"Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: Hard and easy problems. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 631\u2013637 (1995)"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10601-005-2239-9","volume":"10","author":"G. Verfaillie","year":"2005","unstructured":"Verfaillie, G., Jussien, N.: Constraint solving in uncertain and dynamic environments: A survey. Constraints\u00a010(3), 253\u2013281 (2005)","journal-title":"Constraints"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/3-540-49481-2_32","volume-title":"Principles and Practice of Constraint Programming - CP 1998","author":"R.J. Wallace","year":"1998","unstructured":"Wallace, R.J., Freuder, E.C.: Stable solutions for dynamic constraint satisfaction problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 447\u2013461. Springer, Heidelberg (1998)"},{"key":"4_CR15","unstructured":"Walsh, T.: Stochastic constraint programming. In: Proceedings of the 15th European Conference on Artificial Intelligence (ECAI 2002), pp. 111\u2013115 (2002)"},{"key":"4_CR16","unstructured":"William, F.: Topology and its applications. John Wiley & Sons (2006)"},{"key":"4_CR17","unstructured":"Winer, B.: Statistical principles in experimental design, 2nd edn. McGraw-Hill Book Company (1971)"},{"issue":"1","key":"4_CR18","first-page":"3","volume":"10","author":"N. Yorke-Smith","year":"2009","unstructured":"Yorke-Smith, N., Gervet, C.: Certainty closure: Reliable constraint reasoning with incomplete or erroneous data. Journal of ACM Transactions on Computational Logic (TOCL)\u00a010(1), 3 (2009)","journal-title":"Journal of ACM Transactions on Computational Logic (TOCL)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38171-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:07:32Z","timestamp":1609204052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38171-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381706","9783642381713"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38171-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}