ACM Computing Surveys (CSUR)
Practical Reasoning for Expressive Description Logics
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Efficient static analysis of XML paths and types
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Conjunctive query containment and answering under description logic constraints
ACM Transactions on Computational Logic (TOCL)
The Expressive Power of SPARQL
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Using SPARQL with RDFS and OWL entailment
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
The complexity of enriched µ-calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A decision procedure for the alternation-free two-way modal µ-calculus
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Containment of regular path queries under description logic constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
| Hi-index | 0.00 |
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important in many areas, including information integration, query optimization, and reasoning about Entity-Relationship diagrams. We encode this problem into an expressive logic called μ-calculus: where RDF graphs become transition systems, queries and schema axioms become formulas. Thus, the containment problem is reduced to formula satisfiability test. Beyond the logic's expressive power, satisfiability solvers are available for it. Hence, this study allows to exploit these advantages.