Login / Signup

Tractability of Cut-free Gentzen-type propositional calculus with permutation inference II.

Noriko H. Arai
Published in: Theor. Comput. Sci. (2000)
Keyphrases
  • propositional calculus
  • constraint satisfaction
  • computational complexity
  • random fields
  • bayesian inference
  • tractable cases
  • neural network
  • probabilistic inference
  • inference engine