{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:44:51Z","timestamp":1763642691259},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030290252"},{"type":"electronic","value":"9783030290269"}],"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_11","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"185-202","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Gor\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f6rn","family":"Lellmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BFb0095042","volume-title":"Advanced Topics in Artificial Intelligence","author":"N Bonnette","year":"1998","unstructured":"Bonnette, N., Gor\u00e9, R.: A labelled sequent system for tense logic \n                      \n                        \n                      \n                      $$\\text{K}_{\\text{t}}$$\n                      \n                        \n                          \n                            K\n                            t\n                          \n                        \n                      \n                    . In: Antoniou, G., Slaney, J. (eds.) AI 1998. LNCS, vol. 1502, pp. 71\u201382. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/BFb0095042"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00153-009-0137-3","volume":"48","author":"K Br\u00fcnnler","year":"2009","unstructured":"Br\u00fcnnler, K.: Deep sequent systems for modal logic. Arch. Math. Log. 48, 551\u2013577 (2009)","journal-title":"Arch. Math. Log."},{"issue":"8","key":"11_CR3","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":"11_CR4","volume-title":"Handbook of Tableau Methods","author":"R Gor\u00e9","year":"1999","unstructured":"Gor\u00e9, R.: Tableau methods for modal and temporal logics. In: D\u2019Agostino, M., Gabbay, D.M., H\u00e4hnle, R., Posegga, J. (eds.) Handbook of Tableau Methods. Kluwer, Dordrecht (1999)"},{"key":"11_CR5","unstructured":"Gor\u00e9, R., Lellmann, B.: Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (extended version). CoRR abs\/1907.01270 (2019). \n                      http:\/\/arxiv.org\/abs\/1907.01270"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Gor\u00e9, R., Postniece, L., Tiu, A.: On the correspondence between display postulates and deep inference in nested sequent calculi for tense logics. Log. Methods Comput. Sci. 7(2) (2011). \n                      https:\/\/doi.org\/10.2168\/LMCS-7(2:8)2011","DOI":"10.2168\/LMCS-7(2:8)2011"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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 (LNAI), vol. 5607, pp. 205\u2013219. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02716-1_16"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/10721959_39","volume-title":"Automated Deduction - CADE-17","author":"I Horrocks","year":"2000","unstructured":"Horrocks, I., Sattler, U., Tobies, S.: Reasoning with individuals for the description logic \n                      \n                        \n                      \n                      $$\\cal{SHIQ}$$\n                      \n                        \n                          SHIQ\n                        \n                      \n                    . In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol. 1831, pp. 482\u2013496. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/10721959_39"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1017\/bsl.2016.2","volume":"22","author":"A Indrzejczak","year":"2016","unstructured":"Indrzejczak, A.: Linear time in hypersequent framework. Bull. Symb. Log. 22, 121\u2013144 (2016)","journal-title":"Bull. Symb. Log."},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01053026","volume":"53","author":"R Kashima","year":"1994","unstructured":"Kashima, R.: Cut-free sequent calculi for some tense logics. Studia Logica 53(1), 119\u2013136 (1994)","journal-title":"Studia Logica"},{"key":"11_CR11","unstructured":"Kuznets, R., Lellmann, B.: Interpolation for intermediate logics via hyper- and linear nested sequents. In: Bezhanishvili, G., D\u2019Agostino, G., Metcalfe, G., Studer, T. (eds.) Advances in Modal Logic 2018, pp. 473\u2013492. College Publications (2018)"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Lahav, O.: From frame properties to hypersequent rules in modal logics. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, 25\u201328 June 2013, pp. 408\u2013417 (2013). \n                      https:\/\/doi.org\/10.1109\/LICS.2013.47","DOI":"10.1109\/LICS.2013.47"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-24312-2_10","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"B Lellmann","year":"2015","unstructured":"Lellmann, B.: Linear nested sequents, 2-sequents and hypersequents. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 135\u2013150. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-24312-2_10"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/3288757","volume":"20","author":"B Lellmann","year":"2019","unstructured":"Lellmann, B., Pimentel, E.: Modularisation of sequent calculi for normal and non-normal modalities. ACM Trans. Comput. Logic 20(2), 7:1\u20137:46 (2019)","journal-title":"ACM Trans. Comput. Logic"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0168-0072(92)90029-Y","volume":"58","author":"A Masini","year":"1992","unstructured":"Masini, A.: 2-sequent calculus: a proof theory of modalities. Ann. Pure Appl. Logic 58, 229\u2013246 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"key":"11_CR16","first-page":"113","volume":"9","author":"M Ohnishi","year":"1957","unstructured":"Ohnishi, M., Matsumoto, K.: Gentzen method in modal calculi I. Osaka Math. J. 9, 113\u2013130 (1957)","journal-title":"Osaka Math. J."},{"key":"11_CR17","unstructured":"Parisi, A.: Second-order modal logic. Ph.D. thesis, University of Connecticut (2017)"},{"key":"11_CR18","series-title":"Trends in Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9670-8","volume-title":"Gentzen Calculi for Modal Propositional Logic","author":"F Poggiolesi","year":"2010","unstructured":"Poggiolesi, F.: Gentzen Calculi for Modal Propositional Logic. Trends in Logic, vol. 32. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-90-481-9670-8"},{"issue":"2","key":"11_CR19","first-page":"75","volume":"13","author":"K Trzesicki","year":"1984","unstructured":"Trzesicki, K.: Gentzen-style axiomatization of tense logic. Bull. Sect. Log. 13(2), 75\u201383 (1984)","journal-title":"Bull. Sect. Log."},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1093\/logcom\/4.2.125","volume":"4","author":"H Wansing","year":"1994","unstructured":"Wansing, H.: Sequent calculi for normal modal proposisional logics. J. Log. Comput. 4(2), 125\u2013142 (1994)","journal-title":"J. Log. Comput."}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:15:34Z","timestamp":1566429334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}