{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:55:32Z","timestamp":1740099332646,"version":"3.37.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030221010"},{"type":"electronic","value":"9783030221027"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22102-7_25","type":"book-chapter","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T08:21:26Z","timestamp":1561450886000},"page":"542-561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Presburger Concept Cardinality Constraints in Very Expressive Description Logics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1609-2080","authenticated-orcid":false,"given":"\u201cJohann\u201d Sebastian","family":"Rudolph","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,1]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-66167-4_3","volume-title":"Frontiers of Combining Systems","author":"F Baader","year":"2017","unstructured":"Baader, F.: A new description logic with set constraints and cardinality constraints on role successors. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 43\u201359. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66167-4_3"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F.: Expressive cardinality constraints on $$\\cal{ALCSCC}$$ concepts. In: Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing (SAC 2019). ACM (2019)","DOI":"10.1145\/3297280.3297390"},{"key":"25_CR3","unstructured":"Baader, F., Bednarczyk, B., Rudolph, S.: Satisfiability checking and conjunctive query answering in description logics with global and local cardinality constraints. In: Proceedings of the 32nd International Workshop on Description Logics (DL 2019). CEUR Workshop Proceedings. CEUR-WS.org (2019, submitted)"},{"key":"25_CR4","volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2007","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)","edition":"2"},{"key":"25_CR5","unstructured":"Baader, F., Ecke, A.: Extending the description logic $$\\cal{ALC}$$ with more expressive cardinality constraints on concepts. In: 3rd Global Conference on Artificial Intelligence (GCAI 2017). EPiC Series in Computing, vol. 50, pp. 6\u201319. EasyChair (2017)"},{"key":"25_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/9781139025355","volume-title":"An Introduction to Description Logic","author":"F Baader","year":"2017","unstructured":"Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017)"},{"key":"25_CR7","unstructured":"Bach, J.S.: Canon circularis per tonos. In: The Musical Offering, BWV, vol. 1079. Leipzig (1747)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Bednarczyk, B., Rudolph, S.: Worst-case optimal querying of very expressive description logics with path expressions and succinct counting. In: Proceedings of the 32nd International Workshop on Description Logics (DL 2019). CEUR Workshop Proceedings, CEUR-WS.org (2019, submitted)","DOI":"10.24963\/ijcai.2019\/212"},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BF02124929","volume":"46","author":"G Cantor","year":"1895","unstructured":"Cantor, G.: Beitr\u00e4ge zur Begr\u00fcndung der transfiniten Mengenlehre. Math. Ann. 46(4), 481\u2013512 (1895)","journal-title":"Math. Ann."},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01444205","volume":"49","author":"G Cantor","year":"1897","unstructured":"Cantor, G.: Beitr\u00e4ge zur Begr\u00fcndung der transfiniten Mengenlehre. Math. Ann. 49(2), 207\u2013246 (1897)","journal-title":"Math. Ann."},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10849-005-5788-9","volume":"14","author":"S Demri","year":"2005","unstructured":"Demri, S., Nivelle, H.: Deciding regular grammar logics with converse through first-order logic. J. Logic Lang. Inf. 14(3), 289\u2013329 (2005)","journal-title":"J. Logic Lang. Inf."},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.jal.2010.03.001","volume":"8","author":"S Demri","year":"2010","unstructured":"Demri, S., Lugiez, D.: Complexity of modal logics with Presburger constraints. J. Appl. Logic 8(3), 233\u2013252 (2010)","journal-title":"J. Appl. Logic"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10817-014-9305-1","volume":"53","author":"B Glimm","year":"2014","unstructured":"Glimm, B., Horrocks, I., Motik, B., Stoilos, G., Wang, Z.: HermiT: an OWL 2 reasoner. J. Autom. Reason. 53(3), 245\u2013269 (2014)","journal-title":"J. Autom. Reason."},{"key":"25_CR14","unstructured":"Glimm, B., Kazakov, Y., Lutz, C.: Status QIO: an update. In: Rosati, R., Rudolph, S., Zakharyaschev, M. (eds.) Proceedings of the 24th International Workshop on Description Logics (DL 2011). CEUR Workshop Proceedings, vol. 745. CEUR-WS.org (2011)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-17746-0_17","volume-title":"The Semantic Web \u2013 ISWC 2010","author":"B Glimm","year":"2010","unstructured":"Glimm, B., Rudolph, S., V\u00f6lker, J.: Integrated metamodeling and diagnosis in OWL\u00a02. In: Patel-Schneider, P.F., et al. (eds.) ISWC 2010, Part I. LNCS, vol. 6496, pp. 257\u2013272. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17746-0_17"},{"key":"25_CR16","unstructured":"Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible $$\\cal{SROIQ}$$ . In: Doherty, P., Mylopoulos, J., Welty, C.A. (eds.) Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 57\u201367. AAAI Press (2006)"},{"key":"25_CR17","unstructured":"Kazakov, Y.: $$\\cal{RIQ}$$ and $$\\cal{SROIQ}$$ are harder than $$\\cal{SHOIQ}$$ . In: Brewka, G., Lang, J. (eds.) Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 274\u2013284. AAAI Press (2008)"},{"key":"25_CR18","unstructured":"Kr\u00f6tzsch, M., Rudolph, S.: Nominal schemas in description logics: complexities clarified. In: Baral, C., De Giacomo, G., Eiter, T. (eds.) Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning (KR 2014), pp. 308\u2013317. AAAI Press (2014)"},{"key":"25_CR19","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). https:\/\/doi.org\/10.1007\/978-3-540-73595-3_15"},{"issue":"1\u20132","key":"25_CR20","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. 199(1\u20132), 132\u2013171 (2005)","journal-title":"Inf. Comput."},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-67582-4_20","volume-title":"Scalable Uncertainty Management","author":"R Pe\u00f1aloza","year":"2017","unstructured":"Pe\u00f1aloza, R., Potyka, N.: Towards statistical reasoning in description logics over finite domains. In: Moral, S., Pivert, O., S\u00e1nchez, D., Mar\u00edn, N. (eds.) SUM 2017. LNCS (LNAI), vol. 10564, pp. 280\u2013294. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67582-4_20"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10849-005-5791-1","volume":"14","author":"I Pratt-Hartmann","year":"2005","unstructured":"Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. J. Logic Lang. Inf. 14, 369\u2013395 (2005)","journal-title":"J. Logic Lang. Inf."},{"issue":"1","key":"25_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/logcom\/exl034","volume":"17","author":"I Pratt-Hartmann","year":"2007","unstructured":"Pratt-Hartmann, I.: Complexity of the guarded two-variable fragment with counting quantifiers. J. Log. Comput. 17(1), 133\u2013155 (2007)","journal-title":"J. Log. Comput."},{"issue":"8","key":"25_CR24","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/j.ic.2009.02.004","volume":"207","author":"I Pratt-Hartmann","year":"2009","unstructured":"Pratt-Hartmann, I.: Data-complexity of the two-variable fragment with counting quantifiers. Inf. Comput. 207(8), 867\u2013888 (2009)","journal-title":"Inf. Comput."},{"key":"25_CR25","unstructured":"Pratt-Hartmann, I.: Personal communication, 19 March 2019"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-23032-5_2","volume-title":"Reasoning Web. Semantic Technologies for the Web of Data","author":"S Rudolph","year":"2011","unstructured":"Rudolph, S.: Foundations of description logics. In: Polleres, A., et al. (eds.) Reasoning Web 2011. LNCS, vol. 6848, pp. 76\u2013136. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23032-5_2"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1613\/jair.3029","volume":"39","author":"S Rudolph","year":"2010","unstructured":"Rudolph, S., Glimm, B.: Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend! J. Artif. Intell. Res. 39, 429\u2013481 (2010)","journal-title":"J. Artif. Intell. Res."},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Rudolph, S., Kr\u00f6tzsch, M.: Flag & check: data access with monadically defined queries. In: Hull, R., Fan, W. (eds.) Proceedings of the 32nd Symposium on Principles of Database Systems (PODS 2013), pp. 151\u2013162. ACM (2013)","DOI":"10.1145\/2463664.2465227"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-87803-2_30","volume-title":"Logics in Artificial Intelligence","author":"S Rudolph","year":"2008","unstructured":"Rudolph, S., Kr\u00f6tzsch, M., Hitzler, P.: Cheap Boolean role constructors for description logics. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 362\u2013374. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87803-2_30"},{"issue":"2","key":"25_CR30","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.websem.2007.03.004","volume":"5","author":"E Sirin","year":"2007","unstructured":"Sirin, E., Parsia, B., Grau, B.C., Kalyanpur, A., Katz, Y.: Pellet: a practical OWL-DL reasoner. J. Web Seman. 5(2), 51\u201353 (2007)","journal-title":"J. Web Seman."},{"key":"25_CR31","unstructured":"Skolem, T.: \u00dcber einige Grundlagenfragen der Mathematik. Skrifter utgitt av det Norske Videnskaps-Akademi i Oslo, I. Matematisk-naturvidenskabelig Klasse 7, 1\u201349 (1929)"},{"key":"25_CR32","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.websem.2014.06.003","volume":"27","author":"A Steigmiller","year":"2014","unstructured":"Steigmiller, A., Liebig, T., Glimm, B.: Konclude: system description. J. Web Seman. 27, 78\u201385 (2014)","journal-title":"J. Web Seman."},{"key":"25_CR33","unstructured":"Tobies, S.: Complexity results and practical algorithms for logics in knowledge representation. Ph.D. thesis, RWTH Aachen, Germany (2001)"}],"container-title":["Lecture Notes in Computer Science","Description Logic, Theory Combination, and All That"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22102-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,30]],"date-time":"2019-11-30T06:18:00Z","timestamp":1575094680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-22102-7_25"}},"subtitle":["Allegro sexagenarioso ma non ritardando"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030221010","9783030221027"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22102-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}