{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:00Z","timestamp":1725493440334},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664925"},{"type":"electronic","value":"9783540482420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48242-3_12","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:28:09Z","timestamp":1184588889000},"page":"181-200","source":"Crossref","is-referenced-by-count":18,"title":["Complexity of Terminological Reasoning Revisited"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Lutz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"A. Artale and E. Franconi. A temporal description logic for reasoning about actions and plans. Journal of Artificial Intelligence Research (JAIR), (9), 1998.","key":"12_CR1","DOI":"10.1613\/jair.516"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01051766","volume":"2","author":"F. Baader","year":"1993","unstructured":"F. Baader, H.-J. B\u00fcrckert, B. Nebel, W. Nutt, and G. Smolka. On the expressivity of feature logics with negation, functional uncertainty, and sort equations. Journal of Logic, Language and Information, 2:1\u201318, 1993.","journal-title":"Journal of Logic, Language and Information"},{"unstructured":"F. Baader and P. Hanschke. A scheme for integrating concrete domains into concept languages. In Proceedings of IJCAI-91, pages 452\u2013457, Sydney, Australia, August 24\u201330, 1991. Morgan Kaufmann Publ. Inc., San Mateo, CA, 1991.","key":"12_CR3"},{"key":"12_CR4","series-title":"LNAI","first-page":"67","volume-title":"Processings of PDK\u201991","author":"F. Baader","year":"1991","unstructured":"F. Baader and B. Hollunder.set A terminological knowledge representation system with complete inference algorithms. In Processings of PDK\u201991, volume 567 of LNAI, pages 67\u201386, Kaiserslautern, Germany, July 1\u20133, 1991. Springer-Verlag, Berlin-Heidelberg \u2014 New York, 1991."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF00872105","volume":"4","author":"F. Baader","year":"1994","unstructured":"F. Baader, B. Hollunder, B. Nebel, H.-J. Profitlich, and E. Franconi. An empirical analysis of optimization techniques for terminological representation systems \u2014 or: Making KRIS get a move on. Journal of Applied Intelligence, 4:109\u2013132, 1994.","journal-title":"Journal of Applied Intelligence"},{"key":"12_CR6","volume-title":"Perspectives in Mathematical Logic","author":"E. B\u00f6rger","year":"1997","unstructured":"E. B\u00f6rger, E. Gr\u00e4del, and Y. Gurevich. The Classical Decision Problem. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1997."},{"unstructured":"D. Calvanese. Reasoning with inclusion axioms in description logics: Algorithms and complexity. In Proceedings of ECAI\u201996, Budapest, Hungary, pages 303\u2013307, 1996.","key":"12_CR7"},{"key":"12_CR8","volume-title":"Handbook of Automated Reasoning","author":"D. Calvanese","year":"1999","unstructured":"D. Calvanese, G. De Giacomo, M. Lenzerini, and D. Nardi. Reasoning in expressive description logics. In Handbook of Automated Reasoning. Elsevier Science Publishers (North-Holland), Amsterdam, 1999. To appear."},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2625","volume":"134","author":"F. M. Donini","year":"1997","unstructured":"F. M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. Information and Computation, 134(1):1\u201358, 10 Apr. 1997.","journal-title":"Information and Computation"},{"unstructured":"F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Reasoning in description logics. In G. Brewka, editor, Foundation of Knowledge Representation, pages 191\u2013236. CSLI-Publications, 1996.","key":"12_CR10"},{"key":"12_CR11","series-title":"DFKI Research Report","volume-title":"Subsumption algorithms for concept languages","author":"B. Hollunder","year":"1990","unstructured":"B. Hollunder and W. Nutt. Subsumption algorithms for concept languages. DFKI Research Report RR-90-04, German Research Center for Artificial Intelligence, Kaiserslautern, 1990."},{"key":"12_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of LPAR\u201999","author":"I. Horrocks","year":"1999","unstructured":"I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for expressive description logics. In Proceedings of LPAR\u201999, LNCS, Tbilisi, Georgia, 1999. Springer-Verlag, Berlin \u2014 Heidelberg \u2014 New York, 1999."},{"key":"12_CR13","series-title":"LTCS-Report","volume-title":"On the complexity of terminological reasoning","author":"C. Lutz","year":"1999","unstructured":"C. Lutz. On the complexity of terminological reasoning. LTCS-Report 99-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999."},{"key":"12_CR14","volume-title":"Proceedings of IJCAI-99","author":"C. Lutz","year":"1999","unstructured":"C. Lutz. Reasoning with concrete domains. In Proceedings of IJCAI-99, Stockholm, Sweden, July 31 \u2014 August 6, 1999. Morgan Kaufmann Publ. Inc., San Mateo, CA, 1999."},{"key":"12_CR15","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, 43:235\u2013249, 1990.","journal-title":"Artificial Intelligence"},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/B978-1-4832-0771-1.50018-7","volume-title":"Principles of Semantic Networks-Explorations in the Representation of Knowledge","author":"B. Nebel","year":"1991","unstructured":"B. Nebel. Terminological cycles: Semantics and computational properties. In J. F. Sowa, editor, Principles of Semantic Networks-Explorations in the Representation of Knowledge, chapter 11, pages 331\u2013361. Morgan Kaufmann Publ. Inc., San Mateo, CA, 1991."},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(91)90078-X","volume":"48","author":"M. Schmidt-Schau\u00df","year":"1991","unstructured":"M. Schmidt-Schau\u00df and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48(1):1\u201326, 1991.","journal-title":"Artificial Intelligence"},{"key":"12_CR18","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of CADE-16","author":"S. Tobies","year":"1999","unstructured":"S. Tobies. A PSpace algorithm for graded modal logic. In Proceedings of CADE-16, LNCS, 1999. Springer-Verlag, Berlin \u2014 Heidelberg \u2014 New York, 1999."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48242-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:38:33Z","timestamp":1556667513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48242-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664925","9783540482420"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48242-3_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}