{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:10:33Z","timestamp":1726042233974},"publisher-location":"Cham","reference-count":23,"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_6","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"94-110","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bounded Sequent Calculi for Non-classical Logics via Hypersequents"],"prefix":"10.1007","author":[{"given":"Agata","family":"Ciabattoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Revantha","family":"Ramanayake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"939","DOI":"10.2307\/2273828","volume":"52","author":"A Avron","year":"1987","unstructured":"Avron, A.: A constructive analysis of RM. J. Symbol. Logic 52(4), 939\u2013951 (1987)","journal-title":"J. Symbol. Logic"},{"issue":"3\u20134","key":"6_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A Avron","year":"1991","unstructured":"Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artif. Intell. 4(3\u20134), 225\u2013248 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Logic: From Foundations to Applications (Staffordshire, 1993), pp. 1\u201332. Oxford Sci. Publ., Oxford Univ. Press, New York (1996)","DOI":"10.1093\/oso\/9780198538622.003.0001"},{"issue":"12","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1016\/j.apal.2014.07.005","volume":"165","author":"N Bezhanishvili","year":"2014","unstructured":"Bezhanishvili, N., Ghilardi, S.: The bounded proof property via step algebras and step frames. Ann. Pure Appl. Logic 165(12), 1832\u20131863 (2014)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"7","key":"6_CR5","first-page":"2135","volume":"27","author":"N Bezhanishvili","year":"2016","unstructured":"Bezhanishvili, N., Ghilardi, S., Lauridsen, F.M.: One-step heyting algebras and hypersequent calculi with the bounded proof property. J. Logic Comput. 27(7), 2135\u20132169 (2016)","journal-title":"J. Logic Comput."},{"key":"6_CR6","first-page":"229","volume":"2008","author":"A Ciabattoni","year":"2008","unstructured":"Ciabattoni, A., Galatos, N., Terui, K.: From axioms to analytic rules in nonclassical logics. LICS 2008, 229\u2013240 (2008)","journal-title":"LICS"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02176170","volume":"37","author":"Melvin Fitting","year":"1978","unstructured":"Fitting, M.: Subformula results in some propositional modal logics. Studia Logica 37(4), 387\u2013391 (1979), (1978)","journal-title":"Studia Logica"},{"key":"6_CR8","unstructured":"Galatos, N., Jipsen, P., Kowalski, T., Ono, H.: Residuated lattices: analgebraic glimpse at substructural logics. Studies in Logic and the Foundations of Mathematics, vol. 151. Elsevier (2007)"},{"issue":"31","key":"6_CR9","doi-asserted-by":"publisher","first-page":"3992","DOI":"10.1016\/j.tcs.2011.04.004","volume":"412","author":"R Horc\u00edk","year":"2011","unstructured":"Horc\u00edk, R., Terui, K.: Disjunction property and complexity of substructural logics. Theor. Comput. Sci. 412(31), 3992\u20134006 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1305\/ndjfl\/1094061862","volume":"35","author":"R Hori","year":"1994","unstructured":"Hori, R., Ono, H., Schellinx, H.: Extending intuitionistic linear logic with knotted structural rules. Notre Dame J. Formal Logic\u2018 35(2), 219\u2013242 (1994)","journal-title":"Notre Dame J. Formal Logic\u2018"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1017586008091","volume":"11","author":"N Kamide","year":"2002","unstructured":"Kamide, N.: Substructural logics with mingle. J. Logic Lang. Inform. 11(2), 227\u2013249 (2002)","journal-title":"J. Logic Lang. Inform."},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1017\/S175502031600040X","volume":"10","author":"T Kowalski","year":"2017","unstructured":"Kowalski, T., Ono, H.: Analytic cut and interpolation for bi-intuitionistic logic. Rev. Symbolic Logic 10(2), 259\u2013283 (2017)","journal-title":"Rev. Symbolic Logic"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-10061-6_4","volume-title":"New Frontiers in Artificial Intelligence","author":"H Kurokawa","year":"2014","unstructured":"Kurokawa, H.: Hypersequent calculi for modal logics extending S4. In: Nakano, Y., Satoh, K., Bekki, D. (eds.) JSAI-isAI 2013. LNCS (LNAI), vol. 8417, pp. 51\u201368. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10061-6_4"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Lahav, O.: From frame properties to hypersequent rules in modal logics. In: LICS 2013, IEEE. pp. 408\u2013417 (2013)","DOI":"10.1109\/LICS.2013.47"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Lahav, O., Zohar, Y.: On the construction of analytic sequent calculi for sub-classical logics. In: 21st International Workshop, WoLLIC 2014, Proceedings, pp. 206\u2013220 (2014)","DOI":"10.1007\/978-3-662-44145-9_15"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2016.10.004","volume":"656","author":"B Lellmann","year":"2016","unstructured":"Lellmann, B.: Hypersequent rules with restricted contexts for propositional modal logics. Theor. Comput. Sci. 656, 76\u2013105 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ijar.2007.04.003","volume":"47","author":"E Marchioni","year":"2008","unstructured":"Marchioni, E., Montagna, F.: On triangular norms and uninorms definable in \u0142 $$\\pi \\frac{1}{2}$$ . Int. J. Approx. Reason. 47(2), 179\u2013201 (2008)","journal-title":"Int. J. Approx. Reason."},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"834","DOI":"10.2178\/jsl\/1191333844","volume":"72","author":"G Metcalfe","year":"2007","unstructured":"Metcalfe, G., Montagna, F.: Substructural fuzzy logics. J. Symbolic Logic 72(3), 834\u2013864 (2007)","journal-title":"J. Symbolic Logic"},{"key":"6_CR19","first-page":"88","volume":"98","author":"GE Minc","year":"1968","unstructured":"Minc, G.E.: Some calculi of modal logic. Trudy Mat. Inst. Steklov 98, 88\u2013111 (1968)","journal-title":"Trudy Mat. Inst. Steklov"},{"issue":"2","key":"6_CR20","first-page":"115","volume":"11","author":"M Ohnishi","year":"1959","unstructured":"Ohnishi, M., Matsumoto, K.: Gentzen method in modal calculi. ii. Osaka Math. J. 11(2), 115\u2013120 (1959)","journal-title":"Osaka Math. J."},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1017\/S1755020308080040","volume":"1","author":"F Poggiolesi","year":"2008","unstructured":"Poggiolesi, F.: A cut-free simple sequent calculus for modal logic S5. Rev. Symbolic Logic 1(1), 3\u201315 (2008)","journal-title":"Rev. Symbolic Logic"},{"issue":"3","key":"6_CR22","first-page":"900","volume":"48","author":"G Pottinger","year":"1983","unstructured":"Pottinger, G.: Uniform, cut-free formulations of T, S4 and S5 (abstract). J. Symbolic Logic 48(3), 900 (1983)","journal-title":"J. Symbolic Logic"},{"key":"6_CR23","first-page":"1129","volume":"37","author":"M Takano","year":"1992","unstructured":"Takano, M.: Subformula property as a substitute for cut-elimination in modal propositional logics. Math. Jpn. 37, 1129\u20131145 (1992)","journal-title":"Math. Jpn."}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T10:55:00Z","timestamp":1721645700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_6","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)"}}]}}