PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points.
Rémi NolletAlexis SaurinChristine TassonPublished in: TABLEAUX (2019)
Keyphrases
- linear logic
- cut elimination
- fixed point
- sequent calculus
- proof search
- natural deduction
- decision procedures
- logic programming
- desirable properties
- theorem prover
- logical framework
- sufficient conditions
- temporal logic
- theorem proving
- belief propagation
- graphical models
- approximate value iteration
- image processing
- temporal difference learning
- inference rules
- programming language
- high quality