{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:29:28Z","timestamp":1725798568687},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319104270"},{"type":"electronic","value":"9783319104287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10428-7_65","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T21:33:54Z","timestamp":1407879234000},"page":"908-912","source":"Crossref","is-referenced-by-count":0,"title":["Reformulation Based MaxSAT Robustness"],"prefix":"10.1007","author":[{"given":"Miquel","family":"Bofill","sequence":"first","affiliation":[]},{"given":"D\u00eddac","family":"Busquets","sequence":"additional","affiliation":[]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"65_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79719-7_1","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"J. Argelich","year":"2008","unstructured":"Argelich, J., Cabiscol, A., Lynce, I., Many\u00e0, F.: Modelling Max-CSP as Partial Max-SAT. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 1\u201314. Springer, Heidelberg (2008)"},{"issue":"1","key":"65_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D. Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The Price of Robustness. Operations Research\u00a052(1), 35\u201353 (2004)","journal-title":"Operations Research"},{"issue":"2","key":"65_CR3","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s10601-012-9130-2","volume":"18","author":"M. Bofill","year":"2013","unstructured":"Bofill, M., Busquets, D., Mu\u00f1oz, V., Villaret, M.: Reformulation based MaxSAT robustness. Constraints\u00a018(2), 202\u2013235 (2013)","journal-title":"Constraints"},{"key":"65_CR4","unstructured":"Ginsberg, M.L., Parkes, A.J., Roy, A.: Supermodels and robustness. In: 15th National Conference on Artificial Intelligence and 10th Innovative Applications of Artificial Intelligence Conference, AAAI\/IAAI 1998, pp. 334\u2013339. AAAI Press \/ The MIT Press (1998)"},{"key":"65_CR5","unstructured":"Hebrard, E.: Robust Solutions for Constraint Satisfaction and Optimisation under Uncertainty. PhD thesis, University of New South Wales (2006)"},{"key":"65_CR6","unstructured":"Hebrard, E., Hnich, B., O\u2019Sullivan, B., Walsh, T.: Finding Diverse and Similar Solutions in Constraint Programming. In: 20th National Conference on Artificial Intelligence and 17th Innovative Applications of Artificial Intelligence Conference, AAAI\/IAAI 2005, pp. 372\u2013377. AAAI Press \/ The MIT Press (2005)"},{"key":"65_CR7","unstructured":"Hebrard, E., Hnich, B., Walsh, T.: Robust Solutions for Constraint Satisfaction and Optimization. In: 16th Eureopean Conference on Artificial Intelligence, ECAI 2004, pp. 186\u2013190. IOS Press (2004)"},{"key":"65_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-24664-0_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"E. Hebrard","year":"2004","unstructured":"Hebrard, E., Hnich, B., Walsh, T.: Super Solutions in Constraint Programming. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 157\u2013172. Springer, Heidelberg (2004)"},{"key":"65_CR9","doi-asserted-by":"crossref","unstructured":"Hebrard, E., Hnich, B., Walsh, T.: Improved Algorithm for Finding (a,b)-Super Solutions. In: Workshop on Constraint Programming for Planning and Scheduling, pp. 236\u2013248 (2005)","DOI":"10.1007\/11564751_86"},{"key":"65_CR10","unstructured":"Holland, A., O\u2019Sullivan, B.: Weighted Super Solutions for Constraint Programs. In: 20th National Conference on Artificial Intelligence and 17th Innovative Applications of Artificial Intelligence Conference, AAAI\/IAAI 2005, pp. 378\u2013383. AAAI Press \/ The MIT Press (2005)"},{"key":"65_CR11","unstructured":"Li, C.M., Many\u00e0, F.: MaxSAT, Hard and Soft Constraints. In: Handbook of Satisfiability, pp. 613\u2013631. IOS Press (2009)"},{"key":"65_CR12","unstructured":"Roussel, O., Manquinho, V.: Pseudo-Boolean and Cardinality Constraints. In: Handbook of Satisfiability, pp. 695\u2013734. IOS Press (2009)"},{"key":"65_CR13","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1613\/jair.1914","volume":"25","author":"A. Roy","year":"2006","unstructured":"Roy, A.: Fault Tolerant Boolean Satisfiability. Journal of Artificial Intelligence Research\u00a025, 503\u2013527 (2006)","journal-title":"Journal of Artificial Intelligence Research"}],"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-319-10428-7_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T06:09:00Z","timestamp":1649916540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10428-7_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319104270","9783319104287"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10428-7_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}