{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:10:14Z","timestamp":1781014214208,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540497875","type":"print"},{"value":"9783540497882","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11941439_89","type":"book-chapter","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T09:53:05Z","timestamp":1163757185000},"page":"847-856","source":"Crossref","is-referenced-by-count":16,"title":["Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Jianmin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sikun","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengyu","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3-4","key":"89_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018999721141","volume":"22","author":"L.S. Mazure","year":"1998","unstructured":"Mazure, L.S., Gregoire, E.: Boosting complete techniques thanks to local search methods. Annals of Mathematics and Artificial Intelligence\u00a022(3-4), 319\u2013331 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"89_CR2","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":"89_CR3","doi-asserted-by":"crossref","unstructured":"Nam, G.J., Sakallah, K.A., Rutenbar, R.A.: Satisfiability-based layout revisited: Detailed routing of complex FPGAs via search-based Boolean SAT. In: International Symposium on Field Programmable Gate Arrays (FPGA 1999) (1999)","DOI":"10.1145\/296399.296450"},{"key":"89_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","volume":"37","author":"C.H. Papadimitriou","year":"1988","unstructured":"Papadimitriou, C.H., Wolfe, D.: The Complexity of Facets Resolved. Journal of Computer and System Sciences\u00a037, 2\u201313 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"89_CR5","doi-asserted-by":"crossref","unstructured":"Bruni, R., Sassano, A.: Restoring Satisfiability or Maintaining Unsatisfiability by Finding Small Unsatisfiable Subformulae. In: Proceedings of the Workshop on Theory and Application of Satisfiability Testing (SAT 2001) (2001)","DOI":"10.1016\/S1571-0653(04)00320-8"},{"key":"89_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_22","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":"89_CR7","doi-asserted-by":"crossref","unstructured":"Oh, Y., Mneimneh, M.N., Andraus, Z.S., Sakallah, K.A., Markov, I.L.: AMUSE: a minimally-unsatisfiable subformula extractor. In: Proceedings of the 41st Design Automation Conference (DAC 2004) (2004)","DOI":"10.1145\/996566.996710"},{"key":"89_CR8","doi-asserted-by":"crossref","unstructured":"Huang, J.: MUP: A minimal unsatisfiability prover. In: Proceedings of the Tenth Asia and South Pacific Design Automation Conference (ASP-DAC 2005) (2005)","DOI":"10.1145\/1120725.1120907"},{"key":"89_CR9","unstructured":"Lynce, I., Marques-Silva, J.P.: On computing minimum unsatisfiable cores. In: Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, SAT\u201904 (2004)"},{"key":"89_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_13","volume-title":"Theory and Applications of Satisfiability Testing","author":"M.H. Liffiton","year":"2005","unstructured":"Liffiton, M.H., Sakallah, K.A.: On finding all minimally unsatisfiable subformulas. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, Springer, Heidelberg (2005)"},{"key":"89_CR11","doi-asserted-by":"crossref","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization. In: Proceedings of the Seventh International Symposium on Practical Aspects of Declarative Languages (PADL 2005) (2005)","DOI":"10.1007\/978-3-540-30557-6_14"},{"key":"89_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2005)"},{"key":"89_CR13","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems, 2nd edn. University of Michigan Press, Ann Arbor, MIT Press, Cambridge (1975)","edition":"2"},{"key":"89_CR14","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Proceedings of the First European Conference on Artificial Life (1991)"},{"key":"89_CR15","unstructured":"SAT benchmarks from Automotive Product Configuration, \n                      \n                        http:\/\/www-sr.informatik.uni-tuebingen.de\/~sinz\/DC\/"}],"container-title":["Lecture Notes in Computer Science","AI 2006: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11941439_89.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:51:41Z","timestamp":1619509901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11941439_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540497875","9783540497882"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11941439_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}