{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:12:31Z","timestamp":1748751151973,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276823"},{"type":"electronic","value":"9783319276830"}],"license":[{"start":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T00:00:00Z","timestamp":1449705600000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-27683-0_1","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T21:16:29Z","timestamp":1449695789000},"page":"1-13","source":"Crossref","is-referenced-by-count":5,"title":["Modal Logics with Hard Diamond-Free Fragments"],"prefix":"10.1007","author":[{"given":"Antonis","family":"Achilleos","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Achilleos, A.: Modal Logics with Hard Diamond-free Fragments. CoRR abs\/1401.5846 (2014)","DOI":"10.1007\/978-3-319-27683-0_1"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Achilleos, A.: Interactions and Complexity in Multi-Agent Justification Logic. Ph.D. thesis, The City University of New York (2015)","DOI":"10.1007\/978-3-319-09764-0_1"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S1755020308090060","volume":"1","author":"S Artemov","year":"2008","unstructured":"Artemov, S.: The logic of justification. Rev. Symbolic Logic 1(4), 477\u2013513 (2008)","journal-title":"Rev. Symbolic Logic"},{"key":"1_CR4","unstructured":"Chagrov, A.V., Rybakov, M.N.: How many variables does one need to prove PSPACE-hardness of modal logics. In: Advances in Modal Logic, pp. 71\u201382 (2002)"},{"volume-title":"Handbook of Tableau Methods","year":"1999","key":"1_CR5","unstructured":"Agostino, M., Gabbay, D.M., H\u00e4hnle, R., Posegga, J. (eds.): Handbook of Tableau Methods. Springer, Heidelberg (1999)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/10722086_17","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"S Demri","year":"2000","unstructured":"Demri, S.: Complexity of simple dependent bimodal logics. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847, pp. 190\u2013204. Springer, Heidelberg (2000)"},{"issue":"6","key":"1_CR7","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1093\/logcom\/11.6.933","volume":"11","author":"S Demri","year":"2001","unstructured":"Demri, S.: The complexity of regularity in grammar logics and related modal logics. J. Logic Comput. 11(6), 933\u2013960 (2001). http:\/\/logcom.oxfordjournals.org\/content\/11\/6\/933.abstract","journal-title":"J. Logic Comput."},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10849-005-5788-9","volume":"14","author":"S Demri","year":"2005","unstructured":"Demri, S., De Nivelle, H.: Deciding regular grammar logics with converse through first-order logic. J. Logic Lang. Inform. 14(3), 289\u2013329 (2005). http:\/\/dx.doi.org\/10.1007\/s10849-005-5788-9","journal-title":"J. Logic Lang. Inform."},{"key":"1_CR9","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Many-Dimensional Modal Logics Theory and Applications","year":"2003","unstructured":"Gabbay, D.M., Kurucz, A., Wolter, F., Zakharyaschev, M. (eds.): Many-Dimensional Modal Logics Theory and Applications. Studies in Logic and the Foundations of Mathematics, vol. 148. Elsevier, North Holland (2003)"},{"key":"1_CR10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning About Knowledge","author":"R Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. The MIT Press, Cambridge (1995)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0004-3702(95)00018-A","volume":"75","author":"JY Halpern","year":"1995","unstructured":"Halpern, J.Y.: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artif. Intell. 75, 361\u2013372 (1995)","journal-title":"Artif. Intell."},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"JY Halpern","year":"1992","unstructured":"Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artif. Intell. 54(3), 319\u2013379 (1992)","journal-title":"Artif. Intell."},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1093\/logcom\/11.4.609","volume":"11","author":"E Hemaspaandra","year":"2001","unstructured":"Hemaspaandra, E.: The complexity of poor Man\u2019s logic. J. Logic Comput. 11(4), 609\u2013622 (2001)","journal-title":"J. Logic Comput."},{"issue":"7","key":"1_CR14","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.jcss.2009.10.011","volume":"76","author":"E Hemaspaandra","year":"2010","unstructured":"Hemaspaandra, E., Schnoor, H., Schnoor, I.: Generalized modal satisfiability. J. Comput. Syst. Sci. 76(7), 561\u2013578 (2010). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000009001007","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/S1570-2464(07)80018-8","volume":"3","author":"A Kurucz","year":"2007","unstructured":"Kurucz, A.: Combining modal logics. Stud. Logic Pract. Reasoning 3, 869\u2013924 (2007)","journal-title":"Stud. Logic Pract. Reasoning"},{"key":"1_CR16","unstructured":"Kuznets, R.: Complexity Issues in Justification Logic. Ph.D. thesis, CUNY Graduate Center, May 2008"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"RE Ladner","year":"1977","unstructured":"Ladner, R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6(3), 467\u2013480 (1977). http:\/\/link.aip.org\/link\/?SMJ\/6\/467\/1","journal-title":"SIAM J. Comput."},{"key":"1_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5694-3","volume-title":"Multi-dimensional Modal Logic","author":"M Marx","year":"1997","unstructured":"Marx, M., Venema, Y.: Multi-dimensional Modal Logic. Springer, Heidelberg (1997)"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s11225-011-9341-3","volume":"98","author":"LA Nguyen","year":"2011","unstructured":"Nguyen, L.A., Sza\u0142as, A.: EXPTIME tableau decision procedures for regular grammar logics with converse. Stud. Logic. 98(3), 387\u2013428 (2011)","journal-title":"Stud. Logic."},{"key":"1_CR20","unstructured":"Spaan, E.: Complexity of Modal Logics. Ph.D. thesis, University of Amsterdam (1993)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27683-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:39:34Z","timestamp":1748716774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27683-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,10]]},"ISBN":["9783319276823","9783319276830"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27683-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015,12,10]]}}}