Direct Encodings of NP-Complete Problems into Horn Sequents of Multiplicative Linear Logic
2018
In this paper, we provide direct encodings into Horn sequents of Multiplicative Linear Logic for two NP-complete problems, 3D MATCHING and PARTITION. Their correctness proofs are given by using a characterization of multiplicative proof nets.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
17
References
1
Citations
NaN
KQI