{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T21:06:47Z","timestamp":1772831207978,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642029585","type":"print"},{"value":"9783642029592","type":"electronic"}],"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_6","type":"book-chapter","created":{"date-parts":[[2009,7,25]],"date-time":"2009-07-25T05:02:22Z","timestamp":1248498142000},"page":"84-99","source":"Crossref","is-referenced-by-count":19,"title":["Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Sebastiani","sequence":"first","affiliation":[]},{"given":"Michele","family":"Vescovi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","first-page":"364","volume-title":"Proc. of IJCAI 2005","author":"F. Baader","year":"2005","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $\\mathcal{EL}$ Envelope. In: Proc. of IJCAI 2005, pp. 364\u2013369. Morgan-Kaufmann Publishers, San Francisco (2005)"},{"key":"6_CR2","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $\\mathcal{EL}$ Envelope Further. In: Proc. of OWLED 2008, DC Workshop (2008)"},{"key":"6_CR3","unstructured":"Baader, F., Lutz, C., Suntisrivaraporn, B.: Efficient Reasoning in $\\mathcal{EL}^+$ . In: Proc. of DL 2006. CEUR-WS, vol.\u00a0189 (2006)"},{"key":"6_CR4","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-73099-6_4","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"F. Baader","year":"2007","unstructured":"Baader, F., Penaloza, R.: Axiom pinpointing in general tableaux. In: Olivetti, N. (ed.) TABLEAUX 2007. LNCS (LNAI), vol.\u00a04548, pp. 11\u201327. Springer, Heidelberg (2007)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","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 $\\mathcal{EL}^+$ . In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS, vol.\u00a04667, pp. 52\u201367. Springer, Heidelberg (2007)"},{"key":"6_CR6","unstructured":"Baader, F., Suntisrivaraporn, B.: Debugging SNOMED CT Using Axiom Pinpointing in the Description Logic $\\mathcal{EL}^+$ . In: Proc. of KR-MED 2008: Representing and Sharing Knowledge Using SNOMED. CEUR-WS, vol.\u00a0410 (2008)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"T.\u00a0G.\u00a0O. Consortium. Gene ontology: Tool for the unification of biology. Nature Genetics 25, 25\u201329 (2000)","DOI":"10.1038\/75556"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"6_CR9","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":"S.K. 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.\u00a04144, pp. 424\u2013437. Springer, Heidelberg (2006)"},{"key":"6_CR10","unstructured":"Lynce, I., Silva, J.P.M.: On Computing Minimum Unsatisfiable Cores. In: Proc. of SAT 2004 (2004), http:\/\/www.satisfiability.org\/SAT04\/programme\/110.pdf"},{"key":"6_CR11","first-page":"530","volume-title":"Proc. of DAC 2001","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. of DAC 2001, pp. 530\u2013535. ACM, New York (2001)"},{"key":"6_CR12","volume-title":"Proc. of the Workshop on Ontological Engineering, AAAI 1997","author":"A. Rector","year":"1997","unstructured":"Rector, A., Horrocks, I.: Experience Building a Large, Re-usable Medical Ontology using a Description Logic with Transitivity and Concept Inclusions. In: Proc. of the Workshop on Ontological Engineering, AAAI 1997. AAAI Press, Menlo Park (1997)"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.3233\/SAT190034","volume":"3","author":"R. Sebastiani","year":"2007","unstructured":"Sebastiani, R.: Lazy Satisfiability Modulo Theories. Journal on Satisfiability, Boolean Modeling and Computation, JSAT\u00a03, 141\u2013224 (2007)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation, JSAT"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Sebastiani, R., Vescovi, M.: Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis. Technical Report DISI-09-014, University of Trento (2009), http:\/\/disi.unitn.it\/~rseba\/elsat\/","DOI":"10.1007\/978-3-642-02959-2_6"},{"issue":"1","key":"6_CR15","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., Wright, L.W.: NCI Thesaurus: A semantic model integrating cancer-related clinical and molecular information. Journal of Biomedical Informatics\u00a040(1), 30\u201343 (2007)","journal-title":"Journal of Biomedical Informatics"},{"key":"6_CR16","unstructured":"Spackman, K.A.: Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED RT. Journal of American Medical Informatics Association (Fall Symposium Special Issue) (2000)"},{"key":"6_CR17","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient Conflict Driven Learning in Boolean Satisfiability Solver. In: Proc. of ICCAD, pp. 279\u2013285 (2001)"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T00:02:57Z","timestamp":1590019377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02959-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029585","9783642029592"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02959-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}