On the Satisfiability Problem of Patterns in SPARQL 1.1
No Thumbnail Available
File version
Author(s)
Zhang, X
Van Den Bussche, J
Wang, Kewen
Wang, Zhe
Van Den Bussche, J
Wang, Kewen
Wang, Zhe
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2018
Size
File type(s)
Location
Louisiana, USA
License
Abstract
The pattern satisfiability is a fundamental problem for SPARQL. This paper provides a complete analysis of decidability/undecidability of satisfiability problems for SPARQL 1.1 patterns. A surprising result is the undecidability of satisfiability for SPARQL 1.1 patterns when only AND and MINUS are expressible. Also, it is shown that any fragment of SPARQL 1.1 without expressing both AND and MINUS is decidable. These results provide a guideline for future SPARQL query language design and implementation.
Journal Title
Conference Title
32nd AAAI Conference on Artificial Intelligence, AAAI 2018
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
DOI
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Artificial intelligence
Communications engineering