Login / Signup

Complexity of Subtype Satisfiability over Posets.

Joachim NiehrenTim PriesnitzZhendong Su
Published in: ESOP (2005)
Keyphrases
  • computational complexity
  • databases
  • data mining
  • computational cost
  • worst case
  • np complete
  • satisfiability problem
  • space complexity
  • special case
  • logic programs
  • propositional logic
  • sat problem
  • partially ordered sets