On the Satisfiability Problem of Patterns in SPARQL 1.1.
Xiaowang ZhangJan Van den BusscheKewen WangZhe WangPublished in: AAAI (2018)
Keyphrases
- satisfiability problem
- np complete
- temporal logic
- search algorithm
- stochastic local search
- phase transition
- stochastic local search algorithms
- sat problem
- query language
- linked data
- sat instances
- max sat
- data model
- decision procedures
- mazurkiewicz traces
- pspace complete
- database systems
- query optimization
- semantic web
- computational complexity
- expressive power
- lower bound