{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:26:14Z","timestamp":1742948774945,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022609"},{"type":"electronic","value":"9783642022616"}],"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-02261-6_3","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T00:28:49Z","timestamp":1244248129000},"page":"26-36","source":"Crossref","is-referenced-by-count":12,"title":["Query Answering in Description Logics: The Knots Approach"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Lutz","sequence":"additional","affiliation":[]},{"given":"Magdalena","family":"Ortiz","sequence":"additional","affiliation":[]},{"given":"Mantas","family":"\u0160imkus","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Baader, F., Lutz, C., Motik, B. (eds.): Proceedings of the 21st International Workshop on Description Logics (DL 2008), Dresden, Germany, May 13-16, 2008. CEUR Workshop Proceedings, vol.\u00a0353. CEUR-WS.org (2008)"},{"key":"3_CR2","series-title":"Cambridge Tracts in Theoretical Computer Sc.","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Sc., vol.\u00a053. Cambridge University Press, Cambridge (2001)"},{"key":"3_CR3","unstructured":"Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics: An automata-theoretic approach. In: Proc. of the 22nd Nat. Conf. on Artificial Intelligence (AAAI\u00a02007), pp. 391\u2013396 (2007)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-87803-2_15","volume-title":"Logics in Artificial Intelligence","author":"T. Eiter","year":"2008","unstructured":"Eiter, T., Gottlob, G., Ortiz, M., \u0160imkus, M.: Query answering in the description logic Horn-SHIQ. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS, vol.\u00a05293, pp. 166\u2013179. Springer, Heidelberg (2008)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Eiter, T., Lutz, C., Ortiz, M., \u0160imkus, M.: Query answering in description logics with transitive roles. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009). AAAI Press\/IJCAI (2009)","DOI":"10.1007\/978-3-642-02261-6_3"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/978-3-540-89439-1_27","volume-title":"LPAR 2008","author":"T. Eiter","year":"2008","unstructured":"Eiter, T., Ortiz, M., Simkus, M.: Reasoning using knots. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS, vol.\u00a05330, pp. 377\u2013390. Springer, Heidelberg (2008)"},{"volume-title":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008","year":"2008","key":"3_CR7","unstructured":"Fox, D., Gomes, C.P. (eds.): Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008. AAAI Press, Menlo Park (2008)"},{"key":"3_CR8","unstructured":"Glimm, B., Horrocks, I., Sattler, U.: Conjunctive query entailment for $\\mathcal{SHOQ}$ . In: Proc. of the 2007 Description Logic Workshop (DL\u00a02007). CEUR Electronic Workshop Proceedings, vol.\u00a0250, pp. 65\u201375 (2007), http:\/\/ceur-ws.org\/Vol-250\/"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1613\/jair.2372","volume":"31","author":"B. Glimm","year":"2008","unstructured":"Glimm, B., Lutz, C., Horrocks, I., Sattler, U.: Answering conjunctive queries in the $\\mathcal{SHIQ}$ description logic. Journal of Artificial Intelligence Research\u00a031, 150\u2013197 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"J.Y. Halpern","year":"1992","unstructured":"Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artif. Intell.\u00a054(3), 319\u2013379 (1992)","journal-title":"Artif. Intell."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-32275-7_2","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"U. Hustadt","year":"2005","unstructured":"Hustadt, U., Motik, B., Sattler, U.: A decomposition rule for decision procedures by resolution-based calculi. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol.\u00a03452, pp. 21\u201335. Springer, Heidelberg (2005)"},{"key":"3_CR12","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-71070-7_16","volume-title":"Automated Reasoning","author":"C. Lutz","year":"2008","unstructured":"Lutz, C.: The complexity of conjunctive query answering in expressive description logics. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 179\u2013193. Springer, Heidelberg (2008)"},{"key":"3_CR13","unstructured":"Lutz, C.: Two upper bounds for conjunctive query answering in SHIQ. In: Baader, et al [1]"},{"issue":"1-2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.ic.2004.11.002","volume":"199","author":"C. Lutz","year":"2005","unstructured":"Lutz, C., Sattler, U., Tendera, L.: The complexity of finite model reasoning in description logics. Inf. Comput.\u00a0199(1-2), 132\u2013171 (2005)","journal-title":"Inf. Comput."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TIME.2008.14","volume-title":"Proc. 15th International Symposium on Temporal Representation and Reasoning (TIME 2008)","author":"C. Lutz","year":"2008","unstructured":"Lutz, C., Wolter, F., Zakharyaschev, M.: Temporal description logics: A survey. In: Demri, S., Jensen, C.S. (eds.) Proc. 15th International Symposium on Temporal Representation and Reasoning (TIME 2008), pp. 3\u201314. IEEE Computer Society, Los Alamitos (2008)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-68804-8_7","volume-title":"Finite Model Theory and Its Applications","author":"M. Marx","year":"2007","unstructured":"Marx, M., Venema, Y.: Local variations on a loose theme: Modal logic and decidability. In: Finite Model Theory and Its Applications, vol.\u00a07, pp. 371\u2013429. Springer, Heidelberg (2007)"},{"key":"3_CR17","unstructured":"N\u00e9meti, I.: Free algebras and decidability in algebraic logic. DSc. thesis, Mathematical Institute of The Hungarian Academy of Sciences, Budapest (1986)"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10817-008-9102-9","volume":"41","author":"M. Ortiz","year":"2008","unstructured":"Ortiz, M., Calvanese, D., Eiter, T.: Data complexity of query answering in expressive description logics via tableaux. J. of Automated Reasoning\u00a041(1), 61\u201398 (2008)","journal-title":"J. of Automated Reasoning"},{"key":"3_CR19","unstructured":"Ortiz, M., Simkus, M., Eiter, T.: Conjunctive query answering in SH using knots. In: Baader, et al [1]"},{"key":"3_CR20","unstructured":"Ortiz, M., Simkus, M., Eiter, T.: Worst-case optimal conjunctive query answering for an expressive description logic without inverses. In: Fox and Gomes [7], pp. 504\u2013510"},{"issue":"1-2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.3166\/jancl.16.169-207","volume":"16","author":"G. Pan","year":"2006","unstructured":"Pan, G., Sattler, U., Vardi, M.Y.: BDD-based decision procedures for the modal logic k. Journal of Applied Non-Classical Logics\u00a016(1-2), 169\u2013208 (2006)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"3_CR22","first-page":"115","volume-title":"FOCS","author":"V.R. Pratt","year":"1979","unstructured":"Pratt, V.R.: Models of program logics. In: FOCS, pp. 115\u2013122. IEEE, Los Alamitos (1979)"},{"key":"3_CR23","unstructured":"Pratt-Hartmann, I.: Data-complexity of the two-variable fragment with counting quantifiers. Information and Computation (2008) (Forthcoming)CoRR, http:\/\/arxiv.org\/abs\/0806.1636"},{"key":"3_CR24","unstructured":"Rudolph, S., Kr\u00f6tzsch, M., Hitzler, P.: Terminological reasoning in $\\mathcal{SHIQ}$ with ordered binary decision diagrams. In: Fox and Gomes [7], pp. 529\u2013534"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02261-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:31:44Z","timestamp":1558362704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02261-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022609","9783642022616"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02261-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}