Cover Image

The 2-Dimensional Constraint Loop Problem is Decidable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guilmant, Quentin, Lefaucheux, Engel, Ouaknine, Joël, Worrell, James
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Decidability of Presburger Arithmetic Expanded with Powers
by: Karimov, Toghrul, et al.
Published: (2024)

On the Complexity of the Skolem Problem at Low Orders
by: Bacik, Piotr, et al.
Published: (2025)

On the Decidability of Monadic Theories of Arithmetic Predicates
by: Berthé, Valérie, et al.
Published: (2024)

Termination Analysis of Linear-Constraint Programs
by: Ben-Amram, Amir M., et al.
Published: (2025)

Multiple Reachability in Linear Dynamical Systems
by: Karimov, Toghrul, et al.
Published: (2024)

The Monadic Theory of Toric Words
by: Berthé, Valérie, et al.
Published: (2023)

On the $p$-adic Skolem Problem
by: Bacik, Piotr, et al.
Published: (2025)

The Value Problem for Weighted Timed Games with Two Clocks is Undecidable
by: Guilmant, Quentin, et al.
Published: (2025)

Parametric disjunctive timed networks
by: André, Étienne, et al.
Published: (2025)

Expiring opacity problems in parametric timed automata
by: André, Étienne, et al.
Published: (2024)

On the Counting Complexity of the Skolem Problem
by: Jindal, Gorav, et al.
Published: (2024)

Deciding Termination of Simple Randomized Loops
by: Meyer, Éléanore, et al.
Published: (2025)

On Deciding Constant Runtime of Linear Loops
by: Frohn, Florian, et al.
Published: (2026)

The Bright Side of Timed Opacity
by: André, Étienne, et al.
Published: (2024)

Decidability of Quantum Modal Logic
by: Tokuo, Kenji
Published: (2026)

Decidability and Complexity of Decision Problems for Affine Continuous VASS
by: Balasubramanian, A. R.
Published: (2024)

Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)

Dynamic Probability Logic: Decidability & Computability
by: Chopoghloo, Somayeh, et al.
Published: (2024)

Decidability of Quasi-Dense Modal Logics
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)

Generalized Decidability via Brouwer Trees
by: de Jong, Tom, et al.
Published: (2026)

Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
by: Lutz, Carsten, et al.
Published: (2024)

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
by: Neumann, Eike
Published: (2025)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
by: Artale, Alessandro, et al.
Published: (2025)

Model Checking Markov Chains as Distribution Transformers
by: Aghamov, Rajab, et al.
Published: (2024)

Decidability Problems for Micro-Stipula
by: Delzanno, Giorgio, et al.
Published: (2025)

Model Checking Linear Temporal Logic with Standpoint Modalities
by: Aghamov, Rajab, et al.
Published: (2025)

The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
by: Pratt-Hartmann, Ian
Published: (2017)

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

Measuring Decidability as Related to Busy Beaver Numbers
by: Tandi, Gurpreet, et al.
Published: (2026)

Decidability of MSO Reparameterization over Countable Chains
by: Rabinovich, Alexander
Published: (2026)

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

Identity Testing for Radical Expressions
by: Balaji, Nikhil, et al.
Published: (2022)

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
by: Su, Wanyun, et al.
Published: (2024)

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

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
by: Li, Yongming
Published: (2025)

Deciding Predicate Logical Theories of Real-Valued Functions
by: Ratschan, Stefan
Published: (2023)

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
by: Gamsakhurdia, Mariami, et al.
Published: (2025)

Undecidability of the Emptiness Problem of Deterministic Propositional While Programs with Graph Loop: Hypothesis Elimination Using Loops
by: Nakamura, Yoshiki
Published: (2025)

Reaching Classicality through Transitive Closure
by: Blomet, Quentin, et al.
Published: (2025)