{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:10Z","timestamp":1725484390934},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441854"},{"type":"electronic","value":"9783540457510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45751-8_7","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T02:42:07Z","timestamp":1179283327000},"page":"99-113","source":"Crossref","is-referenced-by-count":6,"title":["On the Problem of Computing Small Representations of Least Common Subsumers"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anni-Yasmin","family":"Turhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"7_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BFb0095434","volume-title":"Proc. of KI-98","author":"F. Baader","year":"1998","unstructured":"F. Baader and R. K\u00fcsters. Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. In O. Herzog and A. G\u00fcnter, eds., Proc. of KI-98, volume 1504 of Lecture Notes in Computer Science, p. 129\u2013140, Bremen, Germany, 1998. Springer-Verlag."},{"key":"7_CR2","series-title":"LTCS-Report LTCS-98-09","first-page":"96","volume-title":"Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI-99)","author":"F. Baader","year":"1999","unstructured":"F. Baader, R. K\u00fcsters, and R. Molitor. Computing least common subsumer in description logics with existential restrictions. In T. Dean, ed., Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI-99), p. 96\u2013101, Stockholm, Sweden, 1999. Morgan Kaufmann, Los Altos. An extended version appeared as LTCS-Report LTCS-98-09, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1998. See http:\/\/www-lti.informatik.rwth-aachen.de\/Forschung\/Papers.html ."},{"key":"7_CR3","unstructured":"F. Baader, R. K\u00fcsters, and R. Molitor. Rewriting concepts using terminologies. In A.G. Cohn, F. Giunchiglia, and B. Selman, eds., Proc. of the 7th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR-00), p. 297\u2013308, San Francisco, CA, 2000. Morgan Kaufmann Publishers."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"F. Baader and R. Molitor. Building and structuring description logic knowledge bases using least common subsumers and concept analysis. In B. Ganter and G. Mineau, eds., Proc. of ICCS-00, volume 1867 of Lecture Notes in Artificial Intelligence, p. 290\u2013303. Springer-Verlag, 2000.","DOI":"10.1007\/10722280_20"},{"key":"7_CR5","unstructured":"F. Baader and U. Sattler. Knowledge representation in process engineering. In Proc. ofDL-96, 1996."},{"key":"7_CR6","unstructured":"F. Baader and A.-Y. Turhan. TBoxes do not yield a compact representation of the least common subsumer. In Proc. of DL-2001, 2001."},{"key":"7_CR7","first-page":"109","volume":"4","author":"F. Baader","year":"1994","unstructured":"F. Baader, E. Franconi, B. Hollunder, B. Nebel, and H.-J. Profitlich. An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on. Applied Artificial Intelligence. Special Issue on Knowledge Base Management, 4:109\u2013132, 1994.","journal-title":"Applied Artificial Intelligence. Special Issue on Knowledge Base Management"},{"key":"7_CR8","unstructured":"I. Horrocks. Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester, 1997."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"R. K\u00fcsters and R. Molitor. Approximating most specific concepts in description logics with existential restrictions. In T. Eiter, F. Baader, G. Brewka, eds., Proc. of the 24th German Annual Conf. on Artificial Intelligence (KI\u201901), number 2174 in Lecture Notes In Artificial Intelligence, p. 33\u201347. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-45422-5_4"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0004-3702(90)90087-G","volume":"43","author":"B. Nebel","year":"1990","unstructured":"B. Nebel. Terminological reasoning is inherently intractable. Artificial Intelligence Journal, 43:235\u2013249, 1990.","journal-title":"Artificial Intelligence Journal"},{"key":"7_CR11","unstructured":"U. Sattler. Terminological knowledge representation systems in a process engineering application. PhD thesis, RWTH Aachen, 1998."},{"key":"7_CR12","unstructured":"A.-Y. Turhan and R. Molitor. Using lazy unfolding for the computation of least common subsumers. In Proc. of DL-2001, 2001."}],"container-title":["Lecture Notes in Computer Science","KI 2002: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45751-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:54:40Z","timestamp":1556412880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45751-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441854","9783540457510"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45751-8_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}