Login / Signup

On the tractability and intractability of consistent conjunctive query answering.

Enela PemaPhokion G. KolaitisWang Chiew Tan
Published in: EDBT/ICDT Ph.D. Workshop (2011)
Keyphrases
  • np complete
  • data complexity
  • conjunctive queries
  • computational complexity
  • constraint satisfaction
  • machine learning
  • description logics
  • database systems
  • constraint satisfaction problems