Cover Image

Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cate, Balder ten, Kolaitis, Phokion G., Kristjánsson, Arnar Á.
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

When do homomorphism counts help in query algorithms?
by: Cate, Balder ten, et al.
Published: (2023)

Interpolation in First-Order Logic
by: Cate, Balder ten, et al.
Published: (2025)

Craig Interpolation for Decidable First-Order Fragments
by: Cate, Balder ten, et al.
Published: (2023)

Characterising Modal Formulas with Examples
by: Cate, Balder ten, et al.
Published: (2023)

Query Repairs
by: Cate, Balder ten, et al.
Published: (2025)

Six Proofs of Interpolation for the Modal Logic K
by: Bezhanishvili, Nick, et al.
Published: (2025)

Modal Fragments
by: Bezhanishvili, Nick, et al.
Published: (2026)

Characterizing Data Dependencies Then and Now
by: Kolaitis, Phokion G., et al.
Published: (2024)

Expressive Power of Deep Homomorphism Networks over Relational Databases
by: Schönherr, Moritz, et al.
Published: (2026)

When do modal definability and preservation theorems transfer to the finite?
by: van Benthem, Johan, et al.
Published: (2026)

Codd's Theorem for Databases over Semirings
by: Badia, Guillermo, et al.
Published: (2025)

Characterizing LTL Formulas by Examples
by: Cate, Balder ten, et al.
Published: (2026)

The Size of Interpolants in Modal Logics
by: Cate, Balder ten, et al.
Published: (2025)

Disjunctions of Two Dependence Atoms
by: Fröhlich, Nicolas, et al.
Published: (2025)

Logical Expressiveness of Graph Neural Networks with Hierarchical Node Individualization
by: Soeteman, Arie, et al.
Published: (2025)

Preservation theorems for Tarski's relation algebra
by: Bogaerts, Bart, et al.
Published: (2023)

Multi-Structural Games and Beyond
by: Carmosino, Marco, et al.
Published: (2023)

Who Wins the Multi-Structural Game?
by: Fagin, Ronald, et al.
Published: (2025)

On the Power and Limitations of Examples for Description Logic Concepts
by: Cate, Balder ten, et al.
Published: (2024)

How Expressive Are Graph Neural Networks in the Presence of Node Identifiers?
by: Soeteman, Arie, et al.
Published: (2026)

On the Number of Quantifiers Needed to Define Boolean Functions
by: Carmosino, Marco, et al.
Published: (2024)

Aspects of Coherence in Dependence Logic
by: Barlag, Timon, et al.
Published: (2026)

Parallel Play Saves Quantifiers
by: Carmosino, Marco, et al.
Published: (2024)

Rewriting Consistent Answers on Annotated Data
by: Kolaitis, Phokion G., et al.
Published: (2024)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
by: Neuen, Daniel, et al.
Published: (2026)

Modular Counting CSP: Reductions and Algorithms
by: Kazeminia, Amirhossein, et al.
Published: (2025)

Learning Aggregate Queries Defined by First-Order Logic with Counting
by: van Bergerem, Steffen, et al.
Published: (2024)

On Homomorphism Indistinguishability and Hypertree Depth
by: Scheidt, Benjamin
Published: (2024)

Structural Indexing of Relational Databases for the Evaluation of Free-Connex Acyclic Conjunctive Queries
by: Riveros, Cristian, et al.
Published: (2026)

An Algorithmic Meta Theorem for Homomorphism Indistinguishability
by: Seppelt, Tim
Published: (2024)

Verifying SQL Queries using Theories of Tables and Relations
by: Mohamed, Mudathir, et al.
Published: (2024)

Efficient Evaluation of Arbitrary Relational Calculus Queries
by: Raszyk, Martin, et al.
Published: (2022)

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
by: Lichter, Moritz
Published: (2022)

MCAC: A Model Counting Algorithm for Exact Computation of Error Metrics of Approximate Circuits
by: Ramprasath, S, et al.
Published: (2024)

Database Research needs an Abstract Relational Query Language
by: Gatterbauer, Wolfgang, et al.
Published: (2025)

Semijoins of Annotated Relations
by: Kolaitis, Phokion G.
Published: (2026)

FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree
by: Lohrey, Markus, et al.
Published: (2025)

Graph Homomorphism, Monotone Classes and Bounded Pathwidth
by: Eagling-Vose, Tala, et al.
Published: (2024)

Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite
by: Löhnert, Bianca, et al.
Published: (2024)

A Simple Algorithm for Consistent Query Answering under Primary Keys
by: Figueira, Diego, et al.
Published: (2023)