{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T19:40:06Z","timestamp":1736710806519,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676973"},{"type":"electronic","value":"9783540450085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10722086_17","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T00:43:15Z","timestamp":1167439395000},"page":"190-204","source":"Crossref","is-referenced-by-count":7,"title":["Complexity of Simple Dependent Bimodal Logics"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Demri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Baldoni, M.: Normal Multimodal Logics: Automated Deduction and Logic Programming. PhD thesis, Universit\u00e1 degli Studi di Torino (1998)"},{"key":"17_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-69778-0_15","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"B. Beckert","year":"1998","unstructured":"Beckert, B., Gabbay, D.: Fibring semantic tableaux. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol.\u00a01397, pp. 77\u201392. Springer, Heidelberg (1998)"},{"key":"17_CR3","unstructured":"van Benthem, J.: Modal logic and classical logic. Bibliopolis (1985)"},{"key":"17_CR4","unstructured":"van Benthem, J.: Modal logic in two Gestalts. Technical report, ILLC (1998)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic (2000) (to appear)","DOI":"10.1017\/CBO9781107050884"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Castilho, M., Gasquet, O., Herzig, A.: Formalizing action and change in modal logic I: the frame problem. J. of Logic and Computation (1998) (to appear)","DOI":"10.1093\/logcom\/9.5.701"},{"key":"17_CR7","unstructured":"Castilho, M., Herzig, A.: An alternative to the iteration operator of propositional dynamic logic. Technical Report 96-05-R, IRIT (1996)"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1093\/jigpal\/5.2.287","volume":"5","author":"S. Cerrito","year":"1997","unstructured":"Cerrito, S., Cialdea Mayer, M.: A polynomial translation of S4 into T and contraction-free tableaux for S4. Logic Journal of the IGPL\u00a05(2), 287\u2013300 (1997)","journal-title":"Logic Journal of the IGPL"},{"key":"17_CR9","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. Clarendon Press, Oxford (1997)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-58140-5_8","volume-title":"Logical Foundations of Computer Science","author":"C. Chen","year":"1994","unstructured":"Chen, C., Lin, I.: The complexity of propositional modal theories and the complexity of consistency of propositional modal theories. In: Matiyasevich, Y.V., Nerode, A. (eds.) LFCS 1994. LNCS, vol.\u00a0813, pp. 69\u201380. Springer, Heidelberg (1994)"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(97)00157-6","volume":"195","author":"S. Demri","year":"1998","unstructured":"Demri, S.: A class of decidable information logics. TCS\u00a0195(1), 33\u201360 (1998)","journal-title":"TCS"},{"key":"17_CR12","unstructured":"Fine, K., Schurz, G.: Transfer theorems for multimodal logics. Logic and Reality. Essays in Pure and Applied Logic.In: Memory of Arthur Prior. OUP (1992) (to appear)"},{"key":"17_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-2794-5","volume-title":"Proof methods for modal and intuitionistic logics","author":"M. Fitting","year":"1983","unstructured":"Fitting, M.: Proof methods for modal and intuitionistic logics. D. Reidel Publishing Co., Dordrechtz (1983)"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00244394","volume":"4","author":"M. Fitting","year":"1988","unstructured":"Fitting, M.: First-order modal tableaux. JAR\u00a04, 191\u2013213 (1988)","journal-title":"JAR"},{"issue":"4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.2307\/2275807","volume":"61","author":"D. Gabbay","year":"1996","unstructured":"Gabbay, D.: Fibred semantics and the weaving of logics Part 1: modal and intuitionistic logics. The Journal of Symbolic Logic\u00a061(4), 1057\u20131120 (1996)","journal-title":"The Journal of Symbolic Logic"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1093\/jigpal\/6.1.73","volume":"6","author":"D. Gabbay","year":"1998","unstructured":"Gabbay, D., Shehtman, V.: Products of modal logics, Part I. Logic Journal of the IGPL\u00a06(1), 73\u2013146 (1998)","journal-title":"Logic Journal of the IGPL"},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-94-017-1754-0_6","volume-title":"Handbook of Tableaux Methods","author":"R. Gor\u00e9","year":"1999","unstructured":"Gor\u00e9, R.: Tableaux methods for modal and temporal logics. In: d\u2019Agostino, M., Gabbay, D., H\u00e4hnle, R., Posegga, J. (eds.) Handbook of Tableaux Methods, pp. 297\u2013396. Kluwer, Dordrecht (1999)"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"J. Halpern","year":"1992","unstructured":"Halpern, J., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence\u00a054, 319\u2013379 (1992)","journal-title":"Artificial Intelligence"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, E.: Complexity transfer for modal logic (extended abstract). In: LICS-9, pp. 164\u2013173 (1994)","DOI":"10.1109\/LICS.1994.316074"},{"key":"17_CR20","unstructured":"Heuerding, A.: Sequent Calculi for Proof Search in Some Modal Logics. PhD thesis, University of Bern (1998)"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1004900300438","volume":"59","author":"M. Kracht","year":"1997","unstructured":"Kracht, M., Wolter, F.: Simulation and transfer results in modal logic - A survey. Studia Logica\u00a059, 149\u2013177 (1997)","journal-title":"Studia Logica"},{"issue":"3","key":"17_CR22","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R. Ladner","year":"1977","unstructured":"Ladner, R.: The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing\u00a06(3), 467\u2013480 (1977)","journal-title":"SIAM Journal of Computing"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Marx, M.: Complexity of modal logics of relations. Technical report, ILLC, To appear in Annals of Pure and Applied Logic (1997)","DOI":"10.1007\/978-94-011-5694-3_5"},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1093\/logcom\/9.2.197","volume":"9","author":"M. Marx","year":"1999","unstructured":"Marx, M.: Complexity of products of modal logics. Journal of Logic and Computation\u00a09(2), 197\u2013214 (1999)","journal-title":"Journal of Logic and Computation"},{"issue":"6","key":"17_CR25","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1093\/jigpal\/7.6.755","volume":"7","author":"M. Marx","year":"1999","unstructured":"Marx, M., Mikul\u00e1s, S., Schlobach, S.: Tableau calculus for local cubic modal logic and its implementation. Logic Journal of the IGPL\u00a07(6), 755\u2013778 (1999)","journal-title":"Logic Journal of the IGPL"},{"key":"17_CR26","unstructured":"Massacci, F.: Single steps tableaux for modal logics. JAR (1999) (to appear)"},{"key":"17_CR27","volume-title":"Computational Complexity","author":"C.. Papadimitriou","year":"1994","unstructured":"Papadimitriou, Ch.: Computational Complexity. Addison-Wesley Publishing Company, Reading (1994)"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Pratt, V.: Models of program logics. In: Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pp. 115\u2013122 (1979)","DOI":"10.1109\/SFCS.1979.24"},{"issue":"3","key":"17_CR29","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A. Sistla","year":"1985","unstructured":"Sistla, A., Clarke, E.: The complexity of propositional linear temporal logic. JACM\u00a032(3), 733\u2013749 (1985)","journal-title":"JACM"},{"key":"17_CR30","unstructured":"Spaan, E.: Complexity of Modal Logics. PhD thesis, ILLC (1993)"},{"key":"17_CR31","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-94-015-8242-1_10","volume-title":"Diamonds and Defaults","author":"E. Spaan","year":"1993","unstructured":"Spaan, E.: The complexity of propositional tense logics. In: de Rijke, M. (ed.) Diamonds and Defaults, pp. 287\u2013309. Kluwer, Dordrecht (1993)"},{"key":"17_CR32","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1145\/115234.115350","volume":"38","author":"M. Tiomkin","year":"1991","unstructured":"Tiomkin, M., Kaminsky, M.: Nonmonotonic default modal logics. JACM\u00a038, 963\u2013984 (1991)","journal-title":"JACM"},{"key":"17_CR33","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-1-4613-0609-2_27","volume-title":"Mathematical Logic","author":"D. Vakarelov","year":"1990","unstructured":"Vakarelov, D.: Modal characterization of the classes of finite and infinite quasiordered sets. In: Petkov, P. (ed.) Mathematical Logic, pp. 373\u2013387. Plenum Press, New-York (1990)"},{"key":"17_CR34","first-page":"433","volume":"90","author":"D. Vakarelov","year":"1991","unstructured":"Vakarelov, D.: Modal logics for knowledge representation systems. TCS\u00a090, 433\u2013456 (1991)","journal-title":"TCS"},{"key":"17_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3208-5","volume-title":"Labelled Non-Classical Logics","author":"L. Vigan\u00f2","year":"2000","unstructured":"Vigan\u00f2, L.: Labelled Non-Classical Logics. Kluwer, Dordrecht (2000)"},{"key":"17_CR36","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0168-0072(93)E0079-4","volume":"73","author":"A. Visser","year":"1995","unstructured":"Visser, A.: A course on bimodal provability logic. Annals of Pure and Applied Logic\u00a073, 109\u2013142 (1995)","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10722086_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T19:05:14Z","timestamp":1736708714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722086_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676973","9783540450085"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/10722086_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}