{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:16:38Z","timestamp":1771262198301,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,11,21]],"date-time":"2020-11-21T00:00:00Z","timestamp":1605916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,21]],"date-time":"2020-11-21T00:00:00Z","timestamp":1605916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672261"],"award-info":[{"award-number":["61672261"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872159"],"award-info":[{"award-number":["61872159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61806050"],"award-info":[{"award-number":["61806050"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972063"],"award-info":[{"award-number":["61972063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10489-020-01998-5","type":"journal-article","created":{"date-parts":[[2020,11,21]],"date-time":"2020-11-21T11:02:31Z","timestamp":1605956551000},"page":"3865-3879","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Core-guided method for constraint-based multi-objective combinatorial optimization"],"prefix":"10.1007","volume":"51","author":[{"given":"Naiyu","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dantong","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yimou","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8263-4194","authenticated-orcid":false,"given":"Liming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,21]]},"reference":[{"issue":"5","key":"1998_CR1","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/BF02917402","volume":"42","author":"K Xu","year":"1999","unstructured":"Xu K, Li W (1999) The SAT phase transition. Science in China Series E: Technological Sciences 42(5):494\u2013501","journal-title":"Science in China Series E: Technological Sciences"},{"key":"1998_CR2","doi-asserted-by":"crossref","unstructured":"Gao J, Yin M, Xu K (2011) Phase transitions in knowledge compilation: an experimental study. In: Proceedings of international conference on theory and applications of satisfiability testing, Ann Arbor. pp 364\u2013366","DOI":"10.1007\/978-3-642-21581-0_31"},{"key":"1998_CR3","doi-asserted-by":"crossref","unstructured":"Luo C, Cai S, Wu W, et al. (2014) Double configuration checking in stochastic local search for satisfiability. In: Proceedings of 28th AAAI Conference on artificial intelligence, Qu\u00e9bec City. pp 2703\u20132709","DOI":"10.1609\/aaai.v28i1.9110"},{"key":"1998_CR4","unstructured":"Cai S, Su K (2013) Comprehensive score: Towards efficient local search for SAT with long clauses. In: Proceedings of 23th International joint conference on artificial intelligence, Beijing, pp 489\u2013495"},{"issue":"5","key":"1998_CR5","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1109\/TCYB.2014.2343242","volume":"45","author":"C Luo","year":"2015","unstructured":"Luo C, Cai S, Su K, et al. (2015) Clause states based configuration checking in local search for satisfiability. IEEE Trans Cybern 45(5):1028\u20131041","journal-title":"IEEE Trans Cybern"},{"issue":"4","key":"1998_CR6","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1109\/TETC.2017.2736504","volume":"7","author":"X Wang","year":"2019","unstructured":"Wang X, Jiang J (2019) Warning propagation algorithm for the MAX-3-SAT problem. IEEE Transactions on Emerging Topics in Computing 7(4):578\u2013584","journal-title":"IEEE Transactions on Emerging Topics in Computing"},{"issue":"9","key":"1998_CR7","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TCAD.2005.858352","volume":"25","author":"WNN Hung","year":"2006","unstructured":"Hung WNN, Song X, Yang G, et al. (2006) Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans Comput.-Aided Design Integr Circuits Syst 25(9):1652\u20131663","journal-title":"IEEE Trans Comput.-Aided Design Integr Circuits Syst"},{"issue":"2","key":"1998_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TCAD.2018.2812123","volume":"38","author":"B Alizadeh","year":"2019","unstructured":"Alizadeh B, Sharafinejad SR (2019) Incremental SAT-Based accurate auto-correction of sequential circuits through automatic test pattern generation. IEEE Trans Comput.-Aided Design Integr Circuits Syst 38 (2):245\u2013252","journal-title":"IEEE Trans Comput.-Aided Design Integr Circuits Syst"},{"issue":"1","key":"1998_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1613\/jair.4503","volume":"51","author":"A Metodi","year":"2014","unstructured":"Metodi A, Stern R, Kalech M, et al. (2014) A novel SAT-based approach to model based diagnosis. J Artif Intell Res 51(1):377\u2013411","journal-title":"J Artif Intell Res"},{"issue":"3","key":"1998_CR10","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/TRO.2019.2896401","volume":"35","author":"F Imeson","year":"2019","unstructured":"Imeson F, Smith SL (2019) An SMT-Based approach to motion planning for multiple robots with complex constraints. IEEE Trans Robot 35(3):669\u2013684","journal-title":"IEEE Trans Robot"},{"key":"1998_CR11","unstructured":"Zhang L, Madigan CF, Moskewicz MH, et al. (2001) Efficient conflict driven learning in a Boolean satisfiability solver. In: Proceedings of IEEE\/ACM International Conference on Computer Aided Design, New Orleans. 279\u2013285"},{"issue":"7","key":"1998_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s11432-017-9467-7","volume":"62","author":"F Xiao","year":"2019","unstructured":"Xiao F, Li CM, Luo M, et al. (2019) A branching heuristic for SAT solvers based on complete implication graphs. Science China Information Sciences 62(7):141\u2013153","journal-title":"Science China Information Sciences"},{"issue":"2","key":"1998_CR13","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/s10489-019-01528-y","volume":"50","author":"J Gao","year":"2020","unstructured":"Gao J, Ouyang D, Ye Y (2020) Exploring duality on ontology debugging. Appl Intell 50 (2):620\u2013633","journal-title":"Appl Intell"},{"issue":"4","key":"1998_CR14","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1007\/s10489-014-0549-6","volume":"41","author":"\u00c9 Gr\u00e9goire","year":"2014","unstructured":"Gr\u00e9goire \u00c9, Lagniez JM, Mazure B (2014) Boosting MUC extraction in unsatisfiable constraint networks. Appl Intell 41(4):1012\u20131023","journal-title":"Appl Intell"},{"key":"1998_CR15","doi-asserted-by":"crossref","unstructured":"Andraus ZS, Liffiton MH, Sakallah KA (2008) Reveal: A formal verification tool for verilog designs. In: Proceedings of international conference on logic for programming artificial intelligence and reasoning, Doha, pp 343\u2013352","DOI":"10.1007\/978-3-540-89439-1_25"},{"key":"1998_CR16","doi-asserted-by":"crossref","unstructured":"Lagniez JM, Lonca E, Mailly JG (2015) CoQuiAAS: A constraint-based quick abstract argumentation solver. In: Proceedings of 27th IEEE international conference on tools with artificial intelligence, Vietri sul Mare, pp 928\u2013935","DOI":"10.1109\/ICTAI.2015.134"},{"key":"1998_CR17","doi-asserted-by":"crossref","unstructured":"Arif MF, Menc\u00eda C, Marques-Silva J (2015) Efficient MUS enumeration of horn formulae with applications to axiom pinpointing. In: Proceedings of 18th international conference on theory and applications of satisfiability testing, Austin, pp 324\u2013342","DOI":"10.1007\/978-3-319-24318-4_24"},{"key":"1998_CR18","unstructured":"Menc\u00eda C, Previti A, Marques-Silva J (2015) Literal-based MCS extraction. In: Proceedings of 24th International Joint Conference on Artificial Intelligence, Buenos Aires, pp 1973\u20131979"},{"key":"1998_CR19","unstructured":"Pareto V (1906) Manuale di economia politica, vol. 13. Societa Editrice"},{"issue":"6","key":"1998_CR20","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"1998_CR21","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratap A, et al. (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimisation: NSGA-II. In: Proceedings of international conference on parallel problem solving from nature, Paris, pp 849\u2013858","DOI":"10.1007\/3-540-45356-3_83"},{"key":"1998_CR22","doi-asserted-by":"crossref","unstructured":"Zitzler E, Simon K (2004) Indicator-based selection in multiobjective search. In: Proceedings of 8th international conference on parallel problem solving from nature, Birmingham, pp 832\u2013842","DOI":"10.1007\/978-3-540-30217-9_84"},{"issue":"3","key":"1998_CR23","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume N, Naujoks B, Emmerich M (2007) SMS-EMOA: Multiobjective selection based on dominated hypervolume. Eur J Oper Res 181(3):1653\u20131669","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1998_CR24","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10732-009-9103-9","volume":"16","author":"T Lust","year":"2010","unstructured":"Lust T, Teghem J (2010) Two-phase Pareto local search for the biobjective traveling salesman problem. J Heuristics 16(3):475\u2013510","journal-title":"J Heuristics"},{"issue":"6","key":"1998_CR25","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1109\/TSMCB.2012.2231860","volume":"43","author":"L Ke","year":"2013","unstructured":"Ke L, Zhang Q, Battiti R (2013) MOEA\/D-ACO: A multiobjective evolutionary algorithm using decomposition and AntColony. IEEE Transactions on Cybernetics 43(6):1845\u20131859","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"5","key":"1998_CR26","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","volume":"19","author":"K Li","year":"2014","unstructured":"Li K, Deb K, Zhang Q, et al. (2014) An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans Evol Comput 19(5):694\u2013716","journal-title":"IEEE Trans Evol Comput"},{"key":"1998_CR27","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.swevo.2017.01.002","volume":"34","author":"Z Wang","year":"2017","unstructured":"Wang Z, Zhang Q, Li H, et al. (2017) On the use of two reference points in decomposition based multiobjective evolutionary algorithms. Swarm and Evolutionary Computation 34:89\u2013 102","journal-title":"Swarm and Evolutionary Computation"},{"key":"1998_CR28","doi-asserted-by":"crossref","unstructured":"Terra-Neves M, Lynce I, Manquinho V (2019) Integrating Pseudo-Boolean constraint reasoning in multi-objective evolutionary algorithms. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, Macao, pp 1184\u20131190","DOI":"10.24963\/ijcai.2019\/165"},{"key":"1998_CR29","unstructured":"Jackson D, Estler H, Rayside D, et al. (2009) The guided improvement algorithm for exact, general-purpose, many-objective combinatorial optimization. Technical Report MIT-CSAIL-TR-2009-033, MIT"},{"key":"1998_CR30","doi-asserted-by":"crossref","unstructured":"Bjorner N, Phan A, Fleckenstein L, et al. (2015) vZ - An optimizing SMT solver. Tools and algorithms for construction and analysis of systems, pp 194\u2013199","DOI":"10.1007\/978-3-662-46681-0_14"},{"key":"1998_CR31","doi-asserted-by":"crossref","unstructured":"Soh T, Banbara M, Tamura N, et al. (2017) Solving multiobjective discrete optimization problems with propositional minimal model generation. In: Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming, Melbourne, pp 596\u2013614","DOI":"10.1007\/978-3-319-66158-2_38"},{"key":"1998_CR32","doi-asserted-by":"crossref","unstructured":"Terra-Neves M, Lynce I, Manquinho V (2017) Introducing Pareto minimal correction subsets. In: Proceedings of international conference on theory and applications of satisfiability testing, Melbourne, pp 195\u2013211","DOI":"10.1007\/978-3-319-66263-3_13"},{"key":"1998_CR33","doi-asserted-by":"crossref","unstructured":"Terra-Neves M, Lynce I, Manquinho V (2018) Multi-objective optimization through Pareto minimal correction subsets. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence. Stockholm, pp 5379\u20135383","DOI":"10.24963\/ijcai.2018\/757"},{"key":"1998_CR34","doi-asserted-by":"crossref","unstructured":"Terra-Neves M, Lynce I, Manquinho V (2018) Stratification for constraint-based multi-objective combinatorial optimization. In: Proceedings of the 27th International joint conference on artificial intelligence. Stockholm, pp 1376\u20131382","DOI":"10.24963\/ijcai.2018\/191"},{"key":"1998_CR35","doi-asserted-by":"crossref","unstructured":"Terra-Neves M, Lynce I, Manquinho V (2018) Enhancing constraint-based multi-objective combinatorial optimization. In: Proceedings of the 32th AAAI Conference on Artificial Intelligence. New Orleans, pp 6649\u20136656","DOI":"10.24963\/ijcai.2018\/191"},{"issue":"1-3","key":"1998_CR36","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros E, Hammer PL (2002) Pseudo-Boolean optimization. Discret Appl Math 123(1-3):155\u2013225","journal-title":"Discret Appl Math"},{"issue":"1","key":"1998_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"MH Liffiton","year":"2008","unstructured":"Liffiton MH, Sakallah KA (2008) Algorithms for computing minimal unsatisfiable subsets of constraints. J Autom Reason 40(1):1\u201333","journal-title":"J Autom Reason"},{"issue":"1","key":"1998_CR38","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R Reiter","year":"1987","unstructured":"Reiter R (1987) A theory of diagnosis from first principles. Artif Intell 32(1):57\u201395","journal-title":"Artif Intell"},{"key":"1998_CR39","doi-asserted-by":"crossref","unstructured":"Bailey J, Stuckey PJ (2005) Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Proceedings of international workshop on practical aspects of declarative languages. Long Beach, pp 174\u2013186","DOI":"10.1007\/978-3-540-30557-6_14"},{"key":"1998_CR40","unstructured":"Marques-Silva J, Heras F, Janota M, et al. (2013) On computing minimal correction subsets. In: Proceedings of 23th international joint conference on artificial intelligence. Beijing, pp 615\u2013622"},{"issue":"1","key":"1998_CR41","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/0952813021000026795","volume":"15","author":"E Birnbaum","year":"2003","unstructured":"Birnbaum E, Lozinskii EL (2003) Consistent subsets of inconsistent systems: structure and behaviour. Journal of Experimental & Theoretical Artificial Intelligence 15(1):25\u201346","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"issue":"2","key":"1998_CR42","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/mcda.4020030204","volume":"3","author":"EL Ulungu","year":"1994","unstructured":"Ulungu EL, Teghem J (1994) Multi-objective combinatorial optimization problems: A survey. J Multi-Criteria Decis Anal 3(2):83\u2013104","journal-title":"J Multi-Criteria Decis Anal"},{"issue":"4","key":"1998_CR43","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"issue":"2-3","key":"1998_CR44","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/SAT190075","volume":"7","author":"D Le Berre","year":"2010","unstructured":"Le Berre D, Parrain A (2010) The Sat4j library, release 2.2. Journal on Satisfiability, Boolean Modeling and Computation 7(2-3):59\u201364","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"1998_CR45","doi-asserted-by":"crossref","unstructured":"Xu J, Fortes J (2010) Multi-objective virtual machine placement in virtualized data center environments. In: Proceedings of International Conference on Green Computing and Communications, & International Conference on Cyber, Physical and Social Computing. Hangzhou, pp 179\u2013188","DOI":"10.1109\/GreenCom-CPSCom.2010.137"},{"key":"1998_CR46","doi-asserted-by":"publisher","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, et al. (2016) Virtual machine consolidated placement based on multi-objective biogeography-based optimization. Futur Gener Comput Syst 54:95\u2013122","journal-title":"Futur Gener Comput Syst"},{"issue":"200","key":"1998_CR47","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200):675\u2013701","journal-title":"J Am Stat Assoc"},{"key":"1998_CR48","doi-asserted-by":"publisher","first-page":"103230","DOI":"10.1016\/j.artint.2019.103230","volume":"280","author":"Y Wang","year":"2020","unstructured":"Wang Y, Cai S, Chen J, et al. (2020) SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem. Artif Intell 280:103230","journal-title":"Artif Intell"},{"key":"1998_CR49","doi-asserted-by":"crossref","unstructured":"Wang Y, Cai S, Pan S, et al. (2020) Reduction and local search for weighted graph coloring problem. In: Proceedings of the 34th AAAI conference on artificial intelligence. New York, pp 2433\u20132441","DOI":"10.1609\/aaai.v34i03.5624"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01998-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01998-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01998-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T05:57:56Z","timestamp":1669701476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01998-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,21]]},"references-count":49,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["1998"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01998-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,21]]},"assertion":[{"value":"1 October 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}