Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems.
Gianluigi GrecoFrancesco ScarcelloPublished in: Inf. Comput. (2017)
Keyphrases
- constraint satisfaction problems
- conjunctive queries
- np complete
- constraint satisfaction
- data complexity
- constraint programming
- np hard
- constraint propagation
- database theory
- computational complexity
- constraint solving
- query evaluation
- search space
- satisfiability problem
- decision procedures
- tractable classes
- constraint problems
- query containment
- arc consistency
- query rewriting
- search algorithm
- query answering
- constraint networks
- integrity constraints
- phase transition
- bounded treewidth
- decomposition methods
- temporal constraints
- ordering heuristics
- datalog programs
- sat problem
- query language
- finite domain