{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:38:28Z","timestamp":1742920708129,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030930998"},{"type":"electronic","value":"9783030931001"}],"license":[{"start":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T00:00:00Z","timestamp":1639612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T00:00:00Z","timestamp":1639612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-93100-1_19","type":"book-chapter","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T23:02:26Z","timestamp":1639609346000},"page":"301-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Propositional Dynamic Logic with Quantification over Regular Computation Sequences"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1942-7982","authenticated-orcid":false,"given":"Igor","family":"Sedl\u00e1r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,16]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/0022-0000(82)90018-6","volume":"25","author":"M Ben-Ari","year":"1982","unstructured":"Ben-Ari, M., Halpern, J.Y., Pnueli, A.: Deterministic propositional dynamic logic: finite models, complexity, and completeness. J. Comput. Syst. Sci. 25(3), 402\u2013417 (1982). https:\/\/doi.org\/10.1016\/0022-0000(82)90018-6","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"B\u00edlkov\u00e1, M., Christoff, Z., Roy, O.: Revisiting epistemic logic with names. In: Halpern, J., Perea, A. (eds.) Proceedings of the 18th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2021), pp. 39\u201354 (2021). https:\/\/doi.org\/10.4204\/EPTCS.335.4","DOI":"10.4204\/EPTCS.335.4"},{"key":"19_CR3","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)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"MJ Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18, 194\u2013211 (1979). https:\/\/doi.org\/10.1016\/0022-0000(79)90046-1","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1093\/logcom\/3.4.345","volume":"3","author":"AJ Grove","year":"1993","unstructured":"Grove, A.J., Halpern, J.Y.: Naming and identity in epistemic logics. Part I: the propositional case. J. Logic Comput. 3(4), 345\u2013378 (1993). https:\/\/doi.org\/10.1093\/logcom\/3.4.345","journal-title":"J. Logic Comput."},{"key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Leivant, D.: Propositional dynamic logic with program quantifiers. Electron. Notes Theoret. Comput. Sci. 218, 231\u2013240 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2008.10.014. Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXIV)","DOI":"10.1016\/j.entcs.2008.10.014"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1305\/ndjfl\/1093637776","volume":"29","author":"JJC Meyer","year":"1987","unstructured":"Meyer, J.J.C.: A different approach to deontic logic: deontic logic viewed as a variant of dynamic logic. Notre Dame J. Formal Logic 29(1), 109\u2013136 (1987). https:\/\/doi.org\/10.1305\/ndjfl\/1093637776","journal-title":"Notre Dame J. Formal Logic"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Meyer, J.J.C.: Dynamic logic for reasoning about actions and agents. In: Minker, J. (ed.) Logic-Based Artificial Intelligence. SECS, vol. 597, pp. 281\u2013311. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4615-1567-8_13","DOI":"10.1007\/978-1-4615-1567-8_13"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Parikh, R.: Propositional logics of programs: systems, models, and complexity. In: Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980, pp. 186\u2013192. Association for Computing Machinery, New York (1980). https:\/\/doi.org\/10.1145\/567446.567464","DOI":"10.1145\/567446.567464"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Parikh, R.: The logic of games and its applications. In: Karplnski, M., van Leeuwen, J. (eds.) Topics in the Theory of Computation, North-Holland Mathematics Studies, vol. 102, pp. 111\u2013139. North-Holland (1985). https:\/\/doi.org\/10.1016\/S0304-0208(08)73078-0","DOI":"10.1016\/S0304-0208(08)73078-0"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/23005.23008","volume":"34","author":"D Peleg","year":"1987","unstructured":"Peleg, D.: Concurrent dynamic logic. J. ACM 34(2), 450\u2013479 (1987). https:\/\/doi.org\/10.1145\/23005.23008","journal-title":"J. ACM"},{"key":"19_CR13","unstructured":"Rosenschein, S.J.: Plan synthesis: a logical perspective. In: Proceedings of the Seventh International Joint Conference on Artificial Intelligence (IJCAI 1981), pp. 331\u2013337 (1981)"},{"issue":"6","key":"19_CR14","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1093\/logcom\/10.6.787","volume":"10","author":"L Spalazzi","year":"2000","unstructured":"Spalazzi, L., Traverso, P.: A dynamic logic for acting, sensing, and planning. J. Logic Comput. 10(6), 787\u2013821 (2000). https:\/\/doi.org\/10.1093\/logcom\/10.6.787","journal-title":"J. Logic Comput."},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"MY Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Sci. 32(2), 183\u2013221 (1986). https:\/\/doi.org\/10.1016\/0022-0000(86)90026-7","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93100-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T14:09:00Z","timestamp":1726322940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93100-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,16]]},"ISBN":["9783030930998","9783030931001"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93100-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021,12,16]]},"assertion":[{"value":"16 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}