Image de couverture de livre

Identifying Tractable Quantified Temporal Constraints within Ord-Horn

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rydval, Jakub, Semanišinová, Žaneta, Wrona, Michał
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Universal Horn Sentences and the Joint Embedding Property
par: Bodirsky, Manuel, et autres
Publié: (2021)

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
par: Pinsker, Michael, et autres
Publié: (2025)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
par: Bodirsky, Manuel, et autres
Publié: (2024)

Finitely Bounded Homogeneity Turned Inside-Out
par: Rydval, Jakub
Publié: (2021)

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

The Polynomial Hierarchy and $ω$-categorical CSPs
par: Pro, Santiago Guzmán, et autres
Publié: (2026)

The Complexity of Resilience for Digraph Queries
par: Bodirsky, Manuel, et autres
Publié: (2026)

The complete classification for quantified equality constraints
par: Zhuk, Dmitriy, et autres
Publié: (2021)

Complexity Classification Transfer for CSPs via Algebraic Products
par: Bodirsky, Manuel, et autres
Publié: (2022)

Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules
par: Lyon, Tim S., et autres
Publié: (2026)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
par: Bodirsky, Manuel, et autres
Publié: (2023)

The Golden Path to Guarded Monotone Strict NP
par: Barsukov, Alexey, et autres
Publié: (2023)

Collapsing the bounded width hierarchy for infinite-domain CSPs: when symmetries are enough
par: Mottet, Antoine, et autres
Publié: (2021)

An abstract fixed-point theorem for Horn formula equations
par: Hetzl, Stefan, et autres
Publié: (2025)

Tractable Hyperproperties for MDPs
par: Gerlach, Lina, et autres
Publié: (2026)

Model-checking positive equality free logic on a fixed structure (direttissima)
par: Bodirsky, Manuel, et autres
Publié: (2024)

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

Solving Set Constraints with Comprehensions and Bounded Quantifiers
par: Mohamed, Mudathir, et autres
Publié: (2025)

Open Horn Type Theory
par: Poernomo, Iman
Publié: (2025)

Applications of Quantified Constraint Solving over the Reals -- Bibliography
par: Ratschan, Stefan
Publié: (2012)

CTL* Verification and Synthesis using Existential Horn Clauses
par: Carelli, Mishel, et autres
Publié: (2024)

Embedded Finite Models Beyond Restricted Quantifier Collapse
par: Benedikt, Michael, et autres
Publié: (2023)

Theta as a Horn Solver
par: Bajczi, Levente, et autres
Publié: (2025)

Some General Completeness Results for Propositionally Quantified Modal Logics
par: Ding, Yifeng, et autres
Publié: (2024)

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

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
par: Dorochko, Leonid, et autres
Publié: (2026)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
par: Lyon, Tim S., et autres
Publié: (2023)

Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types
par: Katsura, Hiroyuki, et autres
Publié: (2025)

TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems
par: Sidrane, Chelsea, et autres
Publié: (2024)

Efficient reversal of transductions of sparse graph classes
par: Dreier, Jan, et autres
Publié: (2026)

Catamorphic Abstractions for Constrained Horn Clause Satisfiability
par: De Angelis, Emanuele, et autres
Publié: (2024)

On the Computational Tractability of the (Many) Shapley Values
par: Marzouk, Reda, et autres
Publié: (2025)

Dependence Logics in Temporal Settings
par: Baltag, Alexandru, et autres
Publié: (2022)

Presburger Functional Synthesis: Complexity and Tractable Normal Forms
par: Akshay, S., et autres
Publié: (2025)

From Quantifier Depth to Quantifier Number: Separating Structures with k Variables
par: Vinall-Smeeth, Harry
Publié: (2023)

A New Tractable Description Logic under Categorical Semantics
par: Duc, Chan Le, et autres
Publié: (2025)

Guarded Successor: A Novel Temporal Logic
par: Asor, Ohad
Publié: (2024)

The Undecidability of Quantified Announcements
par: Ågotnes, Thomas, et autres
Publié: (2024)

Interpolation and Quantifiers in Ortholattices
par: Guilloud, Simon, et autres
Publié: (2025)

Towards Constraint Temporal Answer Set Programming
par: Cabalar, Pedro, et autres
Publié: (2025)