Proof equivalence in MLL is PSPACE-complete
Work
Year: 2016
Type: article
Abstract: MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic are related by a series of inference permutations. It is also known as the word problem for star-auto... more
Authors Willem Heijltjes, Robin Houston
Institutions University of Bath, ET Enterprises (United Kingdom)
Cites: 26
Cited by: 5
Related to: 10
FWCI: 0.481
Citation percentile (by year/subfield): 87.21
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond