DeepAI AI Chat
Log In Sign Up

Subsumption of Weakly Well-Designed SPARQL Patterns is Undecidable

by   Mark Kaminski, et al.
University of Oxford

Weakly well-designed SPARQL patterns is a recent generalisation of well-designed patterns, which preserve good computational properties but also capture almost all patterns that appear in practice. Subsumption is one of static analysis problems for SPARQL, along with equivalence and containment. In this paper we show that subsumption is undecidable for weakly well-designed patterns, which is in stark contrast to well-designed patterns, and to equivalence and containment.


page 1

page 2

page 3

page 4


CaCL: Class-aware Codebook Learning for Weakly Supervised Segmentation on Diffuse Image Patterns

Weakly supervised learning has been rapidly advanced in biomedical image...

Avoiding a pair of patterns in multisets and compositions

In this paper, we study the Wilf-type equivalence relations among multis...

Weak equivalence of higher-dimensional automata

This paper introduces a notion of weak equivalence for higher-dimensiona...

Visual art inspired by the collective feeding behavior of sand-bubbler crabs

Sand-bubbler crabs of the genera Dotilla and Scopimera are known to prod...

Reward Testing Equivalences for Processes

May and must testing were introduced by De Nicola and Hennessy to define...

Computing the hull and interval numbers in the weakly toll convexity

A walk u_0u_1 … u_k-1u_k of a graph G is a weakly toll walk if u_0u_k ∉E...

Connected monads weakly preserve products

If F is a (not necessarily associative) monad on Set, then the natural t...