Constant-Only Multiplicative Linear Logic is NP-Complete.
Patrick LincolnTimothy C. WinklerPublished in: Theor. Comput. Sci. (1994)
Keyphrases
- linear logic
- np complete
- fixed point
- np hard
- sequent calculus
- randomly generated
- logic programming
- computational complexity
- satisfiability problem
- desirable properties
- intuitionistic logic
- logical framework
- proof theoretic
- cut elimination
- conjunctive queries
- polynomial time complexity
- machine learning
- finds an optimal solution
- proof search
- conp complete
- inference rules
- integrity constraints
- dynamical systems
- optimal solution
- artificial intelligence