{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:22:49Z","timestamp":1725895369845},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335570"},{"type":"electronic","value":"9783642335587"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_29","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T02:32:47Z","timestamp":1349231567000},"page":"373-389","source":"Crossref","is-referenced-by-count":2,"title":["Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Lallouet","sequence":"first","affiliation":[]},{"given":"Jimmy H. M.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Terrence W. K.","family":"Mak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Allis, L.V.: Searching for solutions in games and artificial intelligence. Ph.D. thesis, University of Limburg (1994)"},{"key":"29_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K. Apt","year":"2003","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press, New York (2003)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-85958-1_31","volume-title":"Principles and Practice of Constraint Programming","author":"M. Benedetti","year":"2008","unstructured":"Benedetti, M., Lallouet, A., Vautard, J.: Quantified Constraint Optimization. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 463\u2013477. Springer, Heidelberg (2008)"},{"key":"29_CR4","unstructured":"Bordeaux, L., Cadoli, M., Mancini, T.: CSP properties for quantified constraints: Definitions and complexity. In: AAAI 2005, pp. 360\u2013365 (2005)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-46135-3_25","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"L. Bordeaux","year":"2002","unstructured":"Bordeaux, L., Monfroy, E.: Beyond NP: Arc-Consistency for Quantified Constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 371\u2013386. Springer, Heidelberg (2002)"},{"key":"29_CR6","unstructured":"Brown, K.N., Little, J., Creed, P.J., Freuder, E.C.: Adversarial constraint satisfaction by game-tree search. In: ECAI 2004, pp. 151\u2013155 (2004)"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"B. Cabon","year":"1999","unstructured":"Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.: Radio link frequency assignment. Constraints\u00a04, 79\u201389 (1999)","journal-title":"Constraints"},{"key":"29_CR8","unstructured":"Cooper, M.C., de Givry, S., Schiex, T.: Optimal soft arc consistency. In: IJCAI 2007, pp. 68\u201373 (2007)"},{"issue":"7-8","key":"29_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.artint.2010.02.001","volume":"174","author":"M.C. Cooper","year":"2010","unstructured":"Cooper, M.C., de Givry, S., Sanchez, M., Schiex, T., Zytnicki, M., Werner, T.: Soft arc consistency revisited. Artificial Intelligence\u00a0174(7-8), 449\u2013478 (2010)","journal-title":"Artificial Intelligence"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BFb0017448","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"R. Debruyne","year":"1997","unstructured":"Debruyne, R., Bessi\u00e8re, C.: From Restricted Path Consistency to Max-Restricted Path Consistency. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 312\u2013326. Springer, Heidelberg (1997)"},{"key":"29_CR11","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers (2002)"},{"key":"29_CR12","unstructured":"Gent, I.P., Nightingale, P., Stergiou, K.: QCSP-Solve: A solver for quantified constraint satisfaction problems. In: IJCAI 2005, pp. 138\u2013143 (2005)"},{"issue":"1-2","key":"29_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0004-3702(01)00152-7","volume":"134","author":"H.J. Herik van den","year":"2002","unstructured":"van den Herik, H.J., Uiterwijk, J.W.H.M., van Rijswijck, J.: Games solved: Now and in the future. Artif. Intell.\u00a0134(1-2), 277\u2013311 (2002)","journal-title":"Artif. Intell."},{"key":"29_CR14","unstructured":"Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted CSP. In: IJCAI 2003, pp. 239\u2013244 (2003)"},{"issue":"1-2","key":"29_CR15","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-2), 1\u201326 (2004)","journal-title":"Artificial Intelligence"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Lee, J.H.M., Mak, T.W.K., Yip, J.: Weighted constraint satisfaction problems with min-max quantifiers. In: ICTAI 2011, pp. 769\u2013776 (2011)","DOI":"10.1109\/ICTAI.2011.121"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Lee, J.H.M., Shum, Y.W.: Modeling soft global constraints as linear programs in weighted constraint satisfaction. In: ICTAI 2011, pp. 305\u2013312 (2011)","DOI":"10.1109\/ICTAI.2011.53"},{"key":"29_CR18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1613\/jair.3476","volume":"43","author":"J.H.M. Lee","year":"2012","unstructured":"Lee, J.H.M., Leung, K.L.: Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction. JAIR\u00a043, 257\u2013292 (2012)","journal-title":"JAIR"},{"key":"29_CR19","unstructured":"Lee, J.H.M., Leung, K.L., Wu, Y.: Polynomially decomposable global cost functions in weighted constraint satisfaction. In: AAAI 2012 (to appear, 2012)"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/978-3-540-30201-8_60","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N. Mamoulis","year":"2004","unstructured":"Mamoulis, N., Stergiou, K.: Algorithms for Quantified Constraint Satisfaction Problems. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 752\u2013756. Springer, Heidelberg (2004)"},{"key":"29_CR21","unstructured":"Murty, K.G.: Linear and Combinatorial Programming. R. E. Krieger (1985)"},{"key":"29_CR22","unstructured":"Neumann, J.V., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press (1944)"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"29_CR24","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Pearson Education (2003)"},{"issue":"5844","key":"29_CR25","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1144079","volume":"317","author":"J. Schaeffer","year":"2007","unstructured":"Schaeffer, J., Burch, N., Bj\u00f6rnsson, Y., Kishimoto, A., M\u00fcller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is solved. Science\u00a0317(5844), 1518\u20131522 (2007)","journal-title":"Science"},{"key":"29_CR26","unstructured":"Walsh, T.: Stochastic constraint programming. In: ECAI 2002, pp. 111\u2013115 (2002)"},{"key":"29_CR27","unstructured":"Wolsey, L.A.: Integer Programming. Wiley (1998)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T03:16:19Z","timestamp":1557285379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}