{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T21:51:30Z","timestamp":1778277090280,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642142024","type":"print"},{"value":"9783642142031","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14203-1_20","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T13:10:58Z","timestamp":1278940258000},"page":"225-239","source":"Crossref","is-referenced-by-count":15,"title":["Optimal and Cut-Free Tableaux for Propositional Dynamic Logic with Converse"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Gor\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Widmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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\u2013424. Springer, Heidelberg (1985)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/inco.1999.2852","volume":"162","author":"G. De Giacomo","year":"2000","unstructured":"De Giacomo, G., Massacci, F.: Combining deduction and model checking into tableaux and algorithms for Converse-PDL. Inf. and Comp.\u00a0162, 117\u2013137 (2000)","journal-title":"Inf. and Comp."},{"key":"20_CR3","first-page":"207","volume-title":"Proc. KSE-09","author":"L.A. Nguyen","year":"2009","unstructured":"Nguyen, L.A., Sza\u0142as, A.: An optimal tableau decision procedure for Converse-PDL. In: Proc. KSE-09, pp. 207\u2013214. IEEE Computer Society, Los Alamitos (2009)"},{"key":"20_CR4","first-page":"357","volume-title":"Proc. LICS-01","author":"M. Lange","year":"2001","unstructured":"Lange, M., Stirling, C.: Focus games for satisfiability and completeness of temporal logic. In: Proc. LICS-01, pp. 357\u2013365. IEEE Computer Society, Los Alamitos (2001)"},{"key":"20_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-39451-8_7","volume-title":"KI 2003: Advances in Artificial Intelligence","author":"M. Lange","year":"2003","unstructured":"Lange, M.: Satisfiability and completeness of Converse-PDL replayed. In: G\u00fcnter, A., Kruse, R., Neumann, B. (eds.) KI 2003. LNCS (LNAI), vol.\u00a02821, pp. 79\u201392. Springer, Heidelberg (2003)"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M. Vardi","year":"1986","unstructured":"Vardi, M., 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":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/978-3-642-02959-2_32","volume-title":"CADE 2009","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, vol.\u00a05663, pp. 437\u2013452. Springer, Heidelberg (2009)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-02716-1_16","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"R. Gor\u00e9","year":"2009","unstructured":"Gor\u00e9, R., Widmann, F.: Sound global state caching for ALC with inverse roles. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol.\u00a05607, pp. 205\u2013219. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14203-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T02:06:22Z","timestamp":1629425182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14203-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142024","9783642142031"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14203-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}