{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:00:26Z","timestamp":1725512426394},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540713883"},{"type":"electronic","value":"9783540713890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71389-0_15","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T20:22:53Z","timestamp":1183321373000},"page":"198-212","source":"Crossref","is-referenced-by-count":2,"title":["PDL with Intersection and Converse Is 2EXP-Complete"],"prefix":"10.1007","author":[{"given":"Stefan","family":"G\u00f6ller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Lutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.3166\/jancl.15.115-135","volume":"15","author":"L. Afanasiev","year":"2005","unstructured":"Afanasiev, L., et al.: PDL for ordered trees. Journal of Applied Non-Classical Logics\u00a015(2), 115\u2013135 (2005)","journal-title":"Journal of Applied Non-Classical Logics"},{"issue":"6","key":"15_CR2","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1093\/logcom\/13.6.939","volume":"13","author":"N. Alechina","year":"2003","unstructured":"Alechina, N., Demri, S., de Rijke, M.: A modal perspective on path constraints. Journal of Logic and Computation\u00a013(6), 939\u2013956 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Berger, R.: The undecidability of the dominoe problem. Memoirs of the American Mathematical Society\u00a066 (1966)","DOI":"10.1090\/memo\/0066"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-16066-3_5","volume-title":"Computation Theory","author":"R. Danecki","year":"1985","unstructured":"Danecki, R.: Nondeterministic Propositional Dynamic Logic with intersection is decidable. In: Skowron, A. (ed.) SCT 1984. LNCS, vol.\u00a0208, pp. 34\u201353. Springer, Heidelberg (1985)"},{"issue":"2-3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0304-3975(85)90046-5","volume":"36","author":"L. Farinas Del Cerro","year":"1985","unstructured":"Farinas Del Cerro, L., Orlowska, E.: DAL-a logic for data analysis. Theoretical Computer Science\u00a036(2-3), 251\u2013264 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences\u00a018(2), 194\u2013211 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR7","unstructured":"Giacomo, G.D., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics. In: Proc. AAAI\u201994, pp. 205\u2013212 (1994)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11874683_23","volume-title":"Computer Science Logic","author":"S. G\u00f6ller","year":"2006","unstructured":"G\u00f6ller, S., Lohrey, M.: Infinite state model-checking of propositional dynamic logics. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 349\u2013364. Springer, Heidelberg (2006)"},{"key":"15_CR9","volume-title":"Foundations of computing","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. In: Foundations of computing, MIT Press, Cambridge (2000)"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-1-4613-1139-3_2","volume-title":"Epistemic Logic and the Theory of Games and Decisions","author":"W. Hoek van der","year":"1997","unstructured":"van der Hoek, W., Meyer, J.J.: A complete epistemic logic for multiple agents \u2013 Combining distributed and common knowledge. In: Epistemic Logic and the Theory of Games and Decisions, pp. 35\u201368. Kluwer Academic Publishers, Dordrecht (1997)"},{"issue":"4","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.2178\/jsl\/1129642115","volume":"70","author":"M. Lange","year":"2005","unstructured":"Lange, M., Lutz, C.: 2-ExpTime Lower Bounds for Propositional Dynamic Logics with Intersection. Journal of Symbolic Logic\u00a070(4), 1072\u20131086 (2005)","journal-title":"Journal of Symbolic Logic"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/11538363_29","volume-title":"Computer Science Logic","author":"C. Lutz","year":"2005","unstructured":"Lutz, C.: PDL with intersection and converse is decidable. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 413\u2013427. Springer, Heidelberg (2005)"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3166\/jancl.15.189-213","volume":"15","author":"C. Lutz","year":"2005","unstructured":"Lutz, C., Walther, D.: PDL with negation of atomic programs. Journal of Applied Non-Classical Logics\u00a015(2), 189\u2013213 (2005)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/978-1-4615-1567-8_13","volume-title":"Logic-Based Artificial Intelligence","author":"J. Meyer","year":"2000","unstructured":"Meyer, J.: Dynamic logic for reasoning about actions and agents. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 281\u2013311. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"2-3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(87)90133-2","volume":"54","author":"D. Muller","year":"1987","unstructured":"Muller, D., Schupp, P.: Alternating automata on infinite trees. Theoretical Computer Science\u00a054(2-3), 267\u2013276 (1987)","journal-title":"Theoretical Computer Science"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0022-0000(80)90061-6","volume":"20","author":"V. Pratt","year":"1980","unstructured":"Pratt, V.: A near-optimal method for reasoning about action. Journal of Computer and System Sciences\u00a020, 231\u2013254 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1145\/1142351.1142398","volume-title":"Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2006)","author":"B. Cate ten","year":"2006","unstructured":"ten Cate, B.: The expressivity of XPath with transitive closure. In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2006), pp. 328\u2013337. ACM Press, New York (2006)"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/860575.860608","volume-title":"Proc. AAMAS 2003","author":"H.P. Ditmarsch van","year":"2003","unstructured":"van Ditmarsch, H.P., van der Hoek, W., Kooi, B.P.: Concurrent dynamic epistemic logic for MAS. In: Proc. AAMAS 2003, pp. 201\u2013208. ACM Press, New York (2003)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-15648-8_31","volume-title":"Logics of Programs","author":"M.Y. Vardi","year":"1985","unstructured":"Vardi, M.Y.: The taming of converse: Reasoning about two-way computations. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 413\u2013423. Springer, Heidelberg (1985)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M.Y. Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 628\u2013641. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71389-0_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:19:35Z","timestamp":1605763175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71389-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540713883","9783540713890"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71389-0_15","relation":{},"subject":[]}}