:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Rydval, Jakub, Semanišinová, Žaneta, Wrona, Michał
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2402.09187
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Universal Horn Sentences and the Joint Embedding Property
by: Bodirsky, Manuel, et al.
Published: (2021)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
by: Bodirsky, Manuel, et al.
Published: (2024)

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
by: Pinsker, Michael, et al.
Published: (2025)

Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)

The Complexity of Resilience for Digraph Queries
by: Bodirsky, Manuel, et al.
Published: (2026)

The Polynomial Hierarchy and $ω$-categorical CSPs
by: Pro, Santiago Guzmán, et al.
Published: (2026)

Complexity Classification Transfer for CSPs via Algebraic Products
by: Bodirsky, Manuel, et al.
Published: (2022)

Quasi Directed Jonsson Operations Imply Bounded Width (For fo-expansions of symmetric binary cores with free amalgamation)
by: Wrona, Michal
Published: (2024)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
by: Bodirsky, Manuel, et al.
Published: (2023)

The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)

The Golden Path to Guarded Monotone Strict NP
by: Barsukov, Alexey, et al.
Published: (2023)

Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules
by: Lyon, Tim S., et al.
Published: (2026)

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

Model-checking positive equality free logic on a fixed structure (direttissima)
by: Bodirsky, Manuel, et al.
Published: (2024)

An abstract fixed-point theorem for Horn formula equations
by: Hetzl, Stefan, et al.
Published: (2025)

Tractable Hyperproperties for MDPs
by: Gerlach, Lina, et al.
Published: (2026)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
by: Zhuk, Dmitriy
Published: (2024)

Open Horn Type Theory
by: Poernomo, Iman
Published: (2025)

Solving Set Constraints with Comprehensions and Bounded Quantifiers
by: Mohamed, Mudathir, et al.
Published: (2025)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
by: Dorochko, Leonid, et al.
Published: (2026)

Applications of Quantified Constraint Solving over the Reals -- Bibliography
by: Ratschan, Stefan
Published: (2012)

CTL* Verification and Synthesis using Existential Horn Clauses
by: Carelli, Mishel, et al.
Published: (2024)

Theta as a Horn Solver
by: Bajczi, Levente, et al.
Published: (2025)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
by: Lyon, Tim S., et al.
Published: (2023)

Efficient reversal of transductions of sparse graph classes
by: Dreier, Jan, et al.
Published: (2026)

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

TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems
by: Sidrane, Chelsea, et al.
Published: (2024)

On the Computational Tractability of the (Many) Shapley Values
by: Marzouk, Reda, et al.
Published: (2025)

A note on Stone-Čech compactification in ZFA
by: Przybyłek, Michał R.
Published: (2023)

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)

Catamorphic Abstractions for Constrained Horn Clause Satisfiability
by: De Angelis, Emanuele, et al.
Published: (2024)

Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types
by: Katsura, Hiroyuki, et al.
Published: (2025)

Presburger Functional Synthesis: Complexity and Tractable Normal Forms
by: Akshay, S., et al.
Published: (2025)

3D-grids are not transducible from planar graphs
by: Gajarský, Jakub, et al.
Published: (2025)

HornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses(Technical Report)
by: Jiang, Hongjian, et al.
Published: (2025)

A New Tractable Description Logic under Categorical Semantics
by: Duc, Chan Le, et al.
Published: (2025)

Dependence Logics in Temporal Settings
by: Baltag, Alexandru, et al.
Published: (2022)

Elementary first-order model checking for sparse graphs
by: Gajarský, Jakub, et al.
Published: (2024)

Towards Constraint Temporal Answer Set Programming
by: Cabalar, Pedro, et al.
Published: (2025)

Monadic Second-Order Logic of Permutations
by: Jelínek, Vít, et al.
Published: (2025)