On the Satisfiability Problem for SPARQL Patterns.
Xiaowang ZhangJan Van den BusscheFrançois PicalausaPublished in: J. Artif. Intell. Res. (2016)
Keyphrases
- satisfiability problem
- np complete
- temporal logic
- phase transition
- search algorithm
- sat problem
- stochastic local search algorithms
- stochastic local search
- query language
- data model
- max sat
- sat instances
- decision procedures
- pspace complete
- mazurkiewicz traces
- semantic web
- database
- query optimization
- search space
- conjunctive normal form