{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:03:54Z","timestamp":1743123834301,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030684457"},{"type":"electronic","value":"9783030684464"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-68446-4_16","type":"book-chapter","created":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T19:06:39Z","timestamp":1613156799000},"page":"311-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Formal Model for a Linear Time Correctness Condition of Proof Nets of Multiplicative Linear Logic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2126-2926","authenticated-orcid":false,"given":"Satoshi","family":"Matsuoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,13]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-540-78739-6_25","volume-title":"Programming Languages and Systems","author":"Sylvain Conchon","year":"2008","unstructured":"Conchon, Sylvain, Filli\u00e2tre, Jean-Christophe: Semi-persistent data structures. In: Drossopoulou, Sophia (ed.) ESOP 2008. LNCS, vol. 4960, pp. 322\u2013336. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78739-6_25"},{"key":"16_CR2","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Third Edition. The MIT Press, Cambridge (2009)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V Danos","year":"1989","unstructured":"Danos, V., Regnier, R.: The structure of multiplicatives. Arch. Math. Logic 28, 181\u2013203 (1989). https:\/\/doi.org\/10.1007\/BF01622878","journal-title":"Arch. Math. Logic"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"HN Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30(2), 209\u2013221 (1985). https:\/\/doi.org\/10.1016\/0022-0000(85)90014-5","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR5","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. Theoret. Comput. Sci. 50, 1\u2013102 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Guerrini, S.: A linear algorithm for MLL proof net correctness and sequentialization. Theoret. Comput. Sci. 412(20), 1958\u20131978 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.12.021, girard\u2019s Festschrift","DOI":"10.1016\/j.tcs.2010.12.021"},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Kanovich, M.I.: Horn programming in linear logic is NP-complete. In: Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 200\u2013210 (1992). https:\/\/doi.org\/10.1109\/LICS.1992.185533","DOI":"10.1109\/LICS.1992.185533"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Trans. Program. Lang. Syst. 4(2), 258\u2013282 (1982). https:\/\/doi.org\/10.1145\/357162.357169","DOI":"10.1145\/357162.357169"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-90686-7_2","volume-title":"Functional and Logic Programming","author":"Satoshi Matsuoka","year":"2018","unstructured":"Matsuoka, Satoshi: Direct encodings of NP-complete problems into horn sequents of multiplicative linear logic. In: Gallagher, John P., Sulzmann, Martin (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 17\u201332. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90686-7_2"},{"key":"16_CR10","unstructured":"Matsuoka, S.: A linear time algorithm for automatic generation of multiplicative planar proof nets (2019). https:\/\/akihisayamada.github.io\/tpp2019\/. The 15th Theorem Proving and Provers meeting (TPP 2019)"},{"key":"16_CR11","unstructured":"Matsuoka, S.: A new linear time correctness condition for multiplicative linear logic. CoRR abs\/1902.09693 (2019). http:\/\/arxiv.org\/abs\/1902.09693"},{"key":"16_CR12","unstructured":"Matsuoka, S.: Proof Net Calculator. https:\/\/staff.aist.go.jp\/s-matsuoka\/PNCalculator\/index.html (2019)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1145\/1149114.1149116","volume":"7","author":"AM Murawski","year":"2006","unstructured":"Murawski, A.M., Ong, C.H.L.: Fast verification of MLL proof nets via IMLL. ACM Trans. Comput. Logic 7, 473\u2013498 (2006). https:\/\/doi.org\/10.1145\/1149114.1149116","journal-title":"ACM Trans. Comput. Logic"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1016\/j.tcs.2010.12.020","volume":"412","author":"PJ de Naurois","year":"2011","unstructured":"de Naurois, P.J., Mogbil, V.: Correctness of linear logic proof structures is NL-complete. Theoret. Comput. Sci. 412, 1941\u20131957 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.12.020","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Paterson, M.S., Wegman, M.N.: Linear unification. In: Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, pp. 181\u2013186. STOC 1976. Association for Computing Machinery, New York (1976). https:\/\/doi.org\/10.1145\/800113.803646","DOI":"10.1145\/800113.803646"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68446-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T09:54:43Z","timestamp":1619258083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68446-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030684457","9783030684464"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68446-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bologna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nms.kcl.ac.uk\/maribel.fernandez\/LOPSTR2020\/","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":"31","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":"15","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":"48% - 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","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":"4","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)"}},{"value":"In addition, two invited talks are included in the proceedings. Due to the COVID-19 pandemic the conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}