Constant-only multiplicative linear logic is NP-complete-Reference-Cited by-同舟云学术

Constant-only multiplicative linear logic is NP-complete

Published:1994-12 Issue:1 Volume:135 Page:155-169
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Lincoln Patrick,Winkler Timothy

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. Computational interpretations of linear logic;Abramsky;Theoret. Comput. Sci.,1993

2. Linear objects: Logical processes with built-in inheritance;Andreoli;Proc. 7th International Conference on Logic Programming, Jerusalem,1990

3. Some properties of linear logic proved by semantic methods;Avron,1992

4. ∗-autonomous categories;Barr,1979

5. Mechanizing Proof Theory: Resource-Aware Logics and Proof-Transformations to Extract Implicit Information;Bellin,1990

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proof Diagrams for Multiplicative Linear Logic;Electronic Proceedings in Theoretical Computer Science;2017-01-17

2. Proof equivalence in MLL is PSPACE-complete;Logical Methods in Computer Science;2016-03-02

3. The decidability of the intensional fragment of classical linear logic;Theoretical Computer Science;2015-09

4. No proof nets for MLL with units;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14

5. Interaction and Depth against Nondeterminism in Proof Search;Logical Methods in Computer Science;2014-05-30