Login / Signup
The Complexity of Local Proof Search in Linear Logic.
Patrick Lincoln
John C. Mitchell
Andre Scedrov
Published in:
Electron. Notes Theor. Comput. Sci. (1996)
Keyphrases
</>
linear logic
proof search
fixed point
cut elimination
proof theoretic
logic programming
sequent calculus
intuitionistic logic
theorem prover
theorem proving
logical framework
desirable properties
machine learning
computational complexity
search procedure
simulated annealing
general purpose
knowledge representation