Login / Signup

Uniform proofs of standard completeness for extensions of first-order MTL.

Paolo BaldiAgata Ciabattoni
Published in: Theor. Comput. Sci. (2015)
Keyphrases
  • formal proofs
  • equational theories
  • higher order
  • learning algorithm
  • knowledge base
  • decision trees
  • bayesian networks
  • active learning
  • first order logic
  • inductive learning