DeepAI AI Chat

Subsumption of Weakly Well-Designed SPARQL Patterns is Undecidable

01/27/2019

∙

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.

Mark Kaminski
9 publications
Egor V. Kostylev
12 publications

page 1

page 2

page 3

page 4

∙ 11/02/2020

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

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

0 Ruining Deng, et al. ∙

∙ 11/11/2021

Avoiding a pair of patterns in multisets and compositions

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

0 Vít Jelínek, et al. ∙

∙ 10/28/2019

Weak equivalence of higher-dimensional automata

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

0 Thomas Kahl, et al. ∙

∙ 09/01/2017

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...

0 Hendrik Richter, et al. ∙

∙ 07/31/2019

Reward Testing Equivalences for Processes

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

0 Rob van Glabbeek, et al. ∙

∙ 03/13/2023

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...

0 Mitre C. Dourado, et al. ∙

∙ 09/05/2019

Connected monads weakly preserve products

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

0 H. Peter Gumm, et al. ∙