Correctness of linear logic proof structures is NL-complete.
Paulin Jacobé de NauroisVirgile MogbilPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- linear logic
- correctness criterion
- logic programming
- cut elimination
- proof search
- proof theoretic
- fixed point
- sequent calculus
- natural language
- desirable properties
- logical framework
- intuitionistic logic
- provably correct
- inference rules
- logic programs
- linguistic knowledge
- computational complexity
- video sequences
- knowledge base