{"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":1774591373651,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319661667","type":"print"},{"value":"9783319661674","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-66167-4_3","type":"book-chapter","created":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T07:15:18Z","timestamp":1503904518000},"page":"43-59","source":"Crossref","is-referenced-by-count":10,"title":["A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F.: Concept descriptions with set constraints and cardinality constraints. LTCS-Report 17\u201302, Chair for Automata Theory, Institute for Theoretical Computer Science, TU Dresden, Germany, 2017. http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.25368\/2022.232"},{"key":"3_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, New York (2003)"},{"issue":"3","key":"3_CR3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1093\/logcom\/9.3.319","volume":"9","author":"F Baader","year":"1999","unstructured":"Baader, F., Sattler, U.: Expressive number restrictions in description logics. J. Logic Comput. 9(3), 319\u2013350 (1999)","journal-title":"J. Logic Comput."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Borgida, A., Brachman, R.J., McGuinness, D.L., Alperin Resnick, L.: CLASSIC: a structural data model for objects. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 59\u201367 (1989)","DOI":"10.1145\/67544.66932"},{"issue":"4","key":"3_CR5","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.jal.2010.08.009","volume":"8","author":"J Faddoul","year":"2010","unstructured":"Faddoul, J., Haarslev, V.: Algebraic tableau reasoning for the description logic SHOQ. J. Appl. Logic 8(4), 334\u2013355 (2010)","journal-title":"J. Appl. Logic"},{"key":"3_CR6","volume-title":"Computers and Intractability \u2013 A guide to NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2013 A guide to NP-Completeness. W.H. Freeman and Company, San Francisco (1979)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-22438-6_22","volume-title":"Automated Deduction \u2013 CADE-23","author":"V Haarslev","year":"2011","unstructured":"Haarslev, V., Sebastiani, R., Vescovi, M.: Automated reasoning in $$\\cal{ALCQ}$$ via SMT. In: Bj\u00f8rner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 283\u2013298. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22438-6_22"},{"key":"3_CR8","unstructured":"Haarslev, V., Timmann, M., M\u00f6ller, R.: Combining tableaux and algebraic methods for reasoning with qualified number restrictions. In: Proceedings of DL 2001, CEUR Workshop Proceedings, vol. 49. CEUR-WS.org (2001)"},{"issue":"6","key":"3_CR9","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1093\/bib\/bbv011","volume":"16","author":"R Hoehndorf","year":"2015","unstructured":"Hoehndorf, R., Schofield, P.N., Gkoutos, G.V.: The role of ontologies in biological and biomedical research: a functional perspective. Brief. Bioinform. 16(6), 1069\u20131080 (2015)","journal-title":"Brief. Bioinform."},{"key":"3_CR10","unstructured":"Hollunder, B., Baader, F.: Qualifying number restrictions in concept languages. In: Proceedings of KR 1991, pp. 335\u2013346 (1991)"},{"key":"3_CR11","unstructured":"Hollunder, B., Nutt, W., Schmidt-Schau\u00df, M.: Subsumption algorithms for concept description languages. In: Proceedings of ECAI 1990, pp. 348\u2013353. Pitman, London (United Kingdom) (1990)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-540-73595-3_15","volume-title":"Automated Deduction \u2013 CADE-21","author":"V Kuncak","year":"2007","unstructured":"Kuncak, V., Rinard, M.: Towards efficient satisfiability checking for boolean algebra with presburger arithmetic. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 215\u2013230. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73595-3_15"},{"issue":"1\u20132","key":"3_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(99)00011-9","volume":"109","author":"HJ Ohlbach","year":"1999","unstructured":"Ohlbach, H.J., Koehler, J.: Modal logics, description logics and arithmetic reasoning. Artif. Intell. 109(1\u20132), 1\u201331 (1999)","journal-title":"Artif. Intell."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Models of program logic. In: Proceedings of FOCS 1979, pp. 115\u2013122 (1979)","DOI":"10.1109\/SFCS.1979.24"},{"issue":"1","key":"3_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-8(1:12)2012","volume":"8","author":"S Rudolph","year":"2012","unstructured":"Rudolph, S., Kr\u00f6tzsch, M., Hitzler, P.: Type-elimination-based reasoning for the description logic $$\\cal{SHIQ}$$ b $$_s$$ using decision diagrams and disjunctive datalog. Logical Methods Comput. Sci. 8(1), 1\u201338 (2012)","journal-title":"Logical Methods Comput. Sci."},{"key":"3_CR16","unstructured":"Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Proceedings of IJCAI 1991, pp. 466\u2013471 (1991)"},{"issue":"1","key":"3_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(91)90078-X","volume":"48","author":"M Schmidt-Schau\u00df","year":"1991","unstructured":"Schmidt-Schau\u00df, M., Smolka, G.: Attributive concept descriptions with complements. Artif. Intell. 48(1), 1\u201326 (1991)","journal-title":"Artif. Intell."},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-48660-7_4","volume-title":"Automated Deduction \u2014 CADE-16","author":"S Tobies","year":"1999","unstructured":"Tobies, S.: A PSpace algorithm for graded modal logic. CADE 1999. LNCS, vol. 1632, pp. 52\u201366. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48660-7_4"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66167-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T16:51:26Z","timestamp":1659372686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66167-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319661667","9783319661674"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66167-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}