Proof equivalence in MLL is PSPACE-complete.

Willem Heijltjes Robin Houston

Published in: Log. Methods Comput. Sci. (2016)

Keyphrases

pspace complete
np complete
model checking
satisfiability problem
decision problems
strips planning
tree automata
temporal logic
coalition logic
causal graph
theorem prover
computational complexity
search algorithm
bayesian networks
constraint satisfaction problems
sufficient conditions
hidden markov models