Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC

06/28/2023
by   Sam M. Thompson, et al.
0

Despite considerable research on document spanners, little is known about the expressive power of generalized core spanners. In this paper, we use Ehrenfeucht-Fraïssé games to obtain general inexpressibility lemmas for the logic FC (a finite-model variant of the theory of concatenation). Applying these lemmas give inexpressibility results for FC that we lift to generalized core spanners. In particular, we give several relations that cannot be selected by generalized core spanners, thus demonstrating the effectiveness of the inexpressibility lemmas. As an immediate consequence, we also gain new insights into the expressive power of core spanners.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2018

Syntax and Typing for Cedille Core

This document specifies a core version of the type theory implemented in...
research
09/24/2019

Dynamic Complexity of Document Spanners

The present paper investigates the dynamic complexity of document spanne...
research
12/12/2019

Finite models and the theory of concatenation

We propose FC, a logic on words that combines the previous approaches of...
research
12/12/2019

The theory of concatenation over finite models

We propose FC, a logic on words that combines the previous approaches of...
research
05/06/2020

Further results on weighted core-EP inverse of matrices

In this paper, we introduce the notation of E-weighted core-EP and F-wei...
research
01/28/2020

Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output

The Shapley-Shubik index is a specialization of the Shapley value and is...

Please sign up or login with your details

Forgot password? Click here to reset