A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic.
Misao NagayamaMitsuhiro OkadaPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- graph theoretic
- linear logic
- intuitionistic logic
- fixed point
- proof theoretic
- logic programming
- desirable properties
- graph theory
- random graphs
- logical framework
- cut elimination
- bayesian network structure learning
- sequent calculus
- proof search
- maximum independent set
- general purpose
- social networks
- inference rules
- relational databases
- machine learning