{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:00:50Z","timestamp":1774591250597,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540429579","type":"print"},{"value":"9783540456537","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45653-8_15","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:57:30Z","timestamp":1181365050000},"page":"217-232","source":"Crossref","is-referenced-by-count":31,"title":["Unification in a Description Logic with Transitive Closure of Roles"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"K\u00fcsters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0049320","volume-title":"Proc. 1993 Conf. Computer Science Logic (CSL\u201993)","author":"A. Aiken","year":"1993","unstructured":"A. Aiken, D. Kozen, M. Vardi, and E. Wimmers. The Complexity of Set Constraints. In Proc. 1993 Conf. Computer Science Logic (CSL\u201993), volume 832 of LNCS, pages 1\u201317. European Association Computer Science Logic, Springer, 1993."},{"key":"15_CR2","unstructured":"F. Baader. Augmenting Concept Languages by Transitive Closure of Rules: An Alternativ to Terminological Cycles. In Proc. of the 12th International Joint Conference on Artificial Intelligence (IJCAI\u201991), pages 446\u2013451, 1991. Morgan Kaufmann Publishers."},{"issue":"2\u20134","key":"15_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02127747","volume":"18","author":"F. Baader","year":"1996","unstructured":"F. Baader. Using Automata Theory for Characterizing the Semantics of Terminological Cycles. Annals of Mathematics and Artificial Intelligence, 18(2\u20134):175\u2013219, 1996.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"15_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BFb0013522","volume-title":"Proc. of the First International Workshop on Processing Declarative Knowledge","author":"F. Baader","year":"1991","unstructured":"F. Baader and B. Hollunder. A Terminological Knowledge Representation System with Complete Inference Algorithms. In Proc. of the First International Workshop on Processing Declarative Knowledge, volume 572 of LNCS, pages 67\u201385, 1991. Springer-Verlag."},{"key":"15_CR5","unstructured":"F. Baader and R. K\u00fcsters. Matching in Description Logics with Existential Restrictions. In Proc. of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000), pages 261\u2013272, 2000. Morgan Kaufmann Publishers."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"F. Baader and R. K\u00fcsters. Unification in a Description Logic with Transitive Closure of Roles. LTCS-Report 01-05, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2001. See http:\/\/www-lti.informatik.rwth-aachen.de\/Forschung\/Reports.html .","DOI":"10.25368\/2022.115"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1093\/logcom\/9.3.411","volume":"9","author":"F. Baader","year":"1999","unstructured":"F. Baader, R. K\u00fcsters, A. Borgida, and D. McGuinness. Matching in Description Logics. Journal of Logic and Computation, 9(3):411\u2013447, 1999.","journal-title":"Journal of Logic and Computation"},{"key":"15_CR8","first-page":"331","volume":"31","author":"F. Baader","year":"1998","unstructured":"F. Baader and P. Narendran. Unification of Concept Terms in Description Logics. In Proc. of the 13th European Conference on Artificial Intelligence (ECAI-98), pages 331\u2013335, 1998. John Wiley & Sons Ltd. An extended version has appeared in J. Symbolic Computation 31:277-305, 2001.","journal-title":"J. Symbolic Computation"},{"key":"15_CR9","unstructured":"A. Borgida and D. L. McGuinness. Asking Queries about Frames. In Proc. of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR\u201996), pages 340\u2013349, 1996. Morgan Kaufmann Publishers."},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0364-0213(85)80014-8","volume":"9","author":"R. J. Brachman","year":"1985","unstructured":"R. J. Brachman and J. G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171\u2013216, 1985.","journal-title":"Cognitive Science"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(94)00176-J","volume":"145","author":"E. Leiss","year":"1995","unstructured":"E. Leiss. Implicit language equations: Existence and uniqueness of solutions. Theoretical Computer Science A, 145:71\u201393, 1995.","journal-title":"Theoretical Computer Science A"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"E. Leiss. Language Equations. Springer-Verlag, 1999.","DOI":"10.1007\/978-1-4612-2156-2"},{"key":"15_CR13","unstructured":"D.L. McGuinness. Explaining Reasoning in Description Logics. PhD thesis, Department of Computer Science, Rutgers University, October, 1996."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"H. Seidl. Haskell overloading is DEXPTIME-complete. Information Processing Letters, 52(2), 1994.","DOI":"10.1016\/0020-0190(94)00130-8"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133\u2013191. Elsevier Science Publishers, Amsterdam, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/126537.126543","volume":"22","author":"S. Yu","year":"1991","unstructured":"S. Yu and Q. Zhuang. On the State Complexity of Intersection of Regular Languages. ACM SIGACT News, 22(3):52\u201354, 1991.","journal-title":"ACM SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45653-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T09:44:10Z","timestamp":1683884650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45653-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429579","9783540456537"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45653-8_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}