{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:02:53Z","timestamp":1774591373649,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540664925","type":"print"},{"value":"9783540482420","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48242-3_11","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:28:09Z","timestamp":1184588889000},"page":"161-180","source":"Crossref","is-referenced-by-count":160,"title":["Practical Reasoning for Expressive Description Logics"],"prefix":"10.1007","author":[{"given":"Ian","family":"Horrocks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrike","family":"Sattler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Tobies","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"F. Baader. Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In Proc. of IJCAI-91, 1991."},{"issue":"1\u20132","key":"11_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0004-3702(96)00010-0","volume":"88","author":"F. Baader","year":"1996","unstructured":"F. Baader, M. Buchheit, and B. Hollunder. Cardinality restrictions on concepts. Artificial Intelligence, 88(1\u20132):195\u2013213, 1996.","journal-title":"Artificial Intelligence"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01051766","volume":"2","author":"B.B.N.+.9.3._.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. J. of Logic, Language and Information, 2:1\u201318, 1993.","journal-title":"J. of Logic, Language and Information"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"R. Berger. The undecidability of the dominoe problem. Mem. Amer. Math. Soc., 66, 1966.","DOI":"10.1090\/memo\/0066"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"F. Baader and U. Sattler. Number restrictions on complex roles in description logics. In Proc. of KR-96, pages 328\u2013339, 1996.","DOI":"10.25368\/2022.70"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. of the 17th ACM SIGAGT SIGMOD SIGART Sym. on Principles of Database Systems (PODS\u201998), pages 149\u2013158, 1998.","DOI":"10.1145\/275487.275504"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"D. Calvanese, G. De Giacomo, M. Lenzerini, D. Nardi, and R. Rosati. Source integration in data warehousing. In Proc. of DEXA-98. IEEE Computer Society Press, 1998.","DOI":"10.1109\/DEXA.1998.707402"},{"key":"11_CR8","unstructured":"D. Calvanese, G. De Giacomo, and M. Lenzerini. Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In Proc. of the 16th Int. Joint. Conf. on Artificial Intelligence (IJCAI\u201999), 1999."},{"key":"11_CR9","unstructured":"D. Calvanese, G. De Giacomo, and R. Rosati. A note on encoding inverse roles and functional restrictions in ALC knowledge bases. In Proc. of DL\u2019 98, 1998."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Diego Calvanese, Maurizio Lenzerini, and Daniele Nardi. A unified framework for class based representation formalisms. Proc. of KR-94, pages 109\u2013120. M. Kaufmann, Los Altos.","DOI":"10.1016\/B978-1-4832-1452-8.50107-X"},{"key":"11_CR11","unstructured":"G. De Giacomo and M. Lenzerini. What\u2019s in an aggregate: Foundations for description logics with tuples and sets. In Proc. of IJCAI-95, 1995."},{"key":"11_CR12","unstructured":"G. De Giacomo and M. Lenzerini. Tbox and Abox reasoning in expressive description logics. In Proc. of KR-96, pages 316\u2013327. M. Kaufmann, Los Altos, 1996."},{"key":"11_CR13","unstructured":"F. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. In Proc. of KR-91, Boston, MA, USA, 1991."},{"key":"11_CR14","unstructured":"F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Reasoning in description logics. In G. Brewka, editor, Foundation of Knowledge Representation. CSLI Publication, Cambridge University Press, 1996."},{"key":"11_CR15","unstructured":"G. De Giacomo and F. Massacci. Combining deduction and model checking into tableaux and algorithms for Converse-PDL. Information and Computation, 1998. To appear."},{"key":"11_CR16","volume-title":"ECAI-90","author":"B. Hollunder","year":"1990","unstructured":"B. Hollunder, W. Nutt, and M. Schmidt-Schauss. Subsumption algorithms for concept description languages. In ECAI-90, Pitman Publishing, London, 1990."},{"key":"11_CR17","unstructured":"I. Horrocks. Using an expressive description logic: FaCT or fiction? In Proc. of KR-98, pages 636\u2013647, 1998."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"I. Horrocks and U. Sattler. A description logic with transitive and inverse roles and role hierarchies. J. of Logic and Computation, 1999. To appear.","DOI":"10.1093\/logcom\/9.3.385"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"I. Horrocks, U. Sattler, and S. Tobies. A PSpace-algorithm for deciding ALCI R+-satisfiability. Technical Report 98-08, LuFg Theoretical Computer Science, RWTH Aachen, 1998. See http:\/\/www-lti.informatik.rwth-aachen.de\/Forschung\/Papers.html .","DOI":"10.25368\/2022.84"},{"key":"11_CR20","series-title":"LTCS-Report","volume-title":"LuFg Theoretical Computer Science","author":"I. Horrocks","year":"1999","unstructured":"I. Horrocks, U. Sattler, and S. Tobies. A description logic with transitive and converse roles, role hierarchies and qualifying number restrictions. LTCS-Report 99-08, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1999."},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"U. Sattler. A concept language extended with different kinds of transitive roles. In 20. Deutsche Jahrestagung f\u00fcr KI, LNAI 1137. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61708-6_74"},{"key":"11_CR22","unstructured":"K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of IJCAI-91, pages 466\u2013471, Sydney, 1991."},{"issue":"1","key":"11_CR23","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":"11_CR24","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CADE-16","author":"S. Tobies","year":"1999","unstructured":"S. Tobies. A PSpace algorithm for graded modal logic. In Proc. of CADE-16, LNCS. Springer, 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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T06:35:06Z","timestamp":1683959706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48242-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664925","9783540482420"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-48242-3_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}