Cover Image

Tighter Bounds for Query Answering with Guarded TGDs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Amarilli, Antoine, Benedikt, Michael
Format:	Preprint
Published:	2022
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Query Answering in Lattice-based Description Logic
by: Manoorkar, Krishna, et al.
Published: (2024)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
by: Amarilli, Antoine, et al.
Published: (2023)

Embedded Finite Models Beyond Restricted Quantifier Collapse
by: Benedikt, Michael, et al.
Published: (2023)

Optimal Lower Bounds for Symmetric Modular Circuits
by: Pago, Benedikt
Published: (2026)

Guarded Successor: A Novel Temporal Logic
by: Asor, Ohad
Published: (2024)

Pathformer: Recursive Path Query Encoding for Complex Logical Query Answering
by: Zhang, Chongzhi, et al.
Published: (2024)

How (and when) can you fit examples to logic-based hypothesis classes over infinite structures?
by: Benedikt, Michael, et al.
Published: (2026)

From learnable objects to learnable random objects
by: Anderson, Aaron, et al.
Published: (2025)

Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants
by: Kieronski, Emanuel, et al.
Published: (2016)

Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards (Extended Version)
by: Bednarczyk, Bartosz, et al.
Published: (2025)

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

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

An order out of nowhere: a new algorithm for infinite-domain CSPs
by: Mottet, Antoine, et al.
Published: (2023)

Bounds for Quantum Circuits using Logic-Based Analysis
by: Fauseweh, Benedikt, et al.
Published: (2024)

Multi-clocked Guarded Recursion Beyond ω
by: Møgelberg, Rasmus Ejlers
Published: (2025)

On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
by: Artale, Alessandro, et al.
Published: (2025)

Representing Guardedness in Call-by-Value and Guarded Parametrized Monads
by: Goncharov, Sergey
Published: (2024)

Choiceless Computation and Symmetry: Limitations of Definability
by: Pago, Benedikt
Published: (2024)

Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory
by: Benedikt, Michael, et al.
Published: (2022)

The complexity of Presburger arithmetic with power or powers
by: Benedikt, Michael, et al.
Published: (2023)

Guarded Negation Transitive Closure Logic
by: Figueira, Diego, et al.
Published: (2025)

On proving consistency of equational theories in Bounded Arithmetic
by: Beckmann, Arnold, et al.
Published: (2022)

Meta Operator for Complex Query Answering on Knowledge Graphs
by: Yin, Hang, et al.
Published: (2024)

Analysis of logics with arithmetic
by: Benedikt, Michael, et al.
Published: (2025)

Decidability of Graph Neural Networks via Logical Characterizations
by: Benedikt, Michael, et al.
Published: (2024)

Conditional Logical Message Passing Transformer for Complex Query Answering
by: Zhang, Chongzhi, et al.
Published: (2024)

Parameterized Infinite-State Reactive Synthesis
by: Maderbacher, Benedikt, et al.
Published: (2025)

Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2006)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

Almost-Sure Termination by Guarded Refinement
by: Gregersen, Simon Oddershede, et al.
Published: (2024)

Resource-Bounded Type Theory: Compositional Cost Analysis via Graded Modalities
by: Mannucci, Mirco A., et al.
Published: (2025)

Algebraic and algorithmic synergies between promise and infinite-domain CSPs
by: Mottet, Antoine
Published: (2025)

Convergence Laws for Extensions of First-Order Logic with Averaging
by: Adam-Day, Sam, et al.
Published: (2025)

Two variable logic with ultimately periodic counting
by: Benedikt, Michael, et al.
Published: (2020)

Resource-Bounded Martin-Löf Type Theory: Compositional Cost Analysis for Dependent Types
by: Mannucci, Mirco A., et al.
Published: (2026)

Branch-Well-Structured Transition Systems and Extensions
by: Bollig, Benedikt, et al.
Published: (2022)

On the Satisfiability of Local First-Order Logics with Data
by: Bollig, Benedikt, et al.
Published: (2023)

The Guarded Fragment with Nested Equivalences
by: Fiuk, Oskar
Published: (2026)

Queries With Exact Truth Values in Paraconsistent Description Logics
by: Bienvenu, Meghyn, et al.
Published: (2024)

Collapsing the bounded width hierarchy for infinite-domain CSPs: when symmetries are enough
by: Mottet, Antoine, et al.
Published: (2021)