{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T05:22:01Z","timestamp":1757568121736},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409696"},{"type":"electronic","value":"9783319409702"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40970-2_21","type":"book-chapter","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T07:14:55Z","timestamp":1465542895000},"page":"342-360","source":"Crossref","is-referenced-by-count":13,"title":["MCS Extraction with Sublinear Oracle Queries"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Menc\u00eda","sequence":"first","affiliation":[]},{"given":"Alexey","family":"Ignatiev","sequence":"additional","affiliation":[]},{"given":"Alessandro","family":"Previti","sequence":"additional","affiliation":[]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,11]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Bacchus, F., Davies, J., Tsimpoukelli, M., Katsirelos, G.: Relaxation search: a simple way of managing optional clauses. In: AAAI, pp. 835\u2013841 (2014)","DOI":"10.1609\/aaai.v28i1.8849"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-319-21668-3_5","volume-title":"Computer Aided Verification","author":"F Bacchus","year":"2015","unstructured":"Bacchus, F., Katsirelos, G.: Using minimal correction sets to more efficiently compute minimal unsatisfiable sets. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9207, pp. 70\u201386. Springer, Heidelberg (2015)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 2004. LNCS, vol. 3350, pp. 174\u2013186. Springer, Heidelberg (2005)"},{"key":"21_CR4","unstructured":"Bakker, R.R., Dikker, F., Tempelman, F., Wognum, P.M.: Diagnosing and solving over-determined constraint satisfaction problems. In: IJCAI, pp. 276\u2013281 (1993)"},{"issue":"2","key":"21_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.3233\/AIC-2012-0523","volume":"25","author":"A Belov","year":"2012","unstructured":"Belov, A., Lynce, I., Marques-Silva, J.: Towards efficient MUS extraction. AI Commun. 25(2), 97\u2013116 (2012)","journal-title":"AI Commun."},{"issue":"1","key":"21_CR6","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."},{"volume-title":"Handbook of Satisfiability","year":"2009","key":"21_CR7","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press, Amsterdam (2009)"},{"issue":"1","key":"21_CR8","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. Theor. Artif. Intell. 15(1), 25\u201346 (2003)","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"3\u20134","key":"21_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1018939502485","volume":"22","author":"C Cayrol","year":"1998","unstructured":"Cayrol, C., Lagasquie-Schiex, M.-C., Schiex, T.: Nonmonotonic reasoning: from complexity to algorithms. Ann. Math. Artif. Intell. 22(3\u20134), 207\u2013236 (1998)","journal-title":"Ann. Math. Artif. Intell."},{"key":"21_CR10","series-title":"International Series in Operations Research & Management Science","volume-title":"Feasibility Infesasibility in Optimization: Algorithms and Computational Methods","author":"JW Chinneck","year":"2008","unstructured":"Chinneck, J.W.: Feasibility Infesasibility in Optimization: Algorithms and Computational Methods. International Series in Operations Research & Management Science, vol. 118. Springer, Heidelberg (2008)"},{"issue":"2","key":"21_CR11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1287\/ijoc.3.2.157","volume":"3","author":"JW Chinneck","year":"1991","unstructured":"Chinneck, J.W., Dravnieks, E.W.: Locating minimal infeasible constraint sets in linear programs. INFORMS J. Comput. 3(2), 157\u2013168 (1991)","journal-title":"INFORMS J. Comput."},{"key":"21_CR12","unstructured":"de Siqueira J.L.N., Puget, J.: Explanation-based generalisation of failures. In: ECAI, pp. 339\u2013344 (1988)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/github.com\/niklasso\/minisat"},{"issue":"1","key":"21_CR14","first-page":"53","volume":"26","author":"A Felfernig","year":"2012","unstructured":"Felfernig, A., Schubert, M., Zehentner, C.: An efficient diagnosis algorithm for inconsistent constraint sets. AI EDAM 26(1), 53\u201362 (2012)","journal-title":"AI EDAM"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/978-3-642-23786-7_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"T Feydy","year":"2011","unstructured":"Feydy, T., Somogyi, Z., Stuckey, P.J.: Half reification and flattening. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 286\u2013301. Springer, Heidelberg (2011)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Lagniez, J., Mazure, B.: An experimentally efficient method for (MSS, coMSS) partitioning. In: AAAI, pp. 2666\u20132673 (2014)","DOI":"10.1609\/aaai.v28i1.9118"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., Piette, C.: On approaches to explaining infeasibility of sets of boolean clauses. In: ICTAI, pp. 74\u201383 (2008)","DOI":"10.1109\/ICTAI.2008.39"},{"key":"21_CR18","unstructured":"Hemery, F., Lecoutre, C., Sais, L., Boussemart, F.: Extracting MUCs from constraint networks. In: ECAI, pp. 113\u2013117 (2006)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Previti, A., Liffiton, M.H., Marques-Silva, J.: Smallest MUS extraction with minimal hitting set dualization. In: CP, pp. 173\u2013182 (2015)","DOI":"10.1007\/978-3-319-23219-5_13"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-61479-6_16","volume-title":"Over-Constrained Systems","author":"M Jampel","year":"1996","unstructured":"Jampel, M.: A brief overview of over-constrained systems. In: Jampel, M., Maher, M.J., Freuder, E.C. (eds.) CP-WS 1995. LNCS, vol. 1106, pp. 1\u201322. Springer, Heidelberg (1996)"},{"key":"21_CR21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.artint.2016.01.002","volume":"233","author":"M Janota","year":"2016","unstructured":"Janota, M., Marques-Silva, J.: On the query complexity of selecting minimal sets for monotone predicates. Artif. Intell. 233, 73\u201383 (2016)","journal-title":"Artif. Intell."},{"key":"21_CR22","unstructured":"Junker, U.: QuickXplain: Preferred explanations and relaxations for over-constrained problems. In: AAAI, pp. 167\u2013172 (2004)"},{"issue":"3\u20134","key":"21_CR23","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0020-0190(00)00023-5","volume":"74","author":"DJ Kavvadias","year":"2000","unstructured":"Kavvadias, D.J., Sideri, M., Stavropoulos, E.C.: Generating all maximal models of a boolean expression. Inf. Process. Lett. 74(3\u20134), 157\u2013162 (2000)","journal-title":"Inf. Process. Lett."},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-319-24318-4_11","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"O Kullmann","year":"2015","unstructured":"Kullmann, O., Marques-Silva, J.: Computing maximal autarkies with few and simple oracle queries. In: Heule, M. (ed.) SAT 2015. LNCS, vol. 9340, pp. 138\u2013155. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-24318-4_11"},{"issue":"1","key":"21_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"MH Liffiton","year":"2008","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reasoning 40(1), 1\u201333 (2008)","journal-title":"J. Autom. Reasoning"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Mangal, R., Zhang, X., Kamath, A., Nori, A.V., Naik, M.: Scaling relational inference using proofs and refutations. In: AAAI (2016)","DOI":"10.1609\/aaai.v30i1.10426"},{"key":"21_CR27","unstructured":"Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On computing minimal correction subsets. In: IJCAI, pp. 615\u2013622 (2013)"},{"key":"21_CR28","unstructured":"Marques-Silva, J., Janota, M.: Computing minimal sets on propositional formulae I: problems & reductions. CoRR, abs\/1402.3011 (2014)"},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1007\/978-3-642-39799-8_39","volume-title":"Computer Aided Verification","author":"J Marques-Silva","year":"2013","unstructured":"Marques-Silva, J., Janota, M., Belov, A.: Minimal sets over monotone predicates in boolean formulae. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 592\u2013607. Springer, Heidelberg (2013)"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/978-3-319-09284-3_6","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"J Marques-Silva","year":"2014","unstructured":"Marques-Silva, J., Previti, A.: On computing preferred MUSes and MCSes. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 58\u201374. Springer, Heidelberg (2014)"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Menc\u00eda, C., Marques-Silva, J.: Efficient relaxations of over-constrained CSPs. In: ICTAI, pp. 725\u2013732 (2014)","DOI":"10.1109\/ICTAI.2014.113"},{"key":"21_CR32","unstructured":"Menc\u00eda, C., Previti, A., Marques-Silva, J.: Literal-based MCS extraction. In: IJCAI, pp. 1973\u20131979 (2015)"},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"N\u00f6hrer, A., Biere, A., Egyed, A.: Managing SAT inconsistencies with HUMUS. In: VaMoS, pp. 83\u201391 (2012)","DOI":"10.1145\/2110147.2110157"},{"key":"21_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 445\u2013459. Springer, Heidelberg (2005)"},{"key":"21_CR35","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Boston (1994)"},{"issue":"1","key":"21_CR36","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57\u201395 (1987)","journal-title":"Artif. Intell."},{"issue":"4","key":"21_CR37","doi-asserted-by":"crossref","first-page":"395","DOI":"10.3233\/AIC-130575","volume":"26","author":"ED Rosa","year":"2013","unstructured":"Rosa, E.D., Giunchiglia, E.: Combining approaches for solving satisfiability problems with qualitative preferences. AI Commun. 26(4), 395\u2013408 (2013)","journal-title":"AI Commun."},{"issue":"4","key":"21_CR38","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10601-010-9095-y","volume":"15","author":"ED Rosa","year":"2010","unstructured":"Rosa, E.D., Giunchiglia, E., Maratea, M.: Solving satisfiability problems with preferences. Constraints 15(4), 485\u2013515 (2010)","journal-title":"Constraints"},{"key":"21_CR39","unstructured":"Walter, R., Felfernig, A., Kuchlin, W.: Inverse QUICKXPLAIN vs. MAXSAT - a comparison in theory and practice. In: Configuration Workshop, volume CEUR 1453, pp. 97\u2013104 (2015)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40970-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T08:15:41Z","timestamp":1656663341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40970-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409696","9783319409702"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40970-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}