Constant-only multiplicative linear logic is NP-complete (Q1342254): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computational interpretations of linear logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Properties of Linear Logic Proved by Semantic Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5620723 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5813181 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decision problems for propositional linear logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3827993 / rank | |||
Normal rank |
Latest revision as of 11:22, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constant-only multiplicative linear logic is NP-complete |
scientific article |
Statements
Constant-only multiplicative linear logic is NP-complete (English)
0 references
28 November 1995
0 references
The paper considers the decision problem for the multiplicative fragment of linear logic without quantifiers or propositions: the constant only case. The authors show that this fragment is NP-complete. Three independent logics are considered: full propositional linear logic, restricted to multiplicative connectives and constants, and the constant only fragment. These calculi are considered as Gentzen-style sequent calculi since 3-Partition and 432-Partition are equivalent problems, so the authors encode an NP-complete problem, 432-Partition in the constant only fragment of linear logic restricted to multiplicative connectives and constants, and show this encoding is sound and complete. The decision problem for constant-only multiplicative linear logic is NP-complete. The complexity of most of the larger fragments of linear logic has already been completely characterized by P. Lincoln, J. Mitchell, A. Scedrov and N. Shankar.
0 references
NP-completeness
0 references
decision problem
0 references
multiplicative fragment of linear logic
0 references