{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:10:29Z","timestamp":1725538229017},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042218"},{"type":"electronic","value":"9783642042225"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04222-5_21","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T16:42:11Z","timestamp":1253119331000},"page":"335-349","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Combination of Decision Procedures for MUS Computation"],"prefix":"10.1007","author":[{"given":"C\u00e9dric","family":"Piette","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youssef","family":"Hamadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lakhdar","family":"Sa\u00efs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-36577-X_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K.L. McMillan","year":"2003","unstructured":"McMillan, K.L., Amla, N.: Automatic abstraction without counterexamples. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 2\u201317. Springer, Heidelberg (2003)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ganai, M., Yang, Z., Ashar, P.: Iterative abstraction using SAT-based BMC with proof analysis. In: Proceedings of the IEEE\/ACM international conference on Computer-aided design (ICCAD 2003), Washington, DC, USA, pp. 416\u2013423 (2003)","DOI":"10.1109\/ICCAD.2003.1257811"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-71209-1_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R.E. Bryant","year":"2007","unstructured":"Bryant, R.E., Kroening, D., Ouaknine, J., Seshia, S.A., Strichman, O., Brady, B.: Deciding bit-vector arithmetic with abstraction. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 358\u2013372. Springer, Heidelberg (2007)"},{"key":"21_CR4","first-page":"518","volume-title":"DAC 2004: Proceedings of the 41st annual conference on Design automation","author":"Y. Oh","year":"2004","unstructured":"Oh, Y., Mneimneh, M.N., Andraus, Z.S., Sakallah, K.A., Markov, I.L.: AMUSE: a minimally-unsatisfiable subformula extractor. In: DAC 2004: Proceedings of the 41st annual conference on Design automation, pp. 518\u2013523. ACM Press, New York (2004)"},{"key":"21_CR5","unstructured":"Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable boolean formula. In: Sixth international conference on theory and applications of satisfiability testing (SAT 2003), Portofino, Italy (2003)"},{"key":"21_CR6","unstructured":"Gregoire, E., Mazure, B., Piette, C.: Extracting MUSes. In: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), Trento (Italy), pp. 387\u2013391 (2006)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-79719-7_27","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"H. Maaren van","year":"2008","unstructured":"van Maaren, H., Wieringa, S.: Finding guaranteed MUSes fast. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 291\u2013304. Springer, Heidelberg (2008)"},{"key":"21_CR8","unstructured":"Hemery, F., Lecoutre, C., Sa\u00efs, L., Boussemart, F.: Extracting MUCs from constraint networks. In: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), Trento (Italy), pp. 113\u2013117 (2006)"},{"key":"21_CR9","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":"21_CR10","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Planes, J.: Algorithms for maximum satisfiability using unsatisfiable cores. In: Design, Automation and Test in Europe (DATE 2008), pp. 408\u2013413 (2008)","DOI":"10.1109\/DATE.2008.4484715"},{"key":"21_CR11","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)"},{"key":"21_CR12","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":"21_CR13","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6103-3_14","volume-title":"Advances in Sensitivity Analysis and Parametric Programming","author":"J.W. Chinneck","year":"1997","unstructured":"Chinneck, J.W.: Feasibility and viability. In: Advances in Sensitivity Analysis and Parametric Programming. International Series in Operations Research and Management Science, vol.\u00a06, Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"21_CR14","unstructured":"de Siqueira, J.L., Puget, J.F.: Explanation-based generalisation of failures. In: Proceedings of the 8th European Conference on Artificial Intelligence, pp. 339\u2013344 (1988)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11814948_4","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"O. Kullmann","year":"2006","unstructured":"Kullmann, O., Lynce, I., Marques Silva, J.P.: Categorisation of clauses in conjunctive normal forms: Minimally unsatisfiable sub-clause-sets and the lean kernel. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 22\u201335. Springer, Heidelberg (2006)"},{"key":"21_CR16","unstructured":"Gregoire, E., Mazure, B., Piette, C.: Boosting a complete technique to find mss and mus thanks to a local search oracle. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), Hyderabad (India), January 2007, vol.\u00a02, pp. 2300\u20132305 (2007)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-46135-3_16","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"F. Hutter","year":"2002","unstructured":"Hutter, F., Tompkins, D.A.D., Hoos, H.H.: Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 233\u2013248. Springer, Heidelberg (2002)"},{"key":"21_CR18","unstructured":"E\u00e9n, N., Sorensson, N.: Minisat home page, http:\/\/www.cs.chalmers.se\/cs\/research\/formalmethods\/minisat"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-31980-1_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K.L. McMillan","year":"2005","unstructured":"McMillan, K.L.: Applications of Craig interpolants in model checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 1\u201312. Springer, Heidelberg (2005)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Gershman, R., Koifman, M., Strichman, O.: Deriving small unsatisfiable cores with dominators. In: Proceedings of Computer-Aided Verification, Seattle (USA), pp. 109\u2013122 (2006)","DOI":"10.1007\/11817963_13"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04222-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T17:17:30Z","timestamp":1558545450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04222-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042218","9783642042225"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04222-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}