The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries.
Alon ReshefBenny KimelfeldEster LivshitsPublished in: CoRR (2019)
Keyphrases
- conjunctive queries
- containment of conjunctive queries
- conjunctive query containment
- datalog programs
- query answering
- integrity constraints
- query evaluation
- np complete
- data complexity
- conp complete
- conjunctive regular path queries
- query language
- data exchange
- query containment
- query rewriting
- bounded treewidth
- deductive databases
- special case
- probabilistic databases
- lower complexity
- fixed parameter tractable
- exptime complete
- pspace complete
- decision procedures
- regular path queries
- computational complexity
- boolean expressions
- queries using views
- data management
- relational databases
- unions of conjunctive queries
- relational queries
- decision problems
- expressive power