{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:32:48Z","timestamp":1725535968083},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029585"},{"type":"electronic","value":"9783642029592"}],"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-02959-2_7","type":"book-chapter","created":{"date-parts":[[2009,7,25]],"date-time":"2009-07-25T01:02:22Z","timestamp":1248483742000},"page":"100-115","source":"Crossref","is-referenced-by-count":4,"title":["Does This Set of Clauses Overlap with at Least One MUS?"],"prefix":"10.1007","author":[{"given":"\u00c9ric","family":"Gr\u00e9goire","sequence":"first","affiliation":[]},{"given":"Bertrand","family":"Mazure","sequence":"additional","affiliation":[]},{"given":"C\u00e9dric","family":"Piette","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Minisat, http:\/\/www.cs.chalmers.se\/Cs\/Research\/FormalMethods\/MiniSat"},{"key":"7_CR2","unstructured":"Biere, A.: Boolforce, http:\/\/fmv.jku.at\/booleforce"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Huang, J.: MUP: A minimal unsatisfiability prover. In: ASP-DAC 2005, Shanghai, China, pp. 432\u2013437 (2005)","DOI":"10.1145\/1120725.1120907"},{"key":"7_CR4","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":"7_CR5","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., Piette, C.: On approaches to explaining infeasibility of sets of Boolean clauses. In: ICTAI 2008, vol.\u00a01, pp. 74\u201383 (2008)","DOI":"10.1109\/ICTAI.2008.39"},{"key":"7_CR6","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":"7_CR7","unstructured":"Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable Boolean formula. In: SAT 2003, Portofino, Italy (2003)"},{"issue":"3","key":"7_CR8","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 Journal\u00a012(3), 325\u2013344 (2007)","journal-title":"Constraints Journal"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Shapley, L.: A value for n-person games. Contributions to the Theory of Games II (Annals of Mathematics Studies 28), 307\u2013317 (1953)","DOI":"10.1515\/9781400881970-018"},{"key":"7_CR10","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.: 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)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"M. Liffiton","year":"2008","unstructured":"Liffiton, M., Sakallah, K.: Algorithms for computing minimal unsatisfiable clause sets. Journal of Automated Reasoning\u00a040(1), 1\u201333 (2008)","journal-title":"Journal of Automated Reasoning"},{"key":"7_CR12","first-page":"2300","volume-title":"IJCAI 2007","author":"\u00c9. Gr\u00e9goire","year":"2007","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., Piette, C.: Boosting a complete technique to find MSS and MUS thanks to a local search oracle. In: IJCAI 2007, vol.\u00a02, pp. 2300\u20132305. AAAI Press, Menlo Park (2007)"},{"key":"7_CR13","unstructured":"Hunter, A., Konieczny, S.: Measuring inconsistency through minimal inconsistent sets. In: KR 2008, Sydney, Australia, pp. 358\u2013366 (2008)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0004-3702(94)00009-P","volume":"74","author":"M. Schaerf","year":"1995","unstructured":"Schaerf, M., Cadoli, M.: Tractable reasoning via approximation. Artificial Intelligence\u00a074, 249\u2013310 (1995)","journal-title":"Artificial Intelligence"},{"key":"7_CR15","unstructured":"Dalal, M.: Anytime families of tractable propositional reasoners. In: AI\/MATH 1996, pp. 42\u201345 (1996)"},{"key":"7_CR16","unstructured":"Dalal, M.: Semantics of an anytime family of reasponers. In: ECAI 1996, pp. 360\u2013364 (1996)"},{"key":"7_CR17","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-28645-5_2","volume-title":"Advances in Artificial Intelligence \u2013 SBIA 2004","author":"M. Finger","year":"2004","unstructured":"Finger, M.: Towards polynomial approximations of full propositional logic. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS (LNAI), vol.\u00a03171, pp. 11\u201320. Springer, Heidelberg (2004)"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.tcs.2006.01.007","volume":"355","author":"M. Finger","year":"2006","unstructured":"Finger, M., Wassermann, R.: The universe of propositional approximations. Theoretical Computer Science\u00a0355(2), 153\u2013166 (2006)","journal-title":"Theoretical Computer Science"},{"key":"7_CR19","first-page":"193","volume-title":"TARK 2001","author":"F. Koriche","year":"2001","unstructured":"Koriche, F., Sallantin, J.: A logical toolbox for knowledge approximation. In: TARK 2001, pp. 193\u2013205. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.3166\/jancl.12.239-258","volume":"12","author":"F. Koriche","year":"2002","unstructured":"Koriche, F.: Approximate coherence-based reasoning. Journal of Applied Non-Classical Logics\u00a012(2), 239\u2013258 (2002)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(00)00262-6","volume":"107","author":"O. Kullmann","year":"2000","unstructured":"Kullmann, O.: Investigations on autark assignments. Discrete Applied Mathematics\u00a0107, 99\u2013137 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-79719-7_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"M. Liffiton","year":"2008","unstructured":"Liffiton, M., Sakallah, K.: Searching for autarkies to trim unsatisfiable clause sets. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 182\u2013195. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-22"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02959-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T13:51:57Z","timestamp":1558446717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02959-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029585","9783642029592"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02959-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}