There is no abstract available for this article.
This work was supported by National Natural Science Foundation of China (Grant No. 61502336) and National Key Research and Development Program of China (Grant No. 2016YFB1000603).
Appendix: Preliminaries and Proofs.
[1]
Prudhommeaux E, Seaborne A. SPARQL query language for RDF. W3C Recommendation. 2008.
[2] Angles R, Gutierrez C. The expressive power of SPARQL. In: Proceedings of the 7th International Conference on the Semantic Web, Karlsruhe, 2008. 114--129. Google Scholar
[3] Pérez J, Arenas M, Gutierrez C. Semantics and complexity of SPARQL. ACM Trans Database Syst, 2009, 34: 1--45. Google Scholar
[4] Zhang X, Van den Bussche J. On the primitivity of operators in SPARQL. Inf Process Lett, 2014, 114: 480-485 CrossRef Google Scholar
[5] Kontchakov R, Kostylev E. On expressibility of non-monotone operators in SPARQL. In: Proceedings of International Conference Principles of Knowledge Representation and Reasoning (KR-16), Cape Town, 2016. 369--379. Google Scholar
[6] Zhang X, Van den Bussche J, Picalausa F. On the Satisfiability Problem for SPARQL Patterns. jair, 2016, 56: 403-428 CrossRef Google Scholar
[7] Arenas M, Gutierrez C, Miranker D P. Querying semantic data on the web?. SIGMOD Rec, 2013, 41: 6-17 CrossRef Google Scholar
[8] Kaminski M, Kostylev E. Beyond well-designed SPARQL. In: Proceedings of International Conference on Database Theory (ICDT-16), Bordeaux, 2016. Google Scholar
[9] Zhang X W, Van den Bussche J, Wang K, et al. On the satisfiability problem of patterns in SPARQL 1.1. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI-18), New Orleans, 2018. 2054--2061. Google Scholar
Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有
京ICP备18024590号-1