{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T08:10:10Z","timestamp":1741162210017,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208942"},{"type":"electronic","value":"9783642208959"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20895-9_30","type":"book-chapter","created":{"date-parts":[[2011,4,25]],"date-time":"2011-04-25T04:40:34Z","timestamp":1303706434000},"page":"266-271","source":"Crossref","is-referenced-by-count":4,"title":["cmMUS: A Tool for Circumscription-Based MUS Membership Testing"],"prefix":"10.1007","author":[{"given":"Mikol\u00e1\u0161","family":"Janota","sequence":"first","affiliation":[]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","first-page":"422","volume-title":"KR","author":"C. Drescher","year":"2008","unstructured":"Drescher, C., Gebser, M., Grote, T., Kaufmann, B., K\u00f6nig, A., Ostrowski, M., Schaub, T.: Conflict-driven disjunctive answer set solving. In: Brewka, G., Lang, J. (eds.) KR, pp. 422\u2013432. AAAI Press, Menlo Park (2008)"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","volume":"114","author":"T. Eiter","year":"1993","unstructured":"Eiter, T., Gottlob, G.: Propositional circumscription and extended closed-world reasoning are ${\\pi}^{\\rm P}_{2}$ -complete. Theor. Comput. Sci.\u00a0114(2), 231\u2013245 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence\u00a015, 289\u2013323 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing\u00a09(3), 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"30_CR5","volume-title":"Handbook of Knowledge Representation","author":"M. Gelfond","year":"2008","unstructured":"Gelfond, M.: Answer Sets. In: Handbook of Knowledge Representation. Elsevier, Amsterdam (2008)"},{"key":"30_CR6","unstructured":"Giunchiglia, E., Marin, P., Narizzano, M.: An effective preprocessor for QBF pre-reasoning. In: 2nd International Workshop on Quantification in Constraint Programming, QiCP (2008)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-02959-2_7","volume-title":"Automated Deduction \u2013 CADE-22","author":"\u00c9. Gr\u00e9goire","year":"2009","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., Piette, C.: Does this set of clauses overlap with at least one MUS? In: Schmidt, R.A. (ed.) CADE 2009. LNCS, vol.\u00a05663, pp. 100\u2013115. Springer, Heidelberg (2009)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Janhunen, T., Oikarinen, E.: Capturing parallel circumscription with disjunctive logic programs. In: European Conf. on Logics in Artif. Intell., pp. 134\u2013146 (2004)","DOI":"10.1007\/978-3-540-30227-8_14"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-15675-5_18","volume-title":"Logics in Artificial Intelligence","author":"M. Janota","year":"2010","unstructured":"Janota, M., Grigore, R., Marques-Silva, J.: Counterexample guided abstraction refinement algorithm for propositional circumscription. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS, vol.\u00a06341, pp. 195\u2013207. Springer, Heidelberg (2010)"},{"key":"30_CR10","unstructured":"Janota, M., Marques-Silva, J.: Models and algorithms for MUS membership testing. Tech. Rep. TR-07\/2011, INESC-ID (January 2011)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Kullmann, O.: An application of matroid theory to the SAT problem. In: IEEE Conference on Computational Complexity, pp. 116\u2013124 (2000)","DOI":"10.1109\/CCC.2000.856741"},{"key":"30_CR12","unstructured":"Kullmann, O.: Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. In: Electronic Colloquium on Computational Complexity (ECCC), vol. \u00a014(055) (2007)"},{"issue":"1","key":"30_CR13","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. J. Autom. Reasoning\u00a040(1), 1\u201333 (2008)","journal-title":"J. Autom. Reasoning"},{"issue":"1-2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription - a form of non-monotonic reasoning. Artif. Intell.\u00a013(1-2), 27\u201339 (1980)","journal-title":"Artif. Intell."},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: IEEE Conference Record of 13th Annual Symposium on Switching and Automata Theory (October 1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a03709, pp. 445\u2013459. Springer, Heidelberg (2005)"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-540-85958-1_29","volume-title":"Principles and Practice of Constraint Programming","author":"A. Papadopoulos","year":"2008","unstructured":"Papadopoulos, A., O\u2019Sullivan, B.: Relaxations for compiled over-constrained problems. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 433\u2013447. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20895-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T07:41:21Z","timestamp":1741160481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20895-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208942","9783642208959"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20895-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}