{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:18:14Z","timestamp":1742397494912},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749691"},{"type":"electronic","value":"9783540749707"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74970-7_24","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T19:49:08Z","timestamp":1191959348000},"page":"317-331","source":"Crossref","is-referenced-by-count":9,"title":["MUST: Provide a Finer-Grained Explanation of Unsatisfiability"],"prefix":"10.1007","author":[{"given":"\u00c9ric","family":"Gr\u00e9goire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Mazure","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"Piette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Hemery, F., Lecoutre, C., Sa\u00efs, L., Boussemart, F.: Extracting MUCs from constraint networks. In: ECAI 2006. Proceedings of the 17th European Conference on Artificial Intelligence, pp. 113\u2013117 (2006)"},{"key":"24_CR2","unstructured":"Gr\u00e9goire, E., Mazure, B., Piette, C.: Extracting MUSes. In: ECAI 2006. Proceedings of the 17th European Conference on Artificial Intelligence, pp. 387\u2013391 (2006)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0004-3702(92)90018-S","volume":"57","author":"T. Eiter","year":"1992","unstructured":"Eiter, T., Gottlob, G.: On the complexity of propositional knowledge base revision, updates and counterfactual. Artificial Intelligence\u00a057, 227\u2013270 (1992)","journal-title":"Artificial Intelligence"},{"key":"24_CR4","series-title":"ch. 14","volume-title":"Feasibility and Viability, In: Advances in Sensitivity Analysis and Parametric Programming","author":"J. Chinneck","year":"1997","unstructured":"Chinneck, J.: Feasibility and Viability, In: Advances in Sensitivity Analysis and Parametric Programming. ch. 14, vol.\u00a06. Kluwer Academic Publishers, Boston (USA) (1997)"},{"key":"24_CR5","unstructured":"de Kleer, J.: A comparison of ATMS and CSP techniques. In: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI 1989), pp. 290\u2013296 (1989)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"T. Walsh","year":"2000","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)"},{"key":"24_CR7","unstructured":"CSPcomp: CSP competition, \n                    \n                      http:\/\/cpai.ucc.ie\/06\/competition.html"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"T. Petit","year":"2003","unstructured":"Petit, T., Bessi\u00e8re, C., R\u00e9gin, J.: A general conflict-set based framework for partial constraint satisfaction. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, Springer, Heidelberg (2003)"},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M.L. Ginsberg","year":"1993","unstructured":"Ginsberg, M.L.: Dynamic backtracking. Journal of Artificial Intelligence Research\u00a01, 25\u201346 (1993)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Jussien, N., Debruyne, R., Boizumault, P.: Maintaining arc-consistency within dynamic backtracking. In: Principles and Practice of Constraint Programming, pp. 249\u2013261 (2000)","DOI":"10.1007\/3-540-45349-0_19"},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"Prosser, P.: Hybrid algorithms for the constraint satisfaction problems. Computational Intelligence\u00a09(3), 268\u2013299 (1993)","journal-title":"Computational Intelligence"},{"key":"24_CR12","unstructured":"Junker, U.: QuickXplain: Conflict detection for arbitrary constraint propagation algorithms. In: IJCAI 2001 Workshop on Modelling and Solving problems with constraints (CONS-1) (2001)"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/3477.752801","volume":"29","author":"B. Han","year":"1999","unstructured":"Han, B., Lee, S.: Deriving minimal conflict sets by CS-Trees with mark set in diagnosis from first principles. IEEE Transactions on Systems, Man, and Cybernetics\u00a029, 281\u2013286 (1999)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"de la Banda, M., Stuckey, P.J., Wazny, J.: Finding all minimal unsatisfiable subsets. In: Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDL 2003), pp. 32\u201343 (2003)","DOI":"10.1145\/888251.888256"},{"key":"24_CR15","unstructured":"Mauss, J., Tatar, M.M.: Computing minimal conflicts for rich constraint languages. In: Proceedings of the 15th European Conference on Artificial Intelligence (ECAI 2002), pp. 151\u2013155 (2002)"},{"key":"24_CR16","unstructured":"Junker, U.: QuickXplain: Preferred explanations and relaxations for over-constrained problems. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004), pp. 167\u2013172 (2004)"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-45349-0_19","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"N. Jussien","year":"2000","unstructured":"Jussien, N., Barichard, V.: The PaLM system: explanation-based constraint programming. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 118\u2013133. Springer, Heidelberg (2000)"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"F. Laburthe","year":"2000","unstructured":"Laburthe, F., Team, T.O.P.: Choco: implementing a cp kernel. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, Springer, Heidelberg (2000), \n                    \n                      http:\/\/www.choco-constraints.net"},{"key":"24_CR19","first-page":"276","volume-title":"Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 1993)","author":"R.R. Bakker","year":"1993","unstructured":"Bakker, R.R., Dikker, F., Tempelman, F., Wognum, P.M.: Diagnosing and solving over-determined constraint satisfaction problems. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 1993), vol.\u00a01, pp. 276\u2013281. Morgan Kaufmann, San Francisco (1993)"},{"issue":"2","key":"24_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(02)00399-2","volume":"130","author":"R. Bruni","year":"2003","unstructured":"Bruni, R.: Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Applied Mathematics\u00a0130(2), 85\u2013100 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","author":"L. Zhang","year":"2004","unstructured":"Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable boolean formula. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919. Springer, Heidelberg (2004)"},{"key":"24_CR22","unstructured":"Lynce, I., Marques-Silva, J.: On computing minimum unsatisfiable cores. In: International Conference on Theory and Applications of Satisfiability Testing (2004)"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/11499107_40","volume-title":"Theory and Applications of Satisfiability Testing","author":"M.N. Mneimneh","year":"2005","unstructured":"Mneimneh, M.N., Lynce, I., Andraus, Z.S., Marques Silva, J.P., Sakallah, K.A.: A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 467\u2013474. Springer, Heidelberg (2005)"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Oh, Y., Mneimneh, M., Andraus, Z., Sakallah, K., Markov, I.: AMUSE: a minimally-unsatisfiable subformula extractor. In: Proceedings of the 41th Design Automation Conference (DAC 2004), pp. 518\u2013523 (2004)","DOI":"10.1145\/996566.996710"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/11499107_13","volume-title":"Theory and Applications of Satisfiability Testing","author":"M. Liffiton","year":"2005","unstructured":"Liffiton, M., Sakallah, K.: On finding all minimally unsatisfiable subformulas. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 173\u2013186. Springer, Heidelberg (2005)"},{"key":"24_CR26","unstructured":"Gr\u00e9goire, E., Mazure, B., Piette, C.: Boosting a complete technique to find MSSes and MUSes thanks to a local search oracle. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), vol.\u00a02, pp. 2300\u20132305 (2007)"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Atlihan, M., Schrage, L.: Generalized filtrering algorithms for infeasibility analysis. Computers and Operations Research (to appear, 2007)","DOI":"10.1016\/j.cor.2006.08.005"},{"key":"24_CR28","unstructured":"Gr\u00e9goire, E., Mazure, B., Piette, C.: Local-search extraction of MUSes. Constraints Journal: Special issue on Local Search in Constraint Satisfaction 12(3) (to appear, 2007)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:47:56Z","timestamp":1558262876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540749691","9783540749707"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}