{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:17:45Z","timestamp":1725520665737},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540894384"},{"type":"electronic","value":"9783540894391"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89439-1_28","type":"book-chapter","created":{"date-parts":[[2008,11,15]],"date-time":"2008-11-15T03:03:10Z","timestamp":1226718190000},"page":"391-405","source":"Crossref","is-referenced-by-count":4,"title":["Role Conjunctions in Expressive Description Logics"],"prefix":"10.1007","author":[{"given":"Birte","family":"Glimm","sequence":"first","affiliation":[]},{"given":"Yevgeny","family":"Kazakov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"The Description Logic Handbook","year":"2003","key":"28_CR1","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)"},{"key":"28_CR2","unstructured":"Kazakov, Y.: $\\mathcal{RIQ}$ and $\\mathcal{SROIQ}$ are harder than $\\mathcal{SHOIQ}$ . In: Proc. of the 11th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2008). AAAI Press\/The MIT Press (2008)"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1613\/jair.2372","volume":"31","author":"B. Glimm","year":"2008","unstructured":"Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic $\\mathcal{SHIQ}$ . J. of Artificial Intelligence Research\u00a031, 151\u2013198 (2008)","journal-title":"J. of Artificial Intelligence Research"},{"issue":"5","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.2178\/jsl\/1129642115","volume":"70","author":"M. Lange","year":"2005","unstructured":"Lange, M., Lutz, C.: 2-ExpTime lower bounds for Propositional Dynamic Logics with intersection. J. of Symbolic Logic\u00a070(5), 1072\u20131086 (2005)","journal-title":"J. of Symbolic Logic"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Glimm, B., Kazakov, Y.: Role conjunctions in expressive description logics. Technical report, University of Oxford (2008), http:\/\/www.comlab.oxford.ac.uk\/\/files\/361\/RoleConjunctions.pdf","DOI":"10.1007\/978-3-540-89439-1_28"},{"key":"28_CR6","unstructured":"Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, RWTH Aachen (2001)"},{"key":"28_CR7","unstructured":"Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI 1991) (1991)"},{"issue":"2\u20133","key":"28_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10817-007-9090-1","volume":"40","author":"Y. Kazakov","year":"2008","unstructured":"Kazakov, Y., Motik, B.: A resolution-based decision procedure for $\\mathcal{SHOIQ}$ . J. of Automated Reasoning\u00a040(2\u20133), 89\u2013116 (2008)","journal-title":"J. of Automated Reasoning"},{"key":"28_CR9","unstructured":"Hustadt, U., Motik, B., Sattler, U.: Reducing $\\mathcal{SHIQ}^-$ Description Logic to Disjunctive Datalog Programs. In: Proc. of the 9th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2004) (2004)"},{"key":"28_CR10","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 2 edn. Course Technology (February 2005)"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. of the ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"J. of the ACM"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Tobies, S.: The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. J. of Artificial Intelligence Research 12 (2000)","DOI":"10.1613\/jair.705"},{"issue":"4","key":"28_CR13","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1023\/A:1008334715902","volume":"8","author":"E. B\u00f6rger","year":"1999","unstructured":"B\u00f6rger, E., Gr\u00e4del, E., Gurevich, Y.: The classical decision problem. J. of Logic, Language and Information\u00a08(4), 478\u2013481 (1999)","journal-title":"J. of Logic, Language and Information"},{"key":"28_CR14","unstructured":"Lutz, C.: Inverse roles make conjunctive queries hard. In: Proc. of the 2007 Description Logic Workshop (DL 2007) (2007)"}],"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\/978-3-540-89439-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T13:12:38Z","timestamp":1557925958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89439-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540894384","9783540894391"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89439-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}