Login / Signup

Tractability of Cut-Free Gentzen Type Propositional Calculus with Permutation Inference.

Noriko H. Arai
Published in: Theor. Comput. Sci. (1996)
Keyphrases
  • propositional calculus
  • np complete
  • computational complexity
  • probabilistic inference
  • knowledge base
  • optimal solution
  • description logics
  • belief networks
  • inference engine