{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:11:29Z","timestamp":1748664689575,"version":"3.41.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319244884"},{"type":"electronic","value":"9783319244891"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-24489-1_17","type":"book-chapter","created":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T07:00:40Z","timestamp":1443510040000},"page":"225-233","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Axiom Pinpointing with EL2MCS"],"prefix":"10.1007","author":[{"given":"M. Fareed","family":"Arif","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Menc\u00eda","sequence":"additional","affiliation":[]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"unstructured":"Arif, M.F., Marques-Silva, J.: Towards efficient axiom pinpointing of $${\\cal EL}^+$$ ontologies. CoRR, abs\/1503.08454 (2015). http:\/\/arxiv.org\/abs\/1503.08454","key":"17_CR1"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1038\/75556","volume":"25","author":"M Ashburner","year":"2000","unstructured":"Ashburner, M., Ball, C.A., Blake, J.A., Botstein, D., Heather Butler, J., Cherry, M., Davis, A.P., Dolinski, K., Dwight, S.S., Eppig, J.T., et al.: Gene ontology: tool for the unification of biology. Nature Genetics 25(1), 25\u201329 (2000)","journal-title":"Nature Genetics"},{"unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $${\\cal EL}$$ envelope. In: IJCAI, pp. 364\u2013369 (2005)","key":"17_CR3"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11814771_25","volume-title":"Automated Reasoning","author":"F Baader","year":"2006","unstructured":"Baader, F., Lutz, C., Suntisrivaraporn, B.: CEL \u2014 a polynomial-time reasoner for life science ontologies. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 287\u2013291. Springer, Heidelberg (2006)"},{"unstructured":"Baader, F., Pe\u00f1aloza, R., Suntisrivaraporn, B.: Pinpointing in the description logic $${\\cal EL}$$ . In: DL (2007)","key":"17_CR5"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-74565-5_7","volume-title":"KI 2007: Advances in Artificial Intelligence","author":"F Baader","year":"2007","unstructured":"Baader, F., Pe\u00f1aloza, R., Suntisrivaraporn, B.: Pinpointing in the description logic $${\\cal EL}^+$$ . In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 52\u201367. Springer, Heidelberg (2007)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/978-3-319-09284-3_5","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"A Belov","year":"2014","unstructured":"Belov, A., Heule, M.J.H., Marques-Silva, J.: MUS extraction using clausal proofs. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 48\u201357. Springer, Heidelberg (2014)"},{"issue":"2","key":"17_CR9","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."},{"unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, vol. 185 (2009)","key":"17_CR10"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","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."},{"doi-asserted-by":"crossref","unstructured":"Bradley, A.R., Manna, Z.: Checking safety by inductive generalization of counterexamples to induction. In: FMCAD, pp. 173\u2013180 (2007)","key":"17_CR12","DOI":"10.1109\/FAMCAD.2007.15"},{"issue":"4","key":"17_CR13","doi-asserted-by":"crossref","first-page":"415","DOI":"10.3233\/FUN-2007-80404","volume":"80","author":"C H\u00e9bert","year":"2007","unstructured":"H\u00e9bert, C., Bretto, A., Cr\u00e9milleux, B.: A data mining formalization to improve hypergraph minimal transversal computation. Fundammenta Informaticae 80(4), 415\u2013433 (2007)","journal-title":"Fundammenta Informaticae"},{"unstructured":"Junker, U.: QuickXplain: preferred explanations and relaxations for over-constrained problems. In: AAAI, pp. 167\u2013172 (2004)","key":"17_CR14"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/11762256_15","volume-title":"The Semantic Web: Research and Applications","author":"A Kalyanpur","year":"2006","unstructured":"Kalyanpur, A., Parsia, B., Sirin, E., Cuenca-Grau, B.: Repairing unsatisfiable concepts in OWL ontologies. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 170\u2013184. Springer, Heidelberg (2006)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-39071-5_21","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"J-M Lagniez","year":"2013","unstructured":"Lagniez, J.-M., Biere, A.: Factoring out assumptions to speed up MUS extraction. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 276\u2013292. Springer, Heidelberg (2013)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11817963_39","volume-title":"Computer Aided Verification","author":"SK Lahiri","year":"2006","unstructured":"Lahiri, S.K., Nieuwenhuis, R., Oliveras, A.: SMT techniques for fast predicate abstraction. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 424\u2013437. Springer, Heidelberg (2006)"},{"issue":"1","key":"17_CR18","doi-asserted-by":"publisher","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"},{"unstructured":"Ludwig, M.: Just: a tool for computing justifications w.r.t. EL ontologies. In: ORE 2014, vol. 1207, pp. 1\u20137 (2014)","key":"17_CR19"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-319-11558-0_8","volume-title":"Logics in Artificial Intelligence","author":"M Ludwig","year":"2014","unstructured":"Ludwig, M., Pe\u00f1aloza, R.: Error-tolerant reasoning in the description logic $${\\cal EL}$$ . In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 107\u2013121. Springer, Heidelberg (2014)"},{"doi-asserted-by":"crossref","unstructured":"Malitsky, Y., O\u2019Sullivan, B., Previti, A., Marques-Silva, J.: Timeout-sensitive portfolio approach to enumerating minimal correction subsets for satisfiability problems. In: ECAI, pp. 1065\u20131066 (2014)","key":"17_CR21","DOI":"10.1007\/978-3-319-07046-9_26"},{"unstructured":"Manthey, N., Pe\u00f1aloza, R.: Exploiting SAT technology for axiom pinpointing. Technical Report LTCS 15\u201305, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, April 2015. https:\/\/ddll.inf.tu-dresden.de\/web\/Techreport3010","key":"17_CR22"},{"unstructured":"Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On computing minimal correction subsets. In: IJCAI (2013)","key":"17_CR23"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere, et al. (eds.) [10], pp. 131\u2013153","key":"17_CR25"},{"unstructured":"Menc\u00eda, C., Previti, A., Marques-Silva, J.: Literal-based MCS extraction. In: IJCAI (2015)","key":"17_CR26"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-39611-3_13","volume-title":"Hardware and Software: Verification and Testing","author":"A Morgado","year":"2013","unstructured":"Morgado, A., Liffiton, M., Marques-Silva, J.: MaxSAT-based MCS enumeration. In: Biere, A., Nahir, A., Vos, T. (eds.) HVC. LNCS, vol. 7857, pp. 86\u2013101. Springer, Heidelberg (2013)"},{"unstructured":"Murakami, K., Uno, T.: Efficient algorithms for dualizing large-scale hypergraphs. CoRR, abs\/1102.3813 (2011)","key":"17_CR28"},{"doi-asserted-by":"crossref","unstructured":"Nadel, A., Ryvchin, V., Strichman, O.: Efficient MUS extraction with resolution. In: FMCAD, pp. 197\u2013200 (2013)","key":"17_CR29","DOI":"10.1109\/FMCAD.2013.6679410"},{"unstructured":"Rector, A.L., Horrocks, I.R.: Experience building a large, re-usable medical ontology using a description logic with transitivity and concept inclusions. In: Workshop on Ontological Engineering, pp. 414\u2013418 (1997)","key":"17_CR30"},{"issue":"1","key":"17_CR31","doi-asserted-by":"publisher","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":"3","key":"17_CR32","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10817-007-9076-z","volume":"39","author":"S Schlobach","year":"2007","unstructured":"Schlobach, S., Huang, Z., Cornet, R., van Harmelen, F.: Debugging incoherent terminologies. J. Autom. Reasoning 39(3), 317\u2013349 (2007)","journal-title":"J. Autom. Reasoning"},{"key":"17_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-02959-2_6","volume-title":"Automated Deduction \u2013 CADE-22","author":"R Sebastiani","year":"2009","unstructured":"Sebastiani, R., Vescovi, M.: Axiom pinpointing in lightweight description logics via horn-SAT encoding and conflict analysis. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 84\u201399. Springer, Heidelberg (2009)"},{"unstructured":"Sebastiani, R., Vescovi, M.: Axiom pinpointing in large $${\\cal EL}^+$$ ontologies via SAT and SMT techniques. Technical Report DISI-15-010, DISI, University of Trento, Italy, April 2015. http:\/\/disi.unitn.it\/rseba\/elsat\/elsat_techrep.pdf","key":"17_CR34"},{"issue":"1","key":"17_CR35","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.jbi.2006.02.013","volume":"40","author":"N Sioutos","year":"2007","unstructured":"Sioutos, N., de Coronado, S., Haber, M.W., Hartel, F.W., Shaiu, W.-L., Wright, L.W.: NCI thesaurus: A semantic model integrating cancer-related clinical and molecular information. Journal of Biomedical Informatics 40(1), 30\u201343 (2007)","journal-title":"Journal of Biomedical Informatics"},{"unstructured":"Spackman, K.A., Campbell, K.E., C\u00f4t\u00e9, R.A.: SNOMED RT: a reference terminology for health care. In: AMIA (1997)","key":"17_CR36"}],"container-title":["Lecture Notes in Computer Science","KI 2015: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24489-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T21:11:32Z","timestamp":1748639492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24489-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319244884","9783319244891"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24489-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}