On the Satisfiability Problem for SPARQL Patterns
Work
Year: 2016
Type: article
Abstract: The satisfiability problem for SPARQL 1.0 patterns is undecidable in general, since the relational algebra can be emulated using such patterns. The goal of this paper is to delineate the boundary of d... more
Institutions Tianjin University, Hasselt University
Cites: 22
Cited by: 23
Related to: 10
FWCI: 3.608
Citation percentile (by year/subfield): 95.6
Topic: Semantic Web and Ontologies
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: diamond