Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC
Summary: Derive general inexpressibility lemmas for FC (finite-model concatenation) via Ehrenfeucht-Fraïssé games, yielding concrete non-definable relations. Lift these FC barriers to prove several relations are not selectable by generalized core spanners, sharpening core spanner expressivity limits. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Sam M. Thompson (Loughborough University)
- 2. Dominik D. Freydenberger (Loughborough University)
BibTeX Citation
@inproceedings{thompson_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC}},
url = {https://dl.acm.org/doi/10.1145/3651143},
doi = {10.1145/3651143},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Thompson, Sam M. and Freydenberger, Dominik D.},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,703 | Spanner Evaluation over SLP-Compressed Documents | 2021 | PODS | 6.5336472e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,630 | Constant Delay Algorithms for Regular Document Spanners | 2018 | PODS |
| 2 | 3,814 | On the Expressive Power of Datalog: Tools and a Case Study | 1990 | PODS |
| 3 | 13,671 | A Dichotomy in the Intensional Expressive Power of Nested Relational Calculi augmented with Aggregate Functions and a Powerset Operator | 2013 | PODS |
| 4 | 8,849 | Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability | 2015 | PODS |
| 5 | 8,330 | The Expressive Powers of the Logic Programming Semantics | 1990 | PODS |
| 6 | 14,474 | Expressibility of Bounded-Arity Fixed-Point Query Hierarchies | 1989 | PODS |
| 7 | 1,535 | Joining Extractions of Regular Expressions | 2018 | PODS |
| 8 | 5,232 | On the Expressive Power of Logic Programming Languages with Sets | 1988 | PODS |
| 9 | 2,354 | Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity | 2018 | PODS |
| 10 | 12,281 | Spanners: A Formal Framework for Information Extraction | 2013 | PODS |