Cover Image

FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lohrey, Markus, Maneth, Sebastian, Schmid, Markus L.
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

MSO-Enumeration Over SLP-Compressed Unranked Forests
by: Lohrey, Markus, et al.
Published: (2024)

Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators
by: Bannach, Max, et al.
Published: (2024)

Dynamic Planar Graph Isomorphism is in DynFO
by: Datta, Samir, et al.
Published: (2026)

Tighter Bounds for Query Answering with Guarded TGDs
by: Amarilli, Antoine, et al.
Published: (2022)

FO-Complete Program Verification for Heap Logics
by: Murali, Adithya, et al.
Published: (2026)

Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
by: Hecher, Markus, et al.
Published: (2024)

Enumerating Independent Linear Inferences
by: Das, Anupam, et al.
Published: (2021)

On Enumerating Short Projected Models
by: Möhle, Sibylle, et al.
Published: (2021)

Degrees of incomputability, realizability and constructive reverse mathematics
by: Kihara, Takayuki
Published: (2020)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
by: Kleest-Meißner, Sarah, et al.
Published: (2022)

Local-Order-Invariant Logic on Classes of Bounded Degree
by: Aoki, Derek
Published: (2025)

From MBQI to Enumerative Instantiation and Back
by: Dančo, Marek, et al.
Published: (2025)

Disjoint Partial Enumeration without Blocking Clauses
by: Spallitta, Giuseppe, et al.
Published: (2023)

Extending CDCL-based Model Enumeration with Weights
by: Spallitta, Giuseppe, et al.
Published: (2026)

Positive and monotone fragments of FO and LTL
by: Kuperberg, Denis, et al.
Published: (2024)

Automated Hybrid Grounding Using Structural and Data-Driven Heuristics
by: Beiser, Alexander, et al.
Published: (2025)

Coalgebraic Path Constraints
by: Schmid, Todd
Published: (2026)

Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts
by: Cate, Balder ten, et al.
Published: (2025)

Disjoint Projected Enumeration for SAT and SMT without Blocking Clauses
by: Spallitta, Giuseppe, et al.
Published: (2024)

parSAT: Parallel Solving of Floating-Point Satisfiability
by: Krahl, Markus, et al.
Published: (2025)

Chase Termination Beyond Polynomial Time
by: Hanisch, Philipp, et al.
Published: (2024)

Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
by: Hanisch, Philipp, et al.
Published: (2026)

Algebraic Characterizations of Classes of Regular Languages in DynFO
by: Barloy, Corentin, et al.
Published: (2026)

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

A Simple and Effective ASP-Based Tool for Enumerating Minimal Hitting Sets
by: Kabir, Mohimenul, et al.
Published: (2025)

Bounded Structural Model Finding with Symbolic Data Constraints
by: Boronat, Artur
Published: (2026)

Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT
by: Civini, Emanuele, et al.
Published: (2026)

FO logic on cellular automata orbits equals MSO logic
by: Theyssier, Guillaume
Published: (2024)

Algebraic Reasoning over Relational Structures
by: Jurka, Jan, et al.
Published: (2024)

A General Completeness Theorem for Skip-free Star Algebras
by: Kappé, Tobias, et al.
Published: (2025)

Breaking Symmetries in Quantified Graph Search: A Comparative Study
by: Janota, Mikoláš, et al.
Published: (2025)

The Shape of $\mathcal{EL}$ Proofs: A Tale of Three Calculi (Extended Version)
by: Alrabbaa, Christian, et al.
Published: (2025)

The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)

Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings
by: Muñoz, Martín
Published: (2026)

Constant-delay enumeration for SLP-compressed documents
by: Muñoz, Martín, et al.
Published: (2022)

On matrix rank function over bounded arithmetics
by: Ken, Eitetsu, et al.
Published: (2023)

Enumerating Minimal Unsatisfiable Cores of LTLf formulas
by: Ielo, Antonio, et al.
Published: (2024)

A Comprehensive Tutorial on over 100 Years of Diagrammatic Representations of Logical Statements and Relational Queries
by: Gatterbauer, Wolfgang
Published: (2024)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)

Mathematical Knowledge Bases as Grammar-Compressed Proof Terms: Exploring Metamath Proof Structures
by: Wernhard, Christoph, et al.
Published: (2025)