{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T16:03:53Z","timestamp":1787069033448,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":20,"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_8","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:10:06Z","timestamp":1566414606000},"page":"130-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Relating Labelled and Label-Free Bunched Calculi in BI Logic"],"prefix":"10.1007","author":[{"given":"Didier","family":"Galmiche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Marti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"M\u00e9ry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0168-0072(99)00014-7","volume":"101","author":"M Abrusci","year":"2000","unstructured":"Abrusci, M., Ruet, P.: Non-commutative logic I: the multiplicative fragment. Ann. Pure Appl. Log. 101, 29\u201364 (2000)","journal-title":"Ann. Pure Appl. Log."},{"key":"8_CR2","volume-title":"Labelled Deduction, Volume 17 of Applied Logic Series","year":"2000","unstructured":"Basin, D., D\u2019Agostino, M., Gabbay, D.M., Matthews, S., Vigan\u00f3, L. (eds.): Labelled Deduction, Volume 17 of Applied Logic Series. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"8_CR3","unstructured":"Brotherston, J., Villard, J.: Sub-classical Boolean bunched logics and the meaning of par. In: International Conference on Computer Science Logic, CSL 2014, LIPIcs, Dagsthul, Vienna, Austria, pp. 325\u2013342 (2014)"},{"issue":"5","key":"8_CR4","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1017\/S0960129509990077","volume":"19","author":"M Collinson","year":"2009","unstructured":"Collinson, M., Pym, D.: Algebra and logic for resource-based systems modelling. Math. Struct. Comput. Sci. 19(5), 959\u20131027 (2009)","journal-title":"Math. Struct. Comput. Sci."},{"key":"8_CR5","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. Reidel Publishing Company, Dordrecht (1983)"},{"key":"8_CR6","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198538332.001.0001","volume-title":"Labelled Deductive Systems, Volume I - Foundations","author":"DM Gabbay","year":"1996","unstructured":"Gabbay, D.M.: Labelled Deductive Systems, Volume I - Foundations. Oxford University Press, Oxford (1996)"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00012-017-0456-x","volume":"78","author":"N Galatos","year":"2017","unstructured":"Galatos, N., Jipsen, P.: Distributive residuated frames and generalized bunched implication algebras. Algebra Universalis 78(3), 303\u2013336 (2017)","journal-title":"Algebra Universalis"},{"issue":"5","key":"8_CR8","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1093\/logcom\/13.5.707","volume":"13","author":"D Galmiche","year":"2003","unstructured":"Galmiche, D., M\u00e9ry, D.: Semantic labelled tableaux for propositional BI without bottom. J. Log. Comput. 13(5), 707\u2013753 (2003)","journal-title":"J. Log. Comput."},{"issue":"6","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1017\/S0960129505004858","volume":"15","author":"D Galmiche","year":"2005","unstructured":"Galmiche, D., M\u00e9ry, D., Pym, D.: The semantics of BI and Resource Tableaux. Math. Struct. Comput. Science 15(6), 1033\u20131088 (2005)","journal-title":"Math. Struct. Comput. Science"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"JY Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theor. Comput. Sci. 50(1), 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-642-40537-2_16","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"Z H\u00f3u","year":"2013","unstructured":"H\u00f3u, Z., Tiu, A., Gor\u00e9, R.: A labelled sequent calculus for BBI: proof theory and proof search. In: Galmiche, D., Larchey-Wendling, D. (eds.) TABLEAUX 2013. LNCS (LNAI), vol. 8123, pp. 172\u2013187. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40537-2_16"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Ishtiaq, S., O\u2019Hearn, P.: BI as an assertion language for mutable data structures. In: 28th ACM Symposium on Principles of Programming Languages, POPL 2001, London, UK, pp. 14\u201326 (2001)","DOI":"10.1145\/373243.375719"},{"issue":"5","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s11225-016-9665-0","volume":"104","author":"M Kaminski","year":"2016","unstructured":"Kaminski, M., Francez, N.: The Lambek calculus extended with intuitionistic propositional logic. Studia Logica 104(5), 1051\u20131082 (2016)","journal-title":"Studia Logica"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1093\/logcom\/exu031","volume":"26","author":"D Larchey-Wendling","year":"2014","unstructured":"Larchey-Wendling, D.: The formal strong completeness of partial monoidal Boolean BI. J. Log. Comput. 26(2), 605\u2013640 (2014)","journal-title":"J. Log. Comput."},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"PW O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P.W., Pym, D.: The logic of bunched implications. Bull. Symb. Log. 5(2), 215\u2013244 (1999)","journal-title":"Bull. Symb. Log."},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-02716-1_22","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"L Pinto","year":"2009","unstructured":"Pinto, L., Uustalu, T.: Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS (LNAI), vol. 5607, pp. 295\u2013309. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02716-1_22"},{"key":"8_CR17","unstructured":"Pym, D.: On bunched predicate logic. In: 14th Symposium on Logic in Computer Science, Trento, Italy, pp. 183\u2013192. IEEE Computer Society Press, July 1999"},{"key":"8_CR18","volume-title":"The Semantics and Proof Theory of the Logic of Bunched Implications, volume 26 of Applied Logic Series","author":"D Pym","year":"2002","unstructured":"Pym, D.: The Semantics and Proof Theory of the Logic of Bunched Implications, volume 26 of Applied Logic Series. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"8_CR19","unstructured":"Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: IEEE Symposium on Logic in Computer Science, Copenhagen, Danemark, pp. 55\u201374, July 2002"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-61511-3_104","volume-title":"Automated Deduction \u2014 Cade-13","author":"S Schmitt","year":"1996","unstructured":"Schmitt, S., Kreitz, C.: Converting non-classical matrix proofs into sequent-style systems. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 418\u2013432. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61511-3_104"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T06:54:55Z","timestamp":1721631295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_8","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)"}}]}}