Parameterized complexity of completeness reasoning for conjunctive queries.
Xianmin LiuJianzhong LiYingshu LiYuqiang FengPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- conjunctive queries
- parameterized complexity
- fixed parameter tractable
- np complete
- integrity constraints
- query answering
- query evaluation
- bounded treewidth
- query language
- abstract argumentation
- data complexity
- computational problems
- query containment
- data exchange
- np hard
- special case
- global constraints
- knowledge base
- decision procedures
- knowledge representation
- regular path queries
- reasoning tasks
- automated reasoning
- constraint programming
- deductive databases
- database
- computational complexity
- query processing