{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:11:18Z","timestamp":1781086278032,"version":"3.54.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030290252","type":"print"},{"value":"9783030290269","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29026-9_19","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"335-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic"],"prefix":"10.1007","author":[{"given":"Simon","family":"Docherty","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reuben N. S.","family":"Rowe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"issue":"2","key":"19_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. J. Appl. Non-Classical Logics 15(2), 115\u2013135 (2005)","journal-title":"J. Appl. Non-Classical Logics"},{"key":"19_CR2","unstructured":"Alberucci, L.: The Modal $$\\mu $$ -calculus and the Logic of Common Knowledge. Ph.D. thesis, Universit\u00e4t Bern (2002)"},{"issue":"3\u20134","key":"19_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.3166\/jancl.13.231-276","volume":"13","author":"P Balbiani","year":"2003","unstructured":"Balbiani, P., Vakarelov, D.: PDL with intersection of programs: a complete axiomatization. J. Appl. Non-Classical Logics 13(3\u20134), 231\u2013276 (2003)","journal-title":"J. Appl. Non-Classical Logics"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s11225-006-8301-9","volume":"83","author":"J Benthem Van","year":"2006","unstructured":"Van Benthem, J.: Modal frame correspondences and fixed-points. Studia Logica 83(1), 133\u2013155 (2006)","journal-title":"Studia Logica"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-35182-2_25","volume-title":"Programming Languages and Systems","author":"J Brotherston","year":"2012","unstructured":"Brotherston, J., Gorogiannis, N., Petersen, R.L.: A generic cyclic theorem prover. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 350\u2013367. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35182-2_25"},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1093\/logcom\/exq052","volume":"21","author":"J Brotherston","year":"2011","unstructured":"Brotherston, J., Simpson, A.: Sequent calculi for induction and infinite descent. J. Log. Comput. 21(6), 1177\u20131216 (2011)","journal-title":"J. Log. Comput."},{"key":"19_CR7","first-page":"74","volume-title":"Advances in Modal Logic","author":"F Carreiro","year":"2014","unstructured":"Carreiro, F., de Venema, Y.: PDL inside the $$\\mu $$ -calculus: a syntactic and an automata-theoretic characterization. In: Gor\u00e9, R., Kooi, B., Kurucz, A. (eds.) Advances in Modal Logic, vol. 10, pp. 74\u201393. CSLI Publications, San Diego (2014)"},{"key":"19_CR8","unstructured":"Cohen, L., Rowe, R.N.S.: Uniform inductive reasoning in transitive closure logic via infinite descent. In: 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, Birmingham, UK, 4\u20137 September 2018, pp. 17:1\u201317:16 (2018)"},{"key":"19_CR9","first-page":"261","volume-title":"Lecture Notes in Computer Science","author":"Anupam Das","year":"2017","unstructured":"Das, A., Pous, D.: A cut-free cyclic proof system for Kleene algebra. In: Automated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference, Proceedings, TABLEAUX 2017, Bras\u00edlia, Brazil, 25\u201328 September 2017, pp. 261\u2013277 (2017)"},{"key":"19_CR10","unstructured":"Das, A., Pous, D.: Non-wellfounded proof theory for (Kleene+action)(algebras+lattices). In: 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, Birmingham, UK, 4\u20137 September 2018, pp. 19:1\u201319:18 (2018)"},{"key":"19_CR11","unstructured":"De Giacomo, G., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics. In: Proceedings of the Twelfth National Conference on Artificial Intelligence, AAAI 1994, vol. 1, pp. 205\u2013212. American Association for Artificial Intelligence, Menlo Park (1994)"},{"issue":"8","key":"19_CR12","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Commun. ACM 22(8), 465\u2013476 (1979)","journal-title":"Commun. ACM"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Docherty, S., Rowe, R.N.S.: A non-wellfounded, labelled proof system for propositional dynamic logic. CoRR, abs\/1905.06143 (2019)","DOI":"10.1007\/978-3-030-29026-9_19"},{"issue":"2","key":"19_CR14","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(2), 194\u2013211 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR15","series-title":"Synthese Library","doi-asserted-by":"publisher","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. Synthese Library. Springer, Dordrecht (1983). https:\/\/doi.org\/10.1007\/978-94-017-2794-5"},{"issue":"6","key":"19_CR16","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1093\/logcom\/exu064","volume":"26","author":"S Frittella","year":"2014","unstructured":"Frittella, S., Greco, G., Kurz, A., Palmigiano, A.: Multi-type display calculus for propositional dynamic logic. J. Log. Comput. 26(6), 2067\u20132104 (2014)","journal-title":"J. Log. Comput."},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF00173700","volume":"5","author":"G Giacomo De","year":"1996","unstructured":"De Giacomo, G.: Eliminating \u201cconverse\u201d from converse PDL. J. Log. Lang. Inf. 5(2), 193\u2013208 (1996)","journal-title":"J. Log. Lang. Inf."},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/inco.1999.2852","volume":"162","author":"G Giacomo De","year":"2000","unstructured":"De Giacomo, G., Massacci, F.: Combining deduction and model checking into tableaux and algorithms for converse-PDL. Inf. Comput. 162(1), 117\u2013137 (2000)","journal-title":"Inf. Comput."},{"key":"19_CR19","first-page":"239","volume-title":"Advances in Modal Logic","author":"P Girard","year":"2012","unstructured":"Girard, P., Seligman, J., Liu, F.: General dynamic dynamic logic. In: Bolander, T., Bra\u00fcner, T., Ghilardi, S., Moss, L. (eds.) Advances in Modal Logic, vol. 9, pp. 239\u2013260. CSLI Publications, Stanford (2012)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-02959-2_32","volume-title":"Automated Deduction \u2013 CADE-22","author":"R Gor\u00e9","year":"2009","unstructured":"Gor\u00e9, R., Widmann, F.: An optimal on-the-fly tableau-based decision procedure for PDL-satisfiability. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 437\u2013452. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02959-2_32"},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00628304","volume":"14","author":"J Groenendijk","year":"1991","unstructured":"Groenendijk, J., Stokhof, M.: Dynamic predicate logic. Linguist. Philos. 14(1), 39\u2013100 (1991)","journal-title":"Linguist. Philos."},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-94-009-6259-0_10","volume-title":"Handbook of Philosophical Logic: Volume II: Extensions of Classical Logic","author":"D Harel","year":"1984","unstructured":"Harel, D.: Dynamic logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic: Volume II: Extensions of Classical Logic, vol. 165, pp. 497\u2013604. Springer, Dordrecht (1984). https:\/\/doi.org\/10.1007\/978-94-009-6259-0_10"},{"key":"19_CR23","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D Harel","year":"2000","unstructured":"Harel, D., Tiuryn, J., Kozen, D.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"issue":"1","key":"19_CR24","first-page":"47","volume":"94","author":"B Hill","year":"2010","unstructured":"Hill, B., Poggiolesi, F.: A contraction-free and cut-free sequent calculus for propositional dynamic logic. Stud. Log. Int. J. Symb. Log. 94(1), 47\u201372 (2010)","journal-title":"Stud. Log. Int. J. Symb. Log."},{"key":"19_CR25","volume-title":"Provability in Logic","author":"S Kanger","year":"1957","unstructured":"Kanger, S.: Provability in Logic. Almqvist & Wiksell, Stockholm (1957)"},{"issue":"3","key":"19_CR26","doi-asserted-by":"publisher","first-page":"935","DOI":"10.2178\/jsl\/1096901777","volume":"69","author":"T Kowalski","year":"2004","unstructured":"Kowalski, T.: Retraction note for \u201cPDL has interpolation\u201d. J. Symb. Log. 69(3), 935\u2013936 (2004)","journal-title":"J. Symb. Log."},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Kracht, M.: Dynamic logic. In: Tools and Techniques in Modal Logic, volume 142 of Studies in Logic and the Foundations of Mathematics, pp. 497\u2013533. Elsevier (1999)","DOI":"10.1016\/S0049-237X(99)80012-3"},{"issue":"5","key":"19_CR28","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10992-005-2267-3","volume":"34","author":"S Negri","year":"2005","unstructured":"Negri, S.: Proof analysis in modal logic. J. Philos. Log. 34(5), 507 (2005)","journal-title":"J. Philos. Log."},{"issue":"8","key":"19_CR29","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1111\/j.1747-9991.2011.00418.x","volume":"6","author":"S Negri","year":"2011","unstructured":"Negri, S.: Proof theory for modal logic. Philos. Compass 6(8), 523\u2013538 (2011)","journal-title":"Philos. Compass"},{"issue":"1","key":"19_CR30","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(95)00136-0","volume":"163","author":"D Niwi\u0144ski","year":"1996","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Games for the $$\\mu $$ -calculus. Theor. Comput. Sci. 163(1), 99\u2013116 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Parikh, R.: Propositional game logic. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science, SFCS 1983, pp. 195\u2013200. IEEE Computer Society, Washington, DC (1983)","DOI":"10.1109\/SFCS.1983.47"},{"issue":"2","key":"19_CR32","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0890-5401(91)90026-X","volume":"93","author":"S Passy","year":"1991","unstructured":"Passy, S., Tinchev, T.: An essay in combinatory dynamic logic. Inf. Comput. 93(2), 263\u2013332 (1991)","journal-title":"Inf. Comput."},{"issue":"2","key":"19_CR33","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10817-008-9103-8","volume":"41","author":"A Platzer","year":"2008","unstructured":"Platzer, A.: Differential dynamic logic for hybrid systems. J. Autom. Reason. 41(2), 143\u2013189 (2008)","journal-title":"J. Autom. Reason."},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Semantical consideration on Floyd-Hoare logic. In: 17th Annual Symposium on Foundations of Computer Science (SFCS 1976), pp. 109\u2013121, October 1976","DOI":"10.1109\/SFCS.1976.27"},{"issue":"1","key":"19_CR35","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10849-007-9051-4","volume":"17","author":"GR Lavalette de","year":"2008","unstructured":"de Lavalette, G.R., Kooi, B., Verbrugge, R.: Strong completeness and limited canonicity for PDL. J. Log. Lang. Inf. 17(1), 69\u201387 (2008)","journal-title":"J. Log. Lang. Inf."},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Rowe, R.N.S., Brotherston, J.: Automatic cyclic termination proofs for recursive procedures in separation logic. In: Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2017, Paris, France, 16\u201317 January 2017, pp. 53\u201365 (2017)","DOI":"10.1145\/3018610.3018623"},{"issue":"3","key":"19_CR37","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1134\/S0001434614090326","volume":"96","author":"DS Shamkanov","year":"2014","unstructured":"Shamkanov, D.S.: Circular proofs for the G\u00f6del-L\u00f6b provability logic. Math. Notes 96(3), 575\u2013585 (2014)","journal-title":"Math. Notes"},{"key":"19_CR38","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-319-63046-5_30","volume-title":"Automated Deduction \u2013 CADE 26","author":"Gadi Tellez","year":"2017","unstructured":"Tellez, G., Brotherston, J.: Automatically verifying temporal properties of pointer programs with cyclic proof. In: Automated Deduction - CADE 26\u201326th International Conference on Automated Deduction, Proceedings, Gothenburg, Sweden, 6\u201311 August 2017, pp. 491\u2013508 (2017)"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Visser, A.: L\u00f6b\u2019s Logic Meets the $$\\mu $$ -Calculus, pp. 14\u201325. Springer, Heidelberg (2005)","DOI":"10.1007\/11601548_3"},{"key":"19_CR40","unstructured":"Wehbe, R.: Annotated Systems for Common Knowledge. Ph.D. thesis, Universit\u00e4t Bern (2010)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29026-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T22:42:04Z","timestamp":1575585724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2019.org\/","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":"43","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":"25","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":"58% - 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.2","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","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)"}}]}}