{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T13:20:21Z","timestamp":1758979221209,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_29","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"413-427","source":"Crossref","is-referenced-by-count":8,"title":["PDL with Intersection and Converse Is Decidable"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Lutz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Afanasiev, L., Blackburn, P., Dimitriou, I., Gaiffe, B., Goris, E., Marx, M., de Rijke, M.: PDL for ordered trees. Journal of Applied Non-Classical Logic (2005) (to appear)","DOI":"10.3166\/jancl.15.115-135"},{"issue":"6","key":"29_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":"29_CR3","unstructured":"Baader, F.: Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In: Proc. of IJCAI 1991, Sydney, Australia, pp. 446\u2013451 (1991)"},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FUN-2001-45302","volume":"45","author":"P. Balbiani","year":"2001","unstructured":"Balbiani, P., Vakarelov, D.: Iteration-free PDL with intersection: a complete axiomatization. Fundamenta Informaticae\u00a045, 1\u201322 (2001)","journal-title":"Fundamenta Informaticae"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-24593-3_4","volume-title":"Service-Oriented Computing - ICSOC 2003","author":"D. Berardi","year":"2003","unstructured":"Berardi, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Mecella, M.: Automatic composition of e-services that export their behavior. In: Orlowska, M.E., Weerawarana, S., Papazoglou, M.P., Yang, J. (eds.) ICSOC 2003. LNCS, vol.\u00a02910, pp. 43\u201358. Springer, Heidelberg (2003)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of PODS 1998, pp. 149\u2013158 (1998)","DOI":"10.1145\/275487.275504"},{"key":"29_CR7","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)"},{"key":"29_CR8","first-page":"103","volume-title":"Proc. of AI*IA 1995","author":"G. Giacomo De","year":"1995","unstructured":"De Giacomo, G., Lenzerini, M.: PDL-based framework for reasoning about actions. In: Proc. of AI*IA 1995, vol.\u00a0992, pp. 103\u2013114. Springer, Heidelberg (1995)"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2625","volume":"134","author":"F.M. Donini","year":"1997","unstructured":"Donini, F.M., Lenzerini, M., Nardi, D., Nutt, W.: The complexity of concept languages. Information and Computation\u00a0134(1), 1\u201358 (1997)","journal-title":"Information and Computation"},{"key":"29_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. MIT Press, Cambridge (1995)"},{"issue":"2-3","key":"29_CR11","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"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/800105.803418","volume-title":"Conference record of the ninth annual ACM Symposium on Theory of Computing","author":"M.J. Fischer","year":"1977","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional modal logic of programs. In: Conference record of the ninth annual ACM Symposium on Theory of Computing, pp. 286\u2013294. ACM Press, New York (1977)"},{"key":"29_CR13","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. J. Comput. Syst. Sci.\u00a018, 194\u2013211 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR14","first-page":"205","volume-title":"Proc. of AAAI 1994","author":"G.D. Giacomo","year":"1994","unstructured":"Giacomo, G.D., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics. In: Proc. of AAAI 1994, vol.\u00a01, pp. 205\u2013212. AAAI Press, Menlo Park (1994)"},{"key":"29_CR15","first-page":"496","volume-title":"Handbook of Philosophical Logic","author":"D. Harel","year":"1984","unstructured":"Harel, D.: Dynamic logic. In: Handbook of Philosophical Logic, vol.\u00a0II, pp. 496\u2013604. D. Reidel Publishers, Dordrecht (1984)"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/BFb0012782","volume-title":"Automata, Languages, and Programming","author":"D. Kozen","year":"1982","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. In Automata, Languages and Programming. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol.\u00a0140, pp. 348\u2013359. Springer, Heidelberg (1982)"},{"key":"29_CR17","unstructured":"Lange, M.: A lower complexity bound for propositional dynamic logic with intersection. In: Advances in Modal Logic, vol.\u00a05, King\u2019s College Publications (2005)"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Lange, M., Lutz, C.: 2-ExpTime lower bounds for propositional dynamic logics with intersection (2005) (submitted)","DOI":"10.2178\/jsl\/1129642115"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Lutz, C.: PDL with intersection and converse is decidable. LTCS-Report 05-05, Technical University Dresden (2005), Available from http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.1007\/11538363_29"},{"key":"29_CR20","unstructured":"Lutz, C., Sattler, U.: Mary likes all cats. In: Proc. of DL 2000. CEUR-WS, vol.\u00a033, pp. 213\u2013226 (2000), http:\/\/ceur-ws.org\/"},{"key":"29_CR21","first-page":"193","volume-title":"Proc. of IJCAI 2001","author":"F. Massacci","year":"2001","unstructured":"Massacci, F.: Decision procedures for expressive description logics with role intersection, composition and converse. In: Proc. of IJCAI 2001, San Francisco, CA, August 4-10, pp. 193\u2013198. Morgan Kaufmann Publishers, Inc., San Francisco (2001)"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Pratt, V.: Considerations on floyd-hoare logic. In: FOCS: IEEE Symposium on Foundations of Computer Science, FOCS (1976)","DOI":"10.1109\/SFCS.1976.27"},{"key":"29_CR23","first-page":"466","volume-title":"Proc. of IJCAI 1991","author":"K.D. Schild","year":"1991","unstructured":"Schild, K.D.: A correspondence theory for terminological logics: Preliminary report. In: Proc. of IJCAI 1991, pp. 466\u2013471. Morgan Kaufmann, San Francisco (1991)"},{"key":"29_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences\u00a032, 183\u2013221 (1986)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:38:36Z","timestamp":1736005116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11538363_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}