Login / Signup

Computational complexity of logical theories of one successor and another unary function.

Pascal Michel
Published in: Arch. Math. Log. (2007)
Keyphrases
  • computational complexity
  • logical theories
  • pairwise
  • np complete
  • computer science
  • domain knowledge
  • data mining techniques
  • situation calculus