{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:17:00Z","timestamp":1648948620029},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,11,14]],"date-time":"2012-11-14T00:00:00Z","timestamp":1352851200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10601-012-9130-2","type":"journal-article","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T12:52:54Z","timestamp":1352811174000},"page":"202-235","source":"Crossref","is-referenced-by-count":3,"title":["Reformulation based MaxSAT robustness"],"prefix":"10.1007","volume":"18","author":[{"given":"Miquel","family":"Bofill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00eddac","family":"Busquets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edctor","family":"Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,14]]},"reference":[{"key":"9130_CR1","doi-asserted-by":"crossref","unstructured":"Ab\u00edo, I., Deters, M., Nieuwenhuis, R., Stuckey, P.J. (2011). Reducing chaos in SAT-like search: Finding solutions close to a given one. In 14th international conference on theory and applications of satisfiability testing, SAT 2011, LNCS (Vol.\u00a06695, pp. 273\u2013286). Springer.","DOI":"10.1007\/978-3-642-21581-0_22"},{"key":"9130_CR2","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J. (2009). Solving (weighted) partial MaxSAT through satisfiability testing. In 12th international conference on theory and applications of satisfiability testing, SAT 2009, LNCS (Vol.\u00a05584, pp. 427\u2013440). Springer.","DOI":"10.1007\/978-3-642-02777-2_39"},{"key":"9130_CR3","doi-asserted-by":"crossref","unstructured":"Argelich, J., Cabiscol, A., Lynce, I., Many\u00e0, F. (2008). Modelling Max-CSP as partial Max-SAT. In 11th international conference on theory and applications of satisfiability testing, SAT 2008, LNCS (Vol. 4996, pp. 1\u201314). Springer.","DOI":"10.1007\/978-3-540-79719-7_1"},{"issue":"2\u20134","key":"9130_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.3233\/SAT190047","volume":"4","author":"J Argelich","year":"2008","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F., Planes, J. (2008). The first and second Max-SAT evaluations. Journal on Satisfiability, Boolean Modeling and Computation, 4(2\u20134), 251\u2013278.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"9130_CR5","unstructured":"Argelich, J., Lynce, I., Marques-Silva, J.P. (2009). On solving boolean multilevel optimization problems. In: 21st international joint conference on artificial intelligence, IJCAI 2009 (pp. 393\u2013398)."},{"issue":"1","key":"9130_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35\u201353.","journal-title":"Operations Research"},{"key":"9130_CR7","unstructured":"Bofill, M., Busquets, D., Villaret, M. (2010). A declarative approach to robust weighted Max-SAT. In: 12th international ACM SIGPLAN conference on principles and practice of declarative programming, PPDP 2010 (pp. 67\u201376). ACM."},{"key":"9130_CR8","unstructured":"Cramton, P., Shoham, Y., Steinberg, R. (Eds.) (2006). Combinatorial auctions. MIT Press."},{"issue":"1\u20134","key":"9130_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., & S\u00f6rensson, N. (2006). Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2(1\u20134), 1\u201326.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"issue":"2","key":"9130_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.3233\/AIC-2011-0497","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Schneider, M. (2011). Potassco: the Potsdam answer set solving collection. AI Communications, 24(2), 105\u2013124.","journal-title":"AI Communications"},{"key":"9130_CR11","unstructured":"Ginsberg, M.L., Parkes, A.J., Roy, A. (1998). 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."},{"key":"9130_CR12","unstructured":"Gu, Z., Rothberg, E., Bixby, R. (2010). Gurobi 4.0.2. http:\/\/www.gurobi.com . Accessed 10 Apr 2011."},{"key":"9130_CR13","unstructured":"Hebrard, E. (2006). Robust solutions for constraint satisfaction and optimisation under uncertainty. Ph.D. thesis, University of New South Wales."},{"key":"9130_CR14","unstructured":"Hebrard, E., Hnich, B., O\u2019Sullivan, B., Walsh, T. (2005). 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."},{"key":"9130_CR15","unstructured":"Hebrard, E., Hnich, B., Walsh, T. (2004). Robust solutions for constraint satisfaction and optimization. In: 16th Eureopean conference on artificial intelligence, ECAI 2004 (pp. 186\u2013190). IOS Press."},{"key":"9130_CR16","unstructured":"Hebrard, E., Hnich, B., Walsh, T. (2004). Super solutions in constraint programming. In: 8th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems, CPAIOR 2004, LNCS (Vol. 3011, pp. 157\u2013172). Springer."},{"key":"9130_CR17","unstructured":"Hebrard, E., Hnich, B., Walsh, T. (2005). Improved algorithm for finding (a,b)-super solutions. In: Workshop on constraint programming for planning and scheduling (pp. 236\u2013248)."},{"issue":"2\u20134","key":"9130_CR18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.3233\/SAT190046","volume":"4","author":"F Heras","year":"2008","unstructured":"Heras, F., Larrosa, J., de\u00a0Givry, S., Schiex, T. (2008). 2006 and 2007 Max-SAT evaluations: contributed instances. Journal on Satisfiability, Boolean Modeling and Computation, 4(2\u20134), 239\u2013250.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"9130_CR19","unstructured":"Holland, A. (2005). Risk management for combinatorial auctions. Ph.D. thesis, Department of Computer Science, National University of Ireland, Cork."},{"key":"9130_CR20","unstructured":"Holland, A., & O\u2019Sullivan, B. (2005). Robust solutions for combinatorial auctions. In: 6th ACM conference on electronic commerce, EC 2005 (pp. 183\u2013192). ACM."},{"key":"9130_CR21","unstructured":"Holland, A., & O\u2019Sullivan, B. (2005). 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."},{"key":"9130_CR22","unstructured":"Hoos, H.H., & Boutilier, C. (2000). Solving combinatorial auctions using stochastic local search. In: 17th national conference on artificial intelligence and 12th innovative applications of artificial intelligence conference, AAAI\/IAAI 2000 (pp. 22\u201329). AAAI Press\/The MIT Press."},{"key":"9130_CR23","unstructured":"IBM ILOG CPLEX Optimizer (2011). www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/ . Accessed 15 Nov 2011."},{"issue":"2\u20133","key":"9130_CR24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/SAT190075","volume":"7","author":"D Berre Le","year":"2010","unstructured":"Le Berre, D., & Parrain, A. (2010). The Sat4j library, release 2.2. Journal on Satisfiability, Boolean Modeling and Computation, 7(2\u20133), 59\u20136.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"9130_CR25","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y. (2000). Towards a universal test suite for combinatorial auction algorithms. In: ACM conference on electronic commerce, EC 2000 (pp. 66\u201376). ACM."},{"key":"9130_CR26","unstructured":"Li, C.M., & Many\u00e0, F. (2009). Handbook of satisfiability (Chap. MaxSAT, Hard and Soft Constraints, pp. 613\u2013631). IOS Press."},{"issue":"3","key":"9130_CR27","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10601-007-9022-z","volume":"12","author":"L Liu","year":"2007","unstructured":"Liu, L., & Truszczynski, M. (2007). Satisfiability testing of boolean combinations of pseudo-boolean constraints using local-search techniques. Constraints, 12(3), 345\u2013369.","journal-title":"Constraints"},{"key":"9130_CR28","unstructured":"Manquinho, V.M., Marques-Silva, J.P., Planes, J. (2009). Algorithms for weighted boolean optimization. In: 12th international conference on theory and applications of satisfiability testing, SAT 2009, LNCS (Vol. 5584, pp. 495\u2013508). Springer."},{"key":"9130_CR29","unstructured":"Mu\u00f1oz, V. (2011). Robustness in resource allocation problems. Ph.D. thesis, Department d\u2019Enginyeria El\u00e8ctrica, Electr\u00f2nica i Autom\u00e0tica, Universitat de Girona, Spain."},{"key":"9130_CR30","unstructured":"Rossi, F., van Beek, P., Walsh, T. (Eds.) (2006) Handbook of constraint programming (Foundations of Artificial Intelligence). Elsevier Science."},{"key":"9130_CR31","unstructured":"Roussel, O., & Manquinho, V. (2009) Handbook of satisfiability (Chap. Pseudo-Boolean and Cardinality Constraints, pp. 695\u2013734). IOS Press."},{"key":"9130_CR32","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1613\/jair.1914","volume":"25","author":"A Roy","year":"2006","unstructured":"Roy, A. (2006). Fault tolerant boolean satisfiability. Journal of Artificial Intelligence Research, 25, 503\u2013527.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9130_CR33","unstructured":"Soos, M. (2009). CryptoMiniSat\u2014A SAT solver for cryptographic problems. http:\/\/planete.inrialpes.fr\/~soos\/CryptoMiniSat2\/index.php . Accessed 18 Jan 2012."},{"key":"9130_CR34","unstructured":"Weigel, R., & Bliek, C. (1998). On reformulation of constraint satisfaction problems. In: 13th European conference on artificial intelligence, ECAI 1998 (pp. 254\u2013258)."},{"key":"9130_CR35","unstructured":"Williams, H.P. (1999). Model building in mathematical programming, 4th Edition. Wiley."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-012-9130-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-012-9130-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-012-9130-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T02:03:05Z","timestamp":1594864985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-012-9130-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,14]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9130"],"URL":"https:\/\/doi.org\/10.1007\/s10601-012-9130-2","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,14]]}}}