{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:49:06Z","timestamp":1768452546531,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540287612","type":"print"},{"value":"9783540318187","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11551263_4","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:37:27Z","timestamp":1127817447000},"page":"18-33","source":"Crossref","is-referenced-by-count":2,"title":["A New n-Ary Existential Quantifier in Description Logics"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[]},{"given":"Eldar","family":"Karabaev","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Lutz","sequence":"additional","affiliation":[]},{"given":"Manfred","family":"Thei\u00dfen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $\\mathcal{EL}$ -envelope. In: Proc. 19th Int. Joint Conf. on Artificial Intelligence (2005) (to appear)"},{"key":"4_CR2","volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0018999","volume-title":"GWAI-92: Advances in Artificial Intelligence","author":"F. Baader","year":"1993","unstructured":"Baader, F., Hanschke, P.: Extensions of concept languages for a mechanical engineering application. In: Ohlbach, H.J. (ed.) GWAI 1992. LNCS, vol.\u00a0671. Springer, Heidelberg (1993)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F., K\u00fcsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Proc. 16th Int. Joint Conf. on Artificial Intelligence (1999)","DOI":"10.25368\/2022.85"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Baader, F., Lutz, C., Karabaev, E., Thei\u00dfen, M.: A new n-ary existential quantifier in description logics. LTCS-Report 05-08, Theoretical Computer Science, TU Dresden, Germany (2005), See http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.1007\/11551263_4"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Baader, F., Milicic, M., Lutz, C., Sattler, U., Wolter, F.: Integrating description logics and action formalisms for reasoning about web services. LTCS-Report 05-02, Theoretical Computer Science, TU Dresden, Germany (2005), See http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.25368\/2010.145"},{"key":"4_CR7","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","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 Science, vol.\u00a053. Cambridge University Press, Cambridge (2001)"},{"key":"4_CR8","unstructured":"Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and\u2014what else? In: Proc. 16th Eur. Conf. on Artificial Intelligence (2004)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Calvanese, D., Lenzerini, M., Nardi, D.: A unified framework for class based representation formalisms. In: Proc. 4th Int. Conf. on the Principles of Knowledge Representation and Reasoning (1994)","DOI":"10.1016\/B978-1-4832-1452-8.50107-X"},{"key":"4_CR10","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (1990)"},{"key":"4_CR11","unstructured":"Donini, F.: Complexity of reasoning. In: [2] (2003)"},{"key":"4_CR12","volume-title":"Computers and Intractability \u2014 A guide to NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2014 A guide to NP-completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"4_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/3-540-45744-5_59","volume-title":"Automated Reasoning","author":"V. Haarslev","year":"2001","unstructured":"Haarslev, V., M\u00f6ller, R.: RACER system description. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, p. 701. Springer, Heidelberg (2001)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. The Journal of the London Mathematical Society\u00a010, 26\u201330 (1935)","journal-title":"The Journal of the London Mathematical Society"},{"key":"4_CR15","unstructured":"Horrocks, I.: Using an expressive description logic: FaCT or fiction? In: Proc. 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (1998)"},{"issue":"3","key":"4_CR16","first-page":"239","volume":"8","author":"I. Horrocks","year":"2000","unstructured":"Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. J. of the Interest Group in Pure and Applied Logic\u00a08(3), 239\u2013264 (2000)","journal-title":"J. of the Interest Group in Pure and Applied Logic"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Kolaitis, P.G., Martin, D.M., Thakur, M.N.: On the complexity of the containment problem for conjunctive queries with built-in predicates. In: Proc. 17th ACM Symp. on Principles of Database Systems (1998)","DOI":"10.1145\/275487.275510"},{"key":"4_CR18","series-title":"LNAI","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48242-3_12","volume-title":"Logic Programming and Automated Reasoning","author":"C. Lutz","year":"1999","unstructured":"Lutz, C.: Complexity of terminological reasoning revisited. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS (LNAI), vol.\u00a01705. Springer, Heidelberg (1999)"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0004-3702(90)90087-G","volume":"43","author":"B. Nebel","year":"1990","unstructured":"Nebel, B.: Terminological reasoning is inherently intractable. Artificial Intelligence\u00a043, 235\u2013249 (1990)","journal-title":"Artificial Intelligence"},{"key":"4_CR20","unstructured":"Qian, X.: Query folding. In: Proc. 12th IEEE Int. Conf. on Data Engineering (1996)"},{"issue":"4","key":"4_CR21","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1137\/0206053","volume":"6","author":"S.W. Reyner","year":"1977","unstructured":"Reyner, S.W.: An analysis of a good algorithm for the subtree problem. SIAM J. on Computing\u00a06(4), 730\u2013732 (1977)","journal-title":"SIAM J. on Computing"},{"key":"4_CR22","series-title":"LNAI","volume-title":"KI-96: Advances in Artificial Intelligence","author":"U. Sattler","year":"1996","unstructured":"Sattler, U.: A concept language extended with different kinds of transitive roles. In: G\u00f6rz, G., H\u00f6lldobler, S. (eds.) KI 1996. LNCS (LNAI), vol.\u00a01137. Springer, Heidelberg (1996)"},{"key":"4_CR23","unstructured":"Thei\u00dfen, M., von Wedel, L.: The need for an n-ary existential quantifier in description logics. In: Proc. KI- 2004 Workshop on Applications of Description Logics. CEUR Electronic Workshop Proceedings (2004), http:\/\/CEUR-WS.org\/Vol-115\/"},{"key":"4_CR24","unstructured":"Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, Computer Science Department, RWTH Aachen, Germany (2001)"},{"key":"4_CR25","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: Proc. 7th Int. Conf. on Very Large Data Bases (1981)"}],"container-title":["Lecture Notes in Computer Science","KI 2005: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11551263_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T15:48:27Z","timestamp":1683215307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11551263_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287612","9783540318187"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11551263_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}