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

June 28, 2023 · The Ethereal · 🏛 Proc. ACM Manag. Data

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sam M. Thompson, Dominik D. Freydenberger arXiv ID 2306.16364 Category cs.LO: Logic in CS Cross-listed cs.DB, cs.FL Citations 3 Venue Proc. ACM Manag. Data Last Checked 5 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Logic in CS