{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:05:33Z","timestamp":1762459533982,"version":"3.37.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319720555"},{"type":"electronic","value":"9783319720562"}],"license":[{"start":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T00:00:00Z","timestamp":1511827200000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-72056-2_1","type":"book-chapter","created":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T09:33:31Z","timestamp":1511775211000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Completeness Problem for Modal Logic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1314-333X","authenticated-orcid":false,"given":"Antonis","family":"Achilleos","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,28]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1_CR2","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1093\/logcom\/exm029","volume":"17","author":"JY Halpern","year":"2007","unstructured":"Halpern, J.Y., R\u00eago, L.C.: Characterizing the NP-PSPACE gap in the satisfiability problem for modal logic. J. Logic Comput. 17(4), 795\u2013806 (2007)","journal-title":"J. Logic Comput."},{"issue":"3","key":"1_CR3","doi-asserted-by":"crossref","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."},{"key":"1_CR4","unstructured":"Artemov, S.: Syntactic epistemic logic. In: Book of Abstracts, 15th Congress of Logic, Methodology and Philosophy of Science CLMPS 2015, pp. 109\u2013110 (2015)"},{"key":"1_CR5","unstructured":"Artemov, S.: Syntactic epistemic logic and games (2016)"},{"issue":"1","key":"1_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM (JACM) 32(1), 137\u2013161 (1985)","journal-title":"J. ACM (JACM)"},{"key":"1_CR7","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc., Upper Saddle River (1989)"},{"issue":"1\u20133","key":"1_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(86)80031-6","volume":"68","author":"S Graf","year":"1986","unstructured":"Graf, S., Sifakis, J.: A modal characterization of observational congruence on finite terms of CCS. Inf. Control 68(1\u20133), 125\u2013145 (1986)","journal-title":"Inf. Control"},{"issue":"1","key":"1_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1006\/inco.1994.1028","volume":"110","author":"B Steffen","year":"1994","unstructured":"Steffen, B., Ing\u00f3lfsd\u00f3ttir, A.: Characteristic formulas for processes with divergence. Inf. Comput. 110(1), 149\u2013163 (1994)","journal-title":"Inf. Comput."},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S1571-0661(05)80257-9","volume":"18","author":"M Mller-Olm","year":"1998","unstructured":"Mller-Olm, M.: Derivation of characteristic formulae. Electr. Notes Theor. Comput. Sci. 18, 159\u2013170 (1998)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-662-48057-1_6","volume-title":"Mathematical Foundations of Computer Science 2015","author":"L Aceto","year":"2015","unstructured":"Aceto, L., Della Monica, D., F\u00e1bregas, I., Ing\u00f3lfsd\u00f3ttir, A.: When are prime formulae characteristic? In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 76\u201388. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48057-1_6"},{"issue":"2","key":"1_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1305\/ndjfl\/1093891703","volume":"16","author":"K Fine","year":"1975","unstructured":"Fine, K.: Normal forms in modal logic. Notre Dame J. Formal Logic 16(2), 229\u2013237 (1975)","journal-title":"Notre Dame J. Formal Logic"},{"key":"1_CR13","unstructured":"Achilleos, A.: The completeness problem for modal logic. CoRR abs\/1605.01004 (2016)"},{"key":"1_CR14","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. Cambridge University Press, Cambridge (2001)"},{"key":"1_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537793.001.0001","volume-title":"Modal Logic","author":"A Chagrov","year":"1997","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford University Press, Oxford (1997)"},{"issue":"6","key":"1_CR16","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1305\/ndjfl\/1093894722","volume":"13","author":"M Fitting","year":"1972","unstructured":"Fitting, M.: Tableau methods of proof for modal logics. Notre Dame J. Formal Logic 13(2), 237\u2013247 (1972)","journal-title":"Notre Dame J. Formal Logic"},{"issue":"3","key":"1_CR18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1006155811656","volume":"24","author":"F Massacci","year":"2000","unstructured":"Massacci, F.: Single step tableaux for modal logics. J. Autom. Reasoning 24(3), 319\u2013364 (2000)","journal-title":"J. Autom. Reasoning"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1754-0","volume-title":"Handbook of Tableau Methods","author":"M D\u2019Agostino","year":"1999","unstructured":"D\u2019Agostino, M., Gabbay, D.M., H\u00e4hnle, R., Posegga, J.: Handbook of Tableau Methods. Springer, Dordrecht (1999). https:\/\/doi.org\/10.1007\/978-94-017-1754-0"},{"issue":"1\u20133","key":"1_CR20","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","volume":"55","author":"A Blass","year":"1982","unstructured":"Blass, A., Gurevich, Y.: On the unique satisfiability problem. Inf. Control 55(1\u20133), 80\u201388 (1982)","journal-title":"Inf. Control"},{"issue":"6","key":"1_CR21","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s10992-007-9052-4","volume":"36","author":"LS Moss","year":"2007","unstructured":"Moss, L.S.: Finite models constructed from canonical formulas. J. Philos. Logic 36(6), 605\u2013640 (2007)","journal-title":"J. Philos. Logic"}],"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-72056-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,29]],"date-time":"2024-06-29T02:17:08Z","timestamp":1719627428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72056-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,28]]},"ISBN":["9783319720555","9783319720562"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72056-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,11,28]]}}}