Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2018.25
URN: urn:nbn:de:0030-drops-91957
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9195/
Nguyen, Lê Thành Dung
Unique perfect matchings and proof nets
| pdf-format: |
|
Abstract
This paper establishes a bridge between linear logic and mainstream graph theory, building 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.
BibTeX - Entry
@InProceedings{nguyen:LIPIcs:2018:9195,
author = {Lê Th{\`a}nh Dung Nguyen},
title = {{Unique perfect matchings and proof nets}},
booktitle = {3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-077-4},
ISSN = {1868-8969},
year = {2018},
volume = {108},
editor = {H{\'e}l{\`e}ne Kirchner},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9195},
URN = {urn:nbn:de:0030-drops-91957},
doi = {10.4230/LIPIcs.FSCD.2018.25},
annote = {Keywords: correctness criteria, matching algorithms}
}
| Keywords: | correctness criteria, matching algorithms | |
| Seminar: | 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 04.07.2018 |
