Computational Complexity of Deciding Provability in Linear Logic and its Fragments.
Florian ChudigiewitschPublished in: CoRR (2021)
Keyphrases
- linear logic
- computational complexity
- fixed point
- cut elimination
- proof theoretic
- np complete
- logic programming
- sequent calculus
- logical framework
- proof search
- high computational complexity
- desirable properties
- special case
- intuitionistic logic
- decision problems
- np hard
- inference rules
- probabilistic reasoning
- machine learning
- artificial intelligence