The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries.
Alon ReshefBenny KimelfeldEster LivshitsPublished in: PODS (2020)
Keyphrases
- conjunctive queries
- containment of conjunctive queries
- conjunctive query containment
- datalog programs
- query evaluation
- query answering
- conp complete
- integrity constraints
- np complete
- data complexity
- query language
- conjunctive regular path queries
- query containment
- deductive databases
- bounded treewidth
- special case
- probabilistic databases
- data exchange
- lower complexity
- fixed parameter tractable
- pspace complete
- computational complexity
- query rewriting
- unions of conjunctive queries
- regular path queries
- relational databases
- data management
- data mining
- knowledge base
- queries using views
- databases
- boolean expressions
- inclusion dependencies
- dl lite
- logic programming
- decision problems
- incomplete information