{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:28:10Z","timestamp":1746001690304,"version":"3.40.3"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031635007"},{"type":"electronic","value":"9783031635014"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"vor","delay-in-days":183,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce logical connectives allowing us to extend the well-known correspondence between classical propositional formulas and cographs. We define sequent systems operating on formulas containing such connectives, and we prove, using an analyticity argument based on cut-elimination, that our systems provide conservative extensions of multiplicative linear logic (without and with mix) and classical propositional logic. We conclude by showing that one of our systems captures graph isomorphism as logical equivalence and that it is sound and complete for the graphical logic<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{GS}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>GS<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/978-3-031-63501-4_12","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T09:02:00Z","timestamp":1719824520000},"page":"216-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Sequent Systems on\u00a0Undirected Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0425-2825","authenticated-orcid":false,"given":"Matteo","family":"Acclavio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Mellies, P.A.: Concurrent games and full completeness. In: Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp. 431\u2013442. IEEE (1999)","DOI":"10.1109\/LICS.1999.782638"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Acclavio, M.: Graphical proof theory I: sequent systems on undirected graphs (2023)","DOI":"10.1007\/978-3-031-63501-4_12"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Acclavio, M., Horne, R., Mauw, S., Stra\u00dfburger, L.: A graphical proof theory of logical time. In: Felty, A.P. (ed.) 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0228, pp. 22:1\u201322:25. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2022.22, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/16303","DOI":"10.4230\/LIPIcs.FSCD.2022.22"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Acclavio, M., Horne, R., Stra\u00dfburger, L.: Logic beyond formulas: a proof system on graphs. In: Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science. LICS \u201920, pp. 38\u201352. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3373718.3394763","DOI":"10.1145\/3373718.3394763"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Acclavio, M., Horne, R., Stra\u00dfburger, L.: An analytic propositional proof system on graphs. Logical Methods Comput. Sci. 18(4) (2022). https:\/\/doi.org\/10.46298\/lmcs-18(4:1)2022, https:\/\/lmcs.episciences.org\/10186","DOI":"10.46298\/lmcs-18(4:1)2022"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Acclavio, M., Maieli, R.: Generalized connectives for multiplicative linear logic. In: Fern\u00e1ndez, M., Muscholl, A. (eds.) 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). LIPIcs, vol.\u00a0152, pp. 6:1\u20136:16. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.6, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2020\/11649","DOI":"10.4230\/LIPIcs.CSL.2020.6"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-319-94205-6_32","volume-title":"Automated Reasoning","author":"M Acclavio","year":"2018","unstructured":"Acclavio, M., Stra\u00dfburger, L.: From syntactic proofs to combinatorial proofs. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 481\u2013497. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_32"},{"key":"12_CR8","unstructured":"Aler\u00a0Tubella, A., Stra\u00dfburger, L.: Introduction to Deep Inference, August 2019. https:\/\/hal.inria.fr\/hal-02390267, lecture"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"JM Andreoli","year":"1992","unstructured":"Andreoli, J.M.: Logic programming with focusing proofs in linear logic. J. Log. Comput. 2(3), 297\u2013347 (1992)","journal-title":"J. Log. Comput."},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-45744-5_45","volume-title":"Automated Reasoning","author":"A Avron","year":"2001","unstructured":"Avron, A., Lev, I.: Canonical propositional Gentzen-type systems. In: Gor\u00e9, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 529\u2013544. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45744-5_45"},{"key":"12_CR11","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-031-08971-8_47","volume-title":"Information Processing and Management of Uncertainty in Knowledge-Based Systems","author":"V Bellandi","year":"2022","unstructured":"Bellandi, V., Frati, F., Siccardi, S., Zuccotti, F.: Management of uncertain data in event graphs. In: Ciucci, D., et al. (eds.) IPMU 2022. CCIS, vol. 1601, pp. 568\u2013580. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08971-8_47"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Blackburn, P., De\u00a0Rijke, M., Venema, Y.: Modal logic: graph. Darst, vol.\u00a053. Cambridge University Press (2001)","DOI":"10.1017\/CBO9781107050884"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Br\u00fcnnler, K.: Locality for classical logic. Notre Dame J. Formal Logic 47(4), 557\u2013580 (2006). http:\/\/www.iam.unibe.ch\/~kai\/Papers\/LocalityClassical.pdf","DOI":"10.1305\/ndjfl\/1168352668"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-02716-1_12","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"K Br\u00fcnnler","year":"2009","unstructured":"Br\u00fcnnler, K., Stra\u00dfburger, L.: Modular sequent systems for modal logic. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS (LNAI), vol. 5607, pp. 152\u2013166. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02716-1_12"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-662-55386-2_5","volume-title":"Logic, Language, Information, and Computation","author":"P Bruscoli","year":"2017","unstructured":"Bruscoli, P., Stra\u00dfburger, L.: On the length of medial-switch-mix derivations. In: Kennedy, J., de Queiroz, R.J.G.B. (eds.) WoLLIC 2017. LNCS, vol. 10388, pp. 68\u201379. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-55386-2_5"},{"key":"12_CR16","unstructured":"Calk, C.: A graph theoretical extension of Boolean logic. Bachelor\u2019s thesis (2016). http:\/\/www.anupamdas.com\/graph-bool.pdf"},{"key":"12_CR17","unstructured":"Calk, C., Das, A., Waring, T.: Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs (2020)"},{"key":"12_CR18","unstructured":"Chaudhuri, K., Donato, P., Massacci, L., Werner, B.: Certifying proof-by-linking. In: Working Paper or Preprint, September 2022. https:\/\/inria.hal.science\/hal-04317972"},{"issue":"5","key":"12_CR19","first-page":"85","volume":"3","author":"J Cockett","year":"1997","unstructured":"Cockett, J., Seely, R.: Proof theory for full intuitionistic linear logic, bilinear logic, and mix categories. Theory Appl. Categories 3(5), 85\u2013131 (1997)","journal-title":"Theory Appl. Categories"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0022-4049(95)00160-3","volume":"114","author":"J Cockett","year":"1997","unstructured":"Cockett, J., Seely, R.: Weakly distributive categories. J. Pure Appl. Algebra 114, 133\u2013173 (1997)","journal-title":"J. Pure Appl. Algebra"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Corneil, D., Lerchs, H., Burlingham, L.: Complement reducible graphs. Discrete Appl. Math. 3(3), 163\u2013174 (1981). https:\/\/doi.org\/10.1016\/0166-218X(81)90013-5, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0166218X81900135","DOI":"10.1016\/0166-218X(81)90013-5"},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Arch. Math. Logic 28(3), 181\u2013203 (1989). https:\/\/doi.org\/10.1007\/BF01622878","journal-title":"Arch. Math. Logic"},{"key":"12_CR23","unstructured":"Das, A.: Complexity of evaluation and entailment in Boolean graph logic (2019, preprint). http:\/\/www.anupamdas.com\/complexity-graph-bool-note.pdf"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Das, A., Rice, A.A.: New minimal linear inferences in Boolean logic independent of switch and medial. In: Kobayashi, N. (ed.) 6th International Conference on Formal Structures for Computation and Deduction. FSCD 2021, 17\u201324 July 2021, Buenos Aires, Argentina (Virtual Conference). LIPIcs, vol.\u00a0195, pp. 14:1\u201314:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2021.14","DOI":"10.4230\/LIPIcs.FSCD.2021.14"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-15375-4_24","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P-M Deni\u00e9lou","year":"2010","unstructured":"Deni\u00e9lou, P.-M., Yoshida, N.: Buffered communication analysis in distributed multiparty sessions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 343\u2013357. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_24"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: The Theory of 2-Structures a Framework for Decomposition and Transformation of Graphs. World Scientific, Singapore (1999). https:\/\/doi.org\/10.1142\/4197","DOI":"10.1142\/4197"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Fu, X., Bultan, T., Su, J.: Analysis of interacting BPEL web services. In: Proceedings of the 13th International Conference on World Wide Web, pp. 621\u2013630. ACM (2004)","DOI":"10.1145\/988672.988756"},{"issue":"1\u20132","key":"12_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Mathematica Academiae Scientiarum Hungarica 18(1\u20132), 25\u201366 (1967)","journal-title":"Acta Mathematica Academiae Scientiarum Hungarica"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Girard, J.Y.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"12_CR30","volume-title":"Logic and Algebra","author":"JY Girard","year":"1996","unstructured":"Girard, J.Y.: Proof-nets: the parallel syntax for proof-theory. In: Ursini, A., Agliano, P. (eds.) Logic and Algebra. Marcel Dekker, New York (1996)"},{"key":"12_CR31","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"JY Girard","year":"1998","unstructured":"Girard, J.Y.: Light linear logic. Inf. Comput. 143, 175\u2013204 (1998)","journal-title":"Inf. Comput."},{"key":"12_CR32","first-page":"183","volume":"175","author":"JY Girard","year":"2000","unstructured":"Girard, J.Y.: On the meaning of logical rules II: multiplicatives and additives. NATO ASI Seri. F: Comput. Syst. Sci. 175, 183\u2013212 (2000)","journal-title":"NATO ASI Seri. F: Comput. Syst. Sci."},{"issue":"1","key":"12_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1182613.1182614","volume":"8","author":"A Guglielmi","year":"2007","unstructured":"Guglielmi, A.: A system of interaction and structure. ACM Trans. Comput. Log. 8(1), 1\u201364 (2007). https:\/\/doi.org\/10.1145\/1182613.1182614","journal-title":"ACM Trans. Comput. Log."},{"key":"12_CR34","doi-asserted-by":"publisher","unstructured":"Guglielmi, A., Gundersen, T., Parigot, M.: A proof calculus which reduces syntactic bureaucracy. In: Lynch, C. (ed.) Proceedings of the 21st International Conference on Rewriting Techniques and Applications. LIPIcs, vol.\u00a06, pp. 135\u2013150. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2010). https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2010.135, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2010\/2649","DOI":"10.4230\/LIPIcs.RTA.2010.135"},{"key":"12_CR35","doi-asserted-by":"publisher","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010). https:\/\/doi.org\/10.1016\/j.cosrev.2010.01.001, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S157401371000002X","DOI":"10.1016\/j.cosrev.2010.01.001"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-030-71995-1_26","volume-title":"Foundations of Software Science and Computation Structures","author":"G van Heerdt","year":"2021","unstructured":"van Heerdt, G., Kapp\u00e9, T., Rot, J., Silva, A.: Learning Pomset Automata. In: FOSSACS 2021. LNCS, vol. 12650, pp. 510\u2013530. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-71995-1_26"},{"key":"12_CR37","unstructured":"Hougardy, S.: On the P4-structure of perfect graphs. Citeseer (1996)"},{"issue":"3","key":"12_CR38","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.4007\/annals.2006.164.1065","volume":"164","author":"D Hughes","year":"2006","unstructured":"Hughes, D.: Proofs without syntax. Ann. Math. 164(3), 1065\u20131076 (2006). https:\/\/doi.org\/10.4007\/annals.2006.164.1065","journal-title":"Ann. Math."},{"key":"12_CR39","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.entcs.2006.05.036","volume":"165","author":"D Hughes","year":"2006","unstructured":"Hughes, D.: Towards Hilbert\u2019s 24$${}^{\\text{ th }}$$ problem: combinatorial proof invariants: (preliminary version). Electr. Notes Theor. Comput. Sci. 165, 37\u201363 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Hyland, J.M.E., Ong, C.H.L.: On full abstraction for PCF: I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Inf. Comput. 163, 285\u2013408 (2000)","DOI":"10.1006\/inco.2000.2917"},{"key":"12_CR41","unstructured":"James, L.O., Stanton, R.G., Cowan, D.D.: Graph decomposition for undirected graphs. In: Proceedings of the Third Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1972). pp. 281\u2013290 (1972)"},{"issue":"3","key":"12_CR42","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/S0895480191196812","volume":"8","author":"B Jamison","year":"1995","unstructured":"Jamison, B., Olariu, S.: P-components and the homogeneous decomposition of graphs. SIAM J. Discret. Math. 8(3), 448\u2013463 (1995)","journal-title":"SIAM J. Discret. Math."},{"key":"12_CR43","doi-asserted-by":"publisher","unstructured":"Kogkalidis, K., Moortgat, M., Moot, R.: Neural proof nets. In: Fern\u00e1ndez, R., Linzen, T. (eds.) Proceedings of the 24th Conference on Computational Natural Language Learning, pp. 26\u201340. Association for Computational Linguistics, Online (2020). https:\/\/doi.org\/10.18653\/v1\/2020.conll-1.3, https:\/\/aclanthology.org\/2020.conll-1.3","DOI":"10.18653\/v1\/2020.conll-1.3"},{"key":"12_CR44","doi-asserted-by":"publisher","unstructured":"Lellmann, B., Pimentel, E.: Modularisation of sequent calculi for normal and non-normal modalities. ACM Trans. Comput. Logic 20(2) (2019). https:\/\/doi.org\/10.1145\/3288757","DOI":"10.1145\/3288757"},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory, vol.\u00a0367. American Mathematical Society, Providence (2009)","DOI":"10.1090\/chel\/367"},{"key":"12_CR46","doi-asserted-by":"publisher","unstructured":"Mac\u00a0Lane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5. Springer, New York (1971). https:\/\/doi.org\/10.1007\/978-1-4757-4721-8","DOI":"10.1007\/978-1-4757-4721-8"},{"key":"12_CR47","doi-asserted-by":"publisher","unstructured":"Maieli, R.: Non decomposable connectives of linear logic. Ann. Pure Appl. Logic 170(11), 102709 (2019). https:\/\/doi.org\/10.1016\/j.apal.2019.05.006, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0168007219300600","DOI":"10.1016\/j.apal.2019.05.006"},{"key":"12_CR48","unstructured":"McConnell, R.M., Spinrad, J.P.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201994, pp. 536\u2013545. Society for Industrial and Applied Mathematics, USA (1994)"},{"key":"12_CR49","doi-asserted-by":"publisher","unstructured":"Mell, S., Bastani, O., Zdancewic, S.: Ideograph: a language for expressing and manipulating structured data. In: Grabmayer, C. (ed.) Proceedings Twelfth International Workshop on Computing with Terms and Graphs, TERMGRAPH@FSCD 2022, Technion, Haifa, Israel, 1st August 2022. EPTCS, vol.\u00a0377, pp. 65\u201384 (2022). https:\/\/doi.org\/10.4204\/EPTCS.377.4","DOI":"10.4204\/EPTCS.377.4"},{"key":"12_CR50","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2012.12.008","volume":"474","author":"D Miller","year":"2013","unstructured":"Miller, D., Pimentel, E.: A formal framework for specifying sequent calculus proof systems. Theor. Comput. Sci. 474, 98\u2013116 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-74915-8_31","volume-title":"Computer Science Logic","author":"D Miller","year":"2007","unstructured":"Miller, D., Saurin, A.: From proofs to focused proofs: a modular proof of focalization in linear logic. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 405\u2013419. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74915-8_31"},{"key":"12_CR52","unstructured":"Nguy\u00ean, L.T.D., Seiller, T.: Coherent interaction graphs: a non-deterministic geometry of interaction for MLL (2019)"},{"key":"12_CR53","doi-asserted-by":"crossref","unstructured":"Nguy\u00ean, L.T.D., Stra\u00dfburger, L.: A system of interaction and structure III: the complexity of BV and Pomset logic. In: Working Paper or Preprint (2022). https:\/\/hal.inria.fr\/hal-03909547","DOI":"10.46298\/lmcs-19(4:25)2023"},{"key":"12_CR54","doi-asserted-by":"publisher","unstructured":"Nguy\u00ean, L.T.D., Stra\u00dfburger, L.: BV and Pomset logic are not the same. In: Manea, F., Simpson, A. (eds.) 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0216, pp. 3:1\u20133:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2022.3, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/15723","DOI":"10.4230\/LIPIcs.CSL.2022.3"},{"issue":"1","key":"12_CR55","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comput. Sci. 13(1), 85\u2013108 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR56","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V Pratt","year":"1986","unstructured":"Pratt, V.: Modeling concurrency with partial orders. Int. J. Parallel Prog. 15, 33\u201371 (1986)","journal-title":"Int. J. Parallel Prog."},{"key":"12_CR57","doi-asserted-by":"crossref","unstructured":"Retor\u00e9, C.: Pomset logic: the other approach to noncommutativity in logic. In: Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics, pp. 299\u2013345 (2021)","DOI":"10.1007\/978-3-030-66545-6_9"},{"key":"12_CR58","doi-asserted-by":"crossref","unstructured":"Rideau, S., Winskel, G.: Concurrent strategies. In: 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp. 409\u2013418. IEEE (2011)","DOI":"10.1109\/LICS.2011.13"},{"key":"12_CR59","doi-asserted-by":"crossref","unstructured":"Seely, R.: Linear logic, *-autonomous categories and cofree coalgebras. Contemp. Math. 92 (1989)","DOI":"10.1090\/conm\/092\/1003210"},{"issue":"2","key":"12_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-2(2:4)2006","volume":"2","author":"AF Tiu","year":"2006","unstructured":"Tiu, A.F.: A system of interaction and structure II: the need for deep inference. Logic. Methods Comput. Sci. 2(2), 1\u201324 (2006). https:\/\/doi.org\/10.2168\/LMCS-2(2:4)2006","journal-title":"Logic. Methods Comput. Sci."},{"key":"12_CR61","doi-asserted-by":"crossref","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, 2nd edn. Cambridge University Press, Cambridge (2000)","DOI":"10.1017\/CBO9781139168717"},{"key":"12_CR62","doi-asserted-by":"crossref","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 1\u201312. ACM (1979)","DOI":"10.1145\/800135.804393"},{"key":"12_CR63","unstructured":"Waring, T.: A graph theoretic extension of Boolean logic. Master\u2019s thesis (2019). http:\/\/anupamdas.com\/thesis_tim-waring.pdf"},{"key":"12_CR64","unstructured":"Winskel, G., Rideau, S., Clairambault, P., Castellan, S.: Games and strategies as event structures. Logic. Methods Comput. Sci. 13 (2017)"}],"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-031-63501-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T04:38:51Z","timestamp":1732336731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63501-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031635007","9783031635014"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63501-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/merz.gitlabpages.inria.fr\/2024-ijcar\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}