{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:14Z","timestamp":1759638434594,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221762"},{"type":"electronic","value":"9783319221779"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22177-9_28","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T10:05:43Z","timestamp":1438596343000},"page":"367-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reasoning with Global Assumptions in Arithmetic Modal Logics"],"prefix":"10.1007","author":[{"given":"Clemens","family":"Kupke","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"volume-title":"The Description Logic Handbook","year":"2003","key":"28_CR1","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Sattler, U.: Description logics with symbolic number restrictions. In: European Conference on Artificial Intelligence, ECAI 1996, pp. 283\u2013287. Wiley (1996)","DOI":"10.25368\/2022.71"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-45114-0_7","volume-title":"Advances in Artificial Intelligence and Its Applications","author":"E B\u00e1rcenas","year":"2013","unstructured":"B\u00e1rcenas, E., Lavalle, J.: Expressive reasoning on tree structures: recursion, inverse programs, presburger constraints and nominals. In: Castro, F., Gelbukh, A., Gonz\u00e1lez, M. (eds.) MICAI 2013, Part I. LNCS, vol. 8265, pp. 80\u201391. Springer, Heidelberg (2013)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In: Symposium on Theory of Computing, STOC 1988, pp. 460\u2013467. ACM (1988)","DOI":"10.1145\/62212.62257"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s001530100110","volume":"41","author":"G D\u2019Agostino","year":"2002","unstructured":"D\u2019Agostino, G., Visser, A.: Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic 41, 267\u2013298 (2002)","journal-title":"Arch. Math. Logic"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/11814771_44","volume-title":"Automated Reasoning","author":"S Demri","year":"2006","unstructured":"Demri, S., Lugiez, D.: Presburger modal logic is PSPACE-complete. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 541\u2013556. Springer, Heidelberg (2006)"},{"key":"28_CR7","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, 233\u2013252 (2010)","journal-title":"J. Appl. Logic"},{"issue":"5","key":"28_CR8","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.orl.2005.09.008","volume":"34","author":"F Eisenbrand","year":"2006","unstructured":"Eisenbrand, F., Shmonin, G.: Carath\u00e9odory bounds for integer cones. Oper. Res. Lett. 34(5), 564\u2013568 (2006)","journal-title":"Oper. Res. Lett."},{"key":"28_CR9","first-page":"1","volume":"2","author":"D Elgesem","year":"1997","unstructured":"Elgesem, D.: The modal logic of agency. Nordic J. Philos. Logic 2, 1\u201346 (1997)","journal-title":"Nordic J. Philos. Logic"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/174652.174658","volume":"41","author":"R Fagin","year":"1994","unstructured":"Fagin, R., Halpern, J.: Reasoning about knowledge and probability. J. ACM 41, 340\u2013367 (1994)","journal-title":"J. ACM"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0890-5401(90)90060-U","volume":"87","author":"R Fagin","year":"1990","unstructured":"Fagin, R., Halpern, J., Megiddo, N.: A logic for reasoning about probabilities. Inform. Comput. 87, 78\u2013128 (1990)","journal-title":"Inform. Comput."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","volume":"13","author":"K Fine","year":"1972","unstructured":"Fine, K.: In so many possible worlds. Notre Dame J. Form. Log. 13, 516\u2013520 (1972)","journal-title":"Notre Dame J. Form. Log."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/logcom\/2.1.5","volume":"2","author":"V Goranko","year":"1992","unstructured":"Goranko, V., Passy, S.: Using the universal modality: Gains and questions. J. Log. Comput. 2, 5\u201330 (1992)","journal-title":"J. Log. Comput."},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-12002-2_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Gor\u00e9","year":"2010","unstructured":"Gor\u00e9, R., Kupke, C., Pattinson, D.: Optimal tableau algorithms for coalgebraic logics. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 114\u2013128. Springer, Heidelberg (2010)"},{"key":"28_CR15","unstructured":"Gor\u00e9, R., Nguyen, L.: EXPTIME tableaux for ALC using sound global caching. In: Description Logics, DL 2007, CEUR Workshop Proceedings, vol. 250 (2007)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-71070-7_25","volume-title":"Automated Reasoning","author":"RP Gor\u00e9","year":"2008","unstructured":"Gor\u00e9, R.P., Postniece, L.: An experimental evaluation of global caching for $$\\cal {ALC}$$ (System description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 299\u2013305. Springer, Heidelberg (2008)"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1006\/game.1999.0788","volume":"35","author":"A Heifetz","year":"2001","unstructured":"Heifetz, A., Mongin, P.: Probabilistic logic for type spaces. Games Econ. Behav. 35, 31\u201353 (2001)","journal-title":"Games Econ. Behav."},{"key":"28_CR18","unstructured":"Kupke, C., Pattinson, D.: On modal logics of linear inequalities. In: Advances in Modal Logic, AiML 2010, pp. 235\u2013255. College Publications (2010)"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K Larsen","year":"1991","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94, 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"28_CR20","unstructured":"Lutz, C., Schr\u00f6der, L.: Probabilistic description logics for subjective uncertainty. In: Principles of Knowledge Representation and Reasoning, KR 2010, pp. 393\u2013403. AAAI (2010)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-00596-1_11","volume-title":"Foundations of Software Science and Computational Structures","author":"R Myers","year":"2009","unstructured":"Myers, R., Pattinson, D., Schr\u00f6der, L.: Coalgebraic hybrid logic. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 137\u2013151. Springer, Heidelberg (2009)"},{"key":"28_CR22","unstructured":"Pacuit, E., Salame, S.: Majority logic. In: Principles of Knowledge Representation and Reasoning, KR 2004, pp. 598\u2013605. AAAI Press (2004)"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"C Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.: On the complexity of integer programming. J. ACM 28, 765\u2013768 (1981)","journal-title":"J. ACM"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Pratt, V.: Models of program logics. In: Foundations of Computer Science, FOCS 1979, pp. 115\u2013122. IEEE Comp. Soc. (1979)","DOI":"10.1109\/SFCS.1979.24"},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jlap.2006.11.004","volume":"73","author":"L Schr\u00f6der","year":"2007","unstructured":"Schr\u00f6der, L.: A finite model construction for coalgebraic modal logic. J. Log. Algebr. Prog. 73, 97\u2013110 (2007)","journal-title":"J. Log. Algebr. Prog."},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-540-85845-4_40","volume-title":"KI 2008: Advances in Artificial Intelligence","author":"L Schr\u00f6der","year":"2008","unstructured":"Schr\u00f6der, L., Pattinson, D.: Shallow models for non-iterative modal logics. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS (LNAI), vol. 5243, pp. 324\u2013331. Springer, Heidelberg (2008)"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE bounds for rank-1 modal logics. ACM Trans. Comput. Log. 10,13:1\u201313:33 (2009)","DOI":"10.1145\/1462179.1462185"},{"key":"28_CR28","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1017\/S0960129510000563","volume":"21","author":"L Schr\u00f6der","year":"2011","unstructured":"Schr\u00f6der, L., Pattinson, D.: Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. Math. Struct. Comput. Sci. 21, 235\u2013266 (2011)","journal-title":"Math. Struct. Comput. Sci."},{"key":"28_CR29","unstructured":"Schr\u00f6der, L., Pattinson, D., Kupke, C.: Nominals for everyone. In: International Joint Conference on Artificial Intelligence, IJCAI 2009, pp. 917\u2013922 (2009)"},{"key":"28_CR30","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Counting in trees. In: Logic and Automata: History and Perspectives (in Honor of Wolfgang Thomas), pp. 575\u2013612. Amsterdam Univ. Press (2008)"},{"key":"28_CR31","unstructured":"Tobies, S.: Complexity results and practical algorithms for logics in knowledge representation. Ph.D. thesis, RWTH Aachen (2001)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22177-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:03:47Z","timestamp":1676959427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22177-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221762","9783319221779"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22177-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}