{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:44:37Z","timestamp":1725489877265},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_28","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"358-373","source":"Crossref","is-referenced-by-count":2,"title":["On the Complexity of Reasoning About Dynamic Policies"],"prefix":"10.1007","author":[{"given":"Stefan","family":"G\u00f6ller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the Association for Computing Machinery\u00a028(1), 114\u2013133 (1981)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"28_CR2","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.) Computation Theory. LNCS, vol.\u00a0208, pp. 34\u201353. Springer, Heidelberg (1985)"},{"issue":"5","key":"28_CR3","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1093\/logcom\/exi043","volume":"15","author":"S. Demri","year":"2005","unstructured":"Demri, S.: A reduction from DLP to PDL. Journal of Logic and Computation\u00a015(5), 767\u2013785 (2005)","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"28_CR4","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":"28_CR5","first-page":"198","volume-title":"Proc. of FoSSaCS 2007","author":"S. G\u00f6ller","year":"2007","unstructured":"G\u00f6ller, S., Lohrey, M., Lutz, C.: PDL with Intersection and Converse is 2EXP-Complete. In: Proc. of FoSSaCS 2007, vol.\u00a04423, pp. 198\u2013212. Springer, Heidelberg (2007)"},{"issue":"4","key":"28_CR6","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":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/978-3-540-24597-1_26","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"C. L\u00f6ding","year":"2003","unstructured":"L\u00f6ding, C., Rohde, P.: Model Checking and Satisfiability for Sabotage Modal Logic. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol.\u00a02914, pp. 302\u2013313. Springer, Heidelberg (2003)"},{"issue":"2","key":"28_CR8","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 Logic\u00a015(2), 189\u2013214 (2005)","journal-title":"Journal of Applied Non-Classical Logic"},{"key":"28_CR9","first-page":"326","volume-title":"Proc. of STOC 1980","author":"V.R. Pratt","year":"1978","unstructured":"Pratt, V.R.: A Practical Decision Method for Propositional Dynamic Logic: Preliminary Report. In: Proc. of STOC 1980, pp. 326\u2013337. ACM Press, New York (1978)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/978-3-540-24727-2_32","volume-title":"Foundations of Software Science and Computation Structures","author":"R. Pucella","year":"2004","unstructured":"Pucella, R., Weissman, V.: Reasoning about Dynamic Policies. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 453\u2013467. Springer, Heidelberg (2004)"},{"key":"28_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/978-3-540-32254-2_16","volume-title":"Mechanizing Mathematical Reasoning","author":"J. Benthem van","year":"2005","unstructured":"van Benthem, J.: An Essay on Sabotage and Obstruction. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning. LNCS (LNAI), vol.\u00a02605, pp. 268\u2013276. Springer, Heidelberg (2005)"},{"issue":"3","key":"28_CR12","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1093\/logcom\/6.3.465","volume":"6","author":"R. Meyden van der","year":"1996","unstructured":"van der Meyden, R.: The Dynamic Logic of Permission. Journal of Logic and Computation\u00a06(3), 465\u2013479 (1996)","journal-title":"Journal of Logic and Computation"},{"key":"28_CR13","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)"},{"issue":"2","key":"28_CR14","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 Logics of Programs. Journal of Computer and System Sciences\u00a032(2), 183\u2013221 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR15","unstructured":"Wieringa, R.J., Meyer, J.-J.C.: Applications of Deontic Logic in Computer Science: A Concise Overview. In: Deontic Logic in Computer Science, pp. 17\u201340 (1993)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:50Z","timestamp":1619520350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}