{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:01:08Z","timestamp":1777125668760,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540797180","type":"print"},{"value":"9783540797197","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79719-7_27","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T04:04:57Z","timestamp":1210046697000},"page":"291-304","source":"Crossref","is-referenced-by-count":13,"title":["Finding Guaranteed MUSes\u00a0Fast"],"prefix":"10.1007","author":[{"given":"Hans","family":"van Maaren","sequence":"first","affiliation":[]},{"given":"Siert","family":"Wieringa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Nam, G.J., Sakallah, K.A., Rutenbar, R.A.: Satisfiability-based layout revisited: Detailed routing of complex FPGAs vis search-based Boolean SAT. In: FPGA, pp. 167\u2013175 (1999)","DOI":"10.1145\/296399.296450"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) ETAPS 1999 and TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-69738-1_6","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"K.L. McMillan","year":"2007","unstructured":"McMillan, K.L.: Interpolants and symbolic model checking. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, pp. 89\u201390. Springer, Heidelberg (2007)"},{"issue":"12-13","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.artint.2006.08.002","volume":"170","author":"J. Rintanen","year":"2006","unstructured":"Rintanen, J., Heljanko, K., Niemel\u00e4, I.: Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell.\u00a0170(12-13), 1031\u20131080 (2006)","journal-title":"Artif. Intell."},{"key":"27_CR5","unstructured":"Zhang, L., Malik, S.: Extracting Small Unsatisfiable Cores from Unsatisfiable Boolean Formula. In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8 (2003)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1145\/996566.996710","volume-title":"DAC","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: Malik, S., Fix, L., Kahng, A.B. (eds.) DAC, pp. 518\u2013523. ACM, New York (2004)"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10601-007-9019-7","volume":"12","author":"\u00c9. Gr\u00e9goire","year":"2007","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., Piette, C.: Local-search extraction of MUSes. Constraints\u00a012(3), 325\u2013344 (2007)","journal-title":"Constraints"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","author":"I. Lynce","year":"2005","unstructured":"Lynce, I., Silva, J.P.M.: On computing minimum unsatisfiable cores. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, Springer, Heidelberg (2005)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Liffiton, M.H., Sakallah, K.A.: On finding all minimally unsatisfiable subformulas [25], 173\u2013186","DOI":"10.1007\/11499107_13"},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"M.H. Liffiton","year":"2008","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. Journal of Automated Reasoning\u00a040(1), 1\u201333 (2008)","journal-title":"Journal of Automated Reasoning"},{"key":"27_CR11","unstructured":"Wieringa, S.: Finding cores using a Brouwer\u2019s fixed point approximation algorithm. Master\u2019s thesis, Delft University of Technology, Faculty of EWI (2007)"},{"issue":"1","key":"27_CR12","first-page":"183","volume":"22","author":"H. Maaren van","year":"1997","unstructured":"van Maaren, H.: Pivoting algorithms based on Boolean vector labeling. Acta Mathematica Vietnamica\u00a022(1), 183\u2013198 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Kullmann, O., Lynce, I., Marques-Silva, J.: Categorisation of clauses in conjunctive normal forms: Minimally unsatisfiable sub-clause-sets and the lean kernel. [24] 22\u201335","DOI":"10.1007\/11814948_4"},{"key":"27_CR14","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.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. [15] 61\u201375","DOI":"10.1007\/11499107_5"},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0305-0548(95)00018-H","volume":"23","author":"M. Tamiz","year":"1996","unstructured":"Tamiz, M., Mardle, S.J., Jones, D.F.: Detecting IIS in infeasible linear programmes using techniques from goal programming. Computers & OR\u00a023(2), 113\u2013119 (1996)","journal-title":"Computers & OR"},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.dam.2006.04.043","volume":"155","author":"P. Galinier","year":"2007","unstructured":"Galinier, P., Hertz, A.: Solution techniques for the large set covering problem. Discrete Applied Mathematics\u00a0155(3), 312\u2013326 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR18","unstructured":"de Siqueira, N.J.L., Puget, J.-F.: Explanation-based generalisation of failures. In: ECAI, pp. 339\u2013344 (1988)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Hanna, Z., Nadel, A.: A scalable algorithm for minimal unsatisfiable core extraction. [24] 36\u201341","DOI":"10.1007\/11814948_5"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1145\/1120725.1120907","volume-title":"ASP-DAC","author":"J. Huang","year":"2005","unstructured":"Huang, J.: MUP: A minimal unsatisfiability prover. In: Tang, T.A. (ed.) ASP-DAC, pp. 432\u2013437. ACM Press, New York (2005)"},{"issue":"9","key":"27_CR21","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1109\/TCAD.2003.816218","volume":"22","author":"F.A. Aloul","year":"2003","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult instances of Boolean satisfiability in the presence of symmetry. IEEE Trans. on CAD of Integrated Circuits and Systems\u00a022(9), 1117\u20131137 (2003)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"key":"27_CR22","first-page":"328","volume-title":"ECAI","author":"A. Darwiche","year":"2004","unstructured":"Darwiche, A.: New advances in compiling CNF into decomposable negation normal form. In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) ECAI, pp. 328\u2013332. IOS Press, Amsterdam (2004)"},{"issue":"12","key":"27_CR23","first-page":"1562","volume":"10","author":"F.A. Aloul","year":"2004","unstructured":"Aloul, F.A., Markov, I.L., Sakallah, K.A.: MINCE: A static global variable-ordering heuristic for SAT search and BDD manipulation. J. UCS\u00a010(12), 1562\u20131596 (2004)","journal-title":"J. UCS"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","year":"2006","unstructured":"Biere, A., Gomes, C.P. (eds.): SAT 2006. LNCS, vol.\u00a04121. Springer, Heidelberg (2006)"},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","year":"2005","unstructured":"Bacchus, F., Walsh, T. (eds.): SAT 2005. LNCS, vol.\u00a03569. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79719-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T23:32:45Z","timestamp":1557531165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79719-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540797180","9783540797197"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79719-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}