{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:16:35Z","timestamp":1771262195548,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319662626","type":"print"},{"value":"9783319662633","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66263-3_13","type":"book-chapter","created":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T08:05:11Z","timestamp":1502179511000},"page":"195-211","source":"Crossref","is-referenced-by-count":6,"title":["Introducing Pareto Minimal Correction Subsets"],"prefix":"10.1007","author":[{"given":"Miguel","family":"Terra-Neves","sequence":"first","affiliation":[]},{"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[]},{"given":"Vasco","family":"Manquinho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,9]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bacchus, F., Davies, J., Tsimpoukelli, M., Katsirelos, G.: Relaxation search: a simple way of managing optional clauses. In: 28th Conference on Artificial Intelligence, pp. 835\u2013841. AAAI (2014)","DOI":"10.1609\/aaai.v28i1.8849"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-30557-6_14","volume-title":"Practical Aspects of Declarative Languages","author":"J Bailey","year":"2005","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2005. LNCS, vol. 3350, pp. 174\u2013186. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30557-6_14"},{"issue":"1","key":"13_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02136172","volume":"18","author":"R Ben-Eliyahu","year":"1996","unstructured":"Ben-Eliyahu, R., Dechter, R.: On computing minimal models. Ann. Math. Artif. Intell. 18(1), 3\u201327 (1996)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"13_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/0952813021000026795","volume":"15","author":"E Birnbaum","year":"2003","unstructured":"Birnbaum, E., Lozinskii, E.L.: Consistent subsets of inconsistent systems: structure and behaviour. J. Exp. Theoret. Artif. Intell. 15(1), 25\u201346 (2003)","journal-title":"J. Exp. Theoret. Artif. Intell."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-662-46681-0_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Bj\u00f8rner","year":"2015","unstructured":"Bj\u00f8rner, N., Phan, A.-D., Fleckenstein, L.: vZ - an optimizing SMT solver. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 194\u2013199. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46681-0_14"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"K Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J.J., Schwefel, H.-P. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849\u2013858. Springer, Heidelberg (2000). doi: 10.1007\/3-540-45356-3_83"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Fan, X., Weber, W., Barroso, L.A.: Power provisioning for a warehouse-sized computer. In: 34th International Symposium on Computer Architecture, pp. 13\u201323 (2007)","DOI":"10.1145\/1250662.1250665"},{"issue":"1","key":"13_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1017\/S0890060411000011","volume":"26","author":"A Felfernig","year":"2012","unstructured":"Felfernig, A., Schubert, M., Zehentner, C.: An efficient diagnosis algorithm for inconsistent constraint sets. Artif. Intell. Eng. Des. Anal. Manuf. 26(1), 53\u201362 (2012)","journal-title":"Artif. Intell. Eng. Des. Anal. Manuf."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Lagniez, J., Mazure, B.: An experimentally efficient method for (mss, comss) partitioning. In: 28th Conference on Artificial Intelligence, pp. 2666\u20132673. AAAI (2014)","DOI":"10.1609\/aaai.v28i1.9118"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Janota, M., Marques-Silva, J.: Towards efficient optimization in package management systems. In: 36th International Conference on Software Engineering, pp. 745\u2013755 (2014)","DOI":"10.1145\/2568225.2568306"},{"key":"13_CR11","unstructured":"Junker, U.: QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. In: 19th National Conference on Artificial Intelligence, 16th Conference on Innovative Applications of Artificial Intelligence, pp. 167\u2013172 (2004)"},{"issue":"2\u20133","key":"13_CR12","first-page":"59","volume":"7","author":"D Berre Le","year":"2010","unstructured":"Le Berre, D., Parrain, A.: The sat4j library, release 2.2. J. Satisfiab. Bool. Model. Comput. 7(2\u20133), 59\u201364 (2010)","journal-title":"J. Satisfiab. Bool. Model. Comput."},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-642-02777-2_45","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"V Manquinho","year":"2009","unstructured":"Manquinho, V., Marques-Silva, J.P., Planes, J.: Algorithms for weighted boolean optimization. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 495\u2013508. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-02777-2_45"},{"key":"13_CR14","unstructured":"Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On computing minimal correction subsets. In: 23rd International Joint Conference on Artificial Intelligence, IJCAI, pp. 615\u2013622 (2013)"},{"key":"13_CR15","unstructured":"Menc\u00eda, C., Previti, A., Marques-Silva, J.: Literal-based MCS extraction. In: 24th International Joint Conference on Artificial Intelligence, IJCAI, pp. 1973\u20131979 (2015)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"N\u00f6hrer, A., Biere, A., Egyed, A.: Managing SAT inconsistencies with HUMUS. In: 6th International Workshop on Variability Modelling of Software-Intensive Systems, pp. 83\u201391 (2012)","DOI":"10.1145\/2110147.2110157"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11564751_34","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"B O\u2019Callaghan","year":"2005","unstructured":"O\u2019Callaghan, B., O\u2019Sullivan, B., Freuder, E.C.: Generating corrective explanations for interactive constraint satisfaction. In: Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 445\u2013459. Springer, Heidelberg (2005). doi: 10.1007\/11564751_34"},{"key":"13_CR18","volume-title":"Manuale di Economia Politica","author":"V Pareto","year":"1906","unstructured":"Pareto, V.: Manuale di Economia Politica, vol. 13. Societa Editrice, Milano (1906)"},{"key":"13_CR19","unstructured":"Rayside, D., Estler, H.C., Jackson, D.: The guided improvement algorithm for exact, general-purpose, many-objective combinatorial optimization. Technical report. MIT-CSAIL-TR-2009-033, MIT Massachusetts Institute of Technology (2009)"},{"key":"13_CR20","unstructured":"Salfner, F., Tr\u00f6ger, P., Polze, A.: Downtime analysis of virtual machine live migration. In: 4th International Conference on Dependability, IARIA, pp. 100\u2013105 (2011)"},{"issue":"2","key":"13_CR21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/mcda.4020030204","volume":"3","author":"EL Ulungu","year":"1994","unstructured":"Ulungu, E.L., Teghem, J.: Multi-objective combinatorial optimization problems: a survey. J. Multi-Crit. Dec. Anal. 3(2), 83\u2013104 (1994)","journal-title":"J. Multi-Crit. Dec. Anal."},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Xu, J., Fortes, J.A.B.: Multi-objective virtual machine placement in virtualized data center environments. In: IEEE\/ACM International Conference on Green Computing and Communications, GreenCom, & International Conference on Cyber, Physical and Social Computing, CPSCom, pp. 179\u2013188 (2010)","DOI":"10.1109\/GreenCom-CPSCom.2010.137"},{"key":"13_CR23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.future.2015.02.010","volume":"54","author":"Q Zheng","year":"2016","unstructured":"Zheng, Q., Li, R., Li, X., Shah, N., Zhang, J., Tian, F., Chao, K., Li, J.: Virtual machine consolidated placement based on multi-objective biogeography-based optimization. Future Gener. Comput. Syst. 54, 95\u2013122 (2016)","journal-title":"Future Gener. Comput. Syst."},{"issue":"4","key":"13_CR24","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66263-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T21:37:03Z","timestamp":1659303423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66263-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662626","9783319662633"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66263-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}