Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix
This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect matching. By applying matching theory, we obtain...
Saved in:
| Published in: | Logical methods in computer science Vol. 16, Issue 1; no. 1 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science Association
01.02.2020
Logical Methods in Computer Science e.V |
| Subjects: | |
| ISSN: | 1860-5974, 1860-5974 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect matching. By applying matching theory, we obtain new results for MLL+Mix proof nets: a linear-time correctness criterion, a quasi-linear sequentialization algorithm, and a characterization of the sub-polynomial complexity of the correctness problem. We also use graph algorithms to compute the dependency relation of Bagnol et al. (2015) and the kingdom ordering of Bellin (1997), and relate them to the notion of blossom which is central to combinatorial maximum matching algorithms. In this journal version, we have added an explanation of Retor\'e's "RB-graphs" in terms of a general construction on graphs with forbidden transitions. In fact, it is by analyzing RB-graphs that we arrived at this construction, and thus obtained a polynomial-time algorithm for finding trails avoiding forbidden transitions; the latter is among the material covered in another paper by the author focusing on graph theory (arXiv:1901.07028). |
|---|---|
| AbstractList | This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retoré (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect matching. By applying matching theory, we obtain new results for MLL+Mix proof nets: a linear-time correctness criterion, a quasi-linear sequentialization algorithm, and a characterization of the sub-polynomial complexity of the correctness problem. We also use graph algorithms to compute the dependency relation of Bagnol et al. (2015) and the kingdom ordering of Bellin (1997), and relate them to the notion of blossom which is central to combinatorial maximum matching algorithms.In this journal version, we have added an explanation of Retoré's "RB-graphs" in terms of a general construction on graphs with forbidden transitions. In fact, it is by analyzing RB-graphs that we arrived at this construction, and thus obtained a polynomial-time algorithm for finding trails avoiding forbidden transitions; the latter is among the material covered in another paper by the author focusing on graph theory (arXiv:1901.07028). This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect matching. By applying matching theory, we obtain new results for MLL+Mix proof nets: a linear-time correctness criterion, a quasi-linear sequentialization algorithm, and a characterization of the sub-polynomial complexity of the correctness problem. We also use graph algorithms to compute the dependency relation of Bagnol et al. (2015) and the kingdom ordering of Bellin (1997), and relate them to the notion of blossom which is central to combinatorial maximum matching algorithms. In this journal version, we have added an explanation of Retor\'e's "RB-graphs" in terms of a general construction on graphs with forbidden transitions. In fact, it is by analyzing RB-graphs that we arrived at this construction, and thus obtained a polynomial-time algorithm for finding trails avoiding forbidden transitions; the latter is among the material covered in another paper by the author focusing on graph theory (arXiv:1901.07028). |
| Author | Nguyên, Lê Thành Dũng |
| Author_xml | – sequence: 1 givenname: Lê Thành Dũng surname: Nguyên fullname: Nguyên, Lê Thành Dũng |
| BackLink | https://hal.science/hal-04405117$$DView record in HAL |
| BookMark | eNpVkU9PGzEQxa2KSoU0X6AnH4nEUo_ttdfcUAQNUlAPLVJvltd_EqPEDvZCy7fvJqkQncsbPb35zeGdoZOUk0foC5BLygTrvi7v5z8aEOdwReWMEko-oFPoBGlaJfnJu_0Tmtb6SMZhDDoqTtGvhxSfnj3e-RK8HfDWDHYd06pe4JBLH53zCQ_FpBqHmFPFJjm8KzkHnPxQ9yG8icmbUfIqWvw7Dmt8H_98Rh-D2VQ__acT9HB783O-aJbfv93Nr5eNZZwOjWROKtsFT1xw3DEZLGvBS6UcKG6VC23bObDW9gr6HoLkQbC27zvVCmA9m6C7I9dl86h3JW5NedXZRH0wcllpU4ZoN14bE8DTQHpnFRdCdaEzML6nxHCiWDuyZkfW2mz-Qy2ul3rvEc5JCyBfYMzSY9aWXGvx4e0AiD7Uove1aBAaNJV6Xwv7C9nagkM |
| ContentType | Journal Article |
| Copyright | Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 1XC VOOES DOA |
| DOI | 10.23638/LMCS-16(1:27)2020 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_aaf1e2f0bdc946698f8a1d7920a40935 oai:HAL:hal-04405117v1 10_23638_LMCS_16_1_27_2020 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB 1XC VOOES |
| ID | FETCH-LOGICAL-c342t-73d79c8fe0dfd4d37fc351e799d194c9df558d1cccb91bb1f74f635bb895613b3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000523360600025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:51:22 EDT 2025 Tue Oct 14 20:34:56 EDT 2025 Sat Nov 29 08:05:33 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Proof nets Perfect matching |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c342t-73d79c8fe0dfd4d37fc351e799d194c9df558d1cccb91bb1f74f635bb895613b3 |
| OpenAccessLink | https://doaj.org/article/aaf1e2f0bdc946698f8a1d7920a40935 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_aaf1e2f0bdc946698f8a1d7920a40935 hal_primary_oai_HAL_hal_04405117v1 crossref_primary_10_23638_LMCS_16_1_27_2020 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-02 |
| PublicationDateYYYYMMDD | 2020-02-01 |
| PublicationDate_xml | – month: 02 year: 2020 text: 2020-02 |
| PublicationDecade | 2020 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2020 |
| Publisher | Logical Methods in Computer Science Association Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science Association – name: Logical Methods in Computer Science e.V |
| SSID | ssj0000331826 |
| Score | 2.1899621 |
| Snippet | This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of... This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retoré (2003). We show that the problem of... |
| SourceID | doaj hal crossref |
| SourceType | Open Website Open Access Repository Index Database |
| SubjectTerms | 03f52, 68r10 Computer Science computer science - logic in computer science Discrete Mathematics f.4.1 g.2.2 Logic in Computer Science |
| Title | Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix |
| URI | https://hal.science/hal-04405117 https://doaj.org/article/aaf1e2f0bdc946698f8a1d7920a40935 |
| Volume | 16, Issue 1 |
| WOSCitedRecordID | wos000523360600025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA4iHrz4FuuLIB4UXdxsdk3irZaKh7YIPugtbF7Yy7a0q3jytzuTbUVPXrzsQgib8M1mHsnkG0JOvZPSOhGSwiuf5Fz6RBrvE-HSAOLOCh8Z-F56YjCQw6F6-FHqC3PCGnrgBrirsgzMZyE1ziIVupJBlswJlaVljod4qH1ToX4EU1EHc46Oc3NLJuMw6lWv33lM2PUZu8nEOYT86S9LFAn7wb68LvZTo3252yBrc8eQtpsJbZIlX22R9UXRBTpfg9tk-BwpV-nETzETg4LHGdMhZ5cU_E-DjCAVrdECNclYtKwcBTU5DrTy9Qw7UXQtS3ih2qO4E0v7o48d8nzXfercJ_PyCInleVYnggMMVgafuuByx0WwvGBeKOWYyq1yoSikY9Zao5gxLIgc4C-MkXiZlRu-S5arceX3CC2sldKZIihrc2vxtmoJvlcJqz3lED63yMUCKj1pWDA0RA8RWI3Aanatmc6ERmBb5BbR_O6JDNaxAeSq53LVf8m1RU5AFr--cd_uaWzDKtngJ4p3tv8fIx2QVZx1k4p9SJbr6Zs_Iiv2vR7Npsfxv4Jn_7P7Be7t0uw |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Unique+perfect+matchings%2C+forbidden+transitions+and+proof+nets+for+linear+logic+with+Mix&rft.jtitle=Logical+methods+in+computer+science&rft.au=L%C3%AA+Th%C3%A0nh+D%C5%A9ng+Nguy%C3%AAn&rft.date=2020-02-01&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=16%2C+Issue+1&rft_id=info:doi/10.23638%2FLMCS-16%281%3A27%292020&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_aaf1e2f0bdc946698f8a1d7920a40935 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |