{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:51:36Z","timestamp":1649105496126},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,4,10]],"date-time":"2015-04-10T00:00:00Z","timestamp":1428624000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10601-015-9187-9","type":"journal-article","created":{"date-parts":[[2015,4,9]],"date-time":"2015-04-09T02:03:39Z","timestamp":1428545019000},"page":"414-432","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On getting rid of the preprocessing minimization step in MUC-finding algorithms"],"prefix":"10.1007","volume":"20","author":[{"given":"\u00c9ric","family":"Gr\u00e9goire","sequence":"first","affiliation":[]},{"given":"Jean-Marie","family":"Lagniez","sequence":"additional","affiliation":[]},{"given":"Bertrand","family":"Mazure","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,10]]},"reference":[{"key":"9187_CR1","unstructured":"Bakker, R.R., Dikker, F., Tempelman, F., & Wognum, P.M. (1993). Diagnosing and solving over-determined constraint satisfaction problems. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI\u201993), vol. 1, pp. 276\u2013281."},{"key":"9187_CR2","doi-asserted-by":"crossref","unstructured":"Belov, A., J\u00e4rvisalo, M., & Marques-Silva, J. (2013). Formula preprocessing in MUS extraction. In N. Piterman, & S. Smolka (Eds.) Proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2013), Lecture Notes in Computer Science, vol. 7795, pp. 110\u2013125. Springer.","DOI":"10.1007\/978-3-642-36742-7_8"},{"key":"9187_CR3","doi-asserted-by":"crossref","unstructured":"Belov, A., Lynce, I., & Marques-Silva, J. (2012). Towards efficient MUS extraction. AI Commununications, 97\u2013116.","DOI":"10.3233\/AIC-2012-0523"},{"key":"9187_CR4","unstructured":"Belov, A., & Marques-Silva, J. (2011). Accelerating MUS extraction with recursive model rotation. In Proceedings of the 11th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2011), pp. 37\u201340. FMCAD."},{"key":"9187_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.3233\/SAT190094","volume":"8","author":"A Belov","year":"2012","unstructured":"Belov, A., & Marques-Silva, J. (2012). MUSer2: An efficient MUS extractor, system description. Journal on Satisfiability. Boolean Modeling and Computation, 8, 123\u2013128.","journal-title":"Boolean Modeling and Computation"},{"key":"9187_CR6","unstructured":"Boussemart, F., H\u00e9mery, F., & Lecoutre, C. (2004). Sa\u00efs, L.: Boosting systematic search by weighting constraints. In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI\u201904), pp. 482\u2013486. Valencia (Spain)."},{"key":"9187_CR7","unstructured":"(2008). Third international CSP solver competition http:\/\/cpai.ucc.ie\/08\/ ."},{"key":"9187_CR8","unstructured":"(2009). Fourth international constraint solver competition http:\/\/cpai.ucc.ie\/09\/ ."},{"key":"9187_CR9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(92)90018-S","volume":"57","author":"T Eiter","year":"1992","unstructured":"Eiter, T., & Gottlob, G. (1992). On the complexity of propositional knowledge base revision, updates and counterfactual. Artificial Intelligence, 57, 227\u2013270.","journal-title":"Artificial Intelligence"},{"key":"9187_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Lagniez, J.M., & Mazure, B. (2011). A CSP solver focusing on FAC variables. In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP\u201911), Lecture Notes in Computer Science, vol. 6876, pp. 493\u2013507. Springer.","DOI":"10.1007\/978-3-642-23786-7_38"},{"key":"9187_CR11","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Lagniez, J. M., & Mazure, B. (2012). Relax!. In Proceedings of the 24th IEEE International Conference on Tools with Artificial Intelligence (ICTAI\u201912), pp. 146\u2013153. IEEE Computer Press.","DOI":"10.1109\/ICTAI.2012.28"},{"key":"9187_CR12","unstructured":"Gr\u00e9goire, \u00c9., Lagniez, J.M., & Mazure, B. (2013). Preserving partial solutions while relaxing constraint networks. In Proceedings of the 23th International Joint Conference on Artificial Intelligence (IJCAI\u201913) (pp. 552\u2013558). China: Beijing."},{"key":"9187_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Lagniez, J.M., & Mazure, B. (2014). Boosting MUC extraction in unsatisfiable constraint networks. Applied Intelligence, 1\u201312.","DOI":"10.1007\/s10489-014-0549-6"},{"key":"9187_CR14","unstructured":"Gr\u00e9goire, E., Mazure, B., & Piette, C. (2006). Extracting MUSes. In Proceedings of the 17th European Conference on Artificial Intelligence (ECAI\u201906), pp. 387\u2013391."},{"key":"9187_CR15","doi-asserted-by":"crossref","unstructured":"Gr\u0117goire, \u0116., Mazure, B., & Piette, C. (2006). Tracking MUSes and strict inconsistent covers. In Proceedings of the 6th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2006), pp. 39\u201346.","DOI":"10.1109\/FMCAD.2006.34"},{"key":"9187_CR16","doi-asserted-by":"crossref","unstructured":"Gr\u0117goire, \u0116., Mazure, B., & Piette, C. (2007). MUST: provide a finer-grained explanation of unsatisfiability. In Proceedings of 13th International Conference on Principles and Practice of Constraint Programming (CP\u201907), pp. 317\u2013331.","DOI":"10.1007\/978-3-540-74970-7_24"},{"issue":"4","key":"9187_CR17","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1142\/S0218213008004138","volume":"17","author":"\u00c9 Gr\u00e9goire","year":"2008","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., & Piette, C. (2008). On finding minimally unsatisfiable cores of CSPs. International Journal on Artificial Intelligence Tools (IJAIT), 17(4), 745\u2013763.","journal-title":"International Journal on Artificial Intelligence Tools (IJAIT)"},{"key":"9187_CR18","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., & Piette, C. (2006). Sa\u00efs, L.: A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs. In Proceedings of the IEEE International Conference on Information Reuse and Integration (IEEE-IRI\u201906), pp. 325\u2013329.","DOI":"10.1109\/IRI.2006.252434"},{"key":"9187_CR19","unstructured":"H\u00e9mery, F., Lecoutre, C., Sa\u00efs, L., & Boussemart, F. (2006). Extracting MUCs from constraint networks. In Proceedings of the 17th European Conference on Artificial Intelligence (ECAI\u201906), pp. 113\u2013117."},{"key":"9187_CR20","unstructured":"Junker, U. (2001). QuickXplain: Conflict detection for arbitrary constraint propagation algorithms, IJCAI\u201901 Workshop on Modelling and Solving Problems with Constraints (CONS-1)."},{"key":"9187_CR21","unstructured":"Junker, U. (2004). QuickXplain: Preferred explanations and relaxations for over-constrained problems. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI\u201904), pp. 167\u2013172."},{"key":"9187_CR22","unstructured":"Jussien, N., & Barichard, V. (2000). The PaLM system: explanation-based constraint programming. In Proceedings of TRICS: Techniques foR Implementing Constraint programming Systems, Post-conference workshop of CP\u201900, pp. 118\u2013133."},{"key":"9187_CR23","unstructured":"Laburthe, F., & OCRE Project Team, T. Choco: implementing a CP kernel. In Proceedings of TRICS: Techniques foR Implementing Constraint programming Systems, Post-conference Workshop of CP\u201900. Singapore (2000). http:\/\/www.choco-constraints.net ."},{"key":"9187_CR24","doi-asserted-by":"crossref","unstructured":"Lagniez, J.M., & Biere, A. (2013). Factoring out assumptions to speed up MUS extraction. In Proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing (SAT\u201911), Lecture Notes in Computer Science, vol. 6695, pp. 276\u2013292. Springer.","DOI":"10.1007\/978-3-642-39071-5_21"},{"key":"9187_CR25","unstructured":"Lagniez, J.M., Gr\u00e9goire, \u00c9., & Mazure, B. (2012). A data structure boosting the performance of local search for CSP solving. In International Conference on heuristics and Nature Inspired Computing (META\u201912). Paper also available from the authors\u2019 webpages http:\/\/www.cril.univ-artois.fr\/lagniez\/publication.html ."},{"key":"9187_CR26","doi-asserted-by":"crossref","DOI":"10.1002\/9780470611821","volume-title":"Constraint Networks: Techniques and Algorithms","author":"C Lecoutre","year":"2009","unstructured":"Lecoutre, C. (2009). Constraint Networks: Techniques and Algorithms. Wiley: International Scientific and Technical Encyclopedia."},{"issue":"1","key":"9187_CR27","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A.K. (1977). Consistency in networks of relations. Artificial Intelligence, 8(1), 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"9187_CR28","unstructured":"McAllester, D., Selman, B., & Kautz, H.A. (1997). Evidence for invariants in local search. In Fourteenth National Conference on Artificial Intelligence (AAAI\u201997), pp. 321\u2013326."},{"key":"9187_CR29","unstructured":"Nadel, A. (2010). Boosting minimal unsatisfiable core extraction. In Proceedings of the 10th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2010), pp. 221\u2013229. IEEE."},{"key":"9187_CR30","doi-asserted-by":"crossref","unstructured":"(2014). In O\u2019Sullivan, B. (Ed.) Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming (CP\u20192014), Lecture Notes in Computer Science, vol. 8656: Springer.","DOI":"10.1007\/978-3-319-10428-7"},{"issue":"1","key":"9187_CR31","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","volume":"37","author":"CH Papadimitriou","year":"1988","unstructured":"Papadimitriou, C.H., & Wolfe, D. (1988). The complexity of facets resolved. Journal of Computer and System Sciences, 37(1), 2\u201313.","journal-title":"Journal of Computer and System Sciences"},{"key":"9187_CR32","unstructured":"Pesant, G. (ed.) (2014). Constraints (Journal), vol. 19, Springer."},{"key":"9187_CR33","unstructured":"Rossi, F., van Beek, P., & Walsh, T. (eds.) (2006). Handbook of constraint programming. Elsevier Science."},{"key":"9187_CR34","doi-asserted-by":"crossref","unstructured":"Ryvchin, V., & Strichman, O. (2011). Faster extraction of high-level minimal unsatisfiable cores. In Proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Computer Science, vol. 6695, pp. 174\u2013187.","DOI":"10.1007\/978-3-642-21581-0_15"},{"key":"9187_CR35","doi-asserted-by":"crossref","unstructured":"(2014). In Simonis, H. (Ed.) Proceedings of the 11th International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR\u20192014), Lecture Notes in Computer Science, vol. 8451: Springer.","DOI":"10.1007\/978-3-319-07046-9"},{"key":"9187_CR36","unstructured":"de Siqueira, N., J., & Puget, J.F. (1988). Explanation-based generalization of failures. In Proceedings of the Eighth European Conference on Artificial Intelligence (ECAI\u201988), pp. 339\u2013344."},{"key":"9187_CR37","doi-asserted-by":"crossref","unstructured":"Wieringa, S. (2012). Understanding, improving and parallelizing MUS finding using model rotation. In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP\u201912), Lecture Notes in Computer Science, vol. 7514, pp. 672\u2013687. Springer.","DOI":"10.1007\/978-3-642-33558-7_49"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9187-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-015-9187-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9187-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T17:11:56Z","timestamp":1598893916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-015-9187-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,10]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9187"],"URL":"https:\/\/doi.org\/10.1007\/s10601-015-9187-9","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,10]]}}}