乘法证明网的正确性是线性的

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI:10.1109/LICS.1999.782640

S. Guerrini

{"title":"乘法证明网的正确性是线性的","authors":"S. Guerrini","doi":"10.1109/LICS.1999.782640","DOIUrl":null,"url":null,"abstract":"We reformulate Danos contractibility criterion in terms of a sort of unification. As for term unification, a direct implementation of the unification criterion leads to a quasi-linear algorithm. Linearity is obtained after observing that the disjoint-set union-find at the core of the unification criterion is a special case of union-find with a real linear time solution.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":"{\"title\":\"Correctness of multiplicative proof nets is linear\",\"authors\":\"S. Guerrini\",\"doi\":\"10.1109/LICS.1999.782640\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We reformulate Danos contractibility criterion in terms of a sort of unification. As for term unification, a direct implementation of the unification criterion leads to a quasi-linear algorithm. Linearity is obtained after observing that the disjoint-set union-find at the core of the unification criterion is a special case of union-find with a real linear time solution.\",\"PeriodicalId\":352531,\"journal\":{\"name\":\"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"60\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1999.782640\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1999.782640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 60

摘要

我们用一种统一的形式重新表述了Danos可缩性判据。对于项统一，直接实现统一准则导致拟线性算法。观察到作为统一准则核心的不相交集并查找是具有实线性时间解的并查找的一种特殊情况后，得到了线性性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Correctness of multiplicative proof nets is linear

We reformulate Danos contractibility criterion in terms of a sort of unification. As for term unification, a direct implementation of the unification criterion leads to a quasi-linear algorithm. Linearity is obtained after observing that the disjoint-set union-find at the core of the unification criterion is a special case of union-find with a real linear time solution.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)

自引率

0.00%

发文量