Cover Image

On Piecewise Affine Reachability with Bellman Operators

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Varonka, Anton, Watanabe, Kazuki
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Logic in Computer Science Dynamical Systems
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
by: Bacik, Piotr, et al.
Published: (2026)

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

The domino problem is decidable for robust tilesets
by: Aubrun, Nathalie, et al.
Published: (2024)

Fixed Point Certificates for Reachability and Expected Rewards in MDPs
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Computability of extender sets in multidimensional subshifts: asymptotic growths, dynamical constraints
by: Callard, Antonin, et al.
Published: (2024)

Consistency of P-time event graphs is decidable in polynomial time (extended version)
by: Zorzenon, Davide, et al.
Published: (2023)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
by: Fuchser, Janne, et al.
Published: (2025)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
by: Lyon, Tim S.
Published: (2022)

Logic-based analogical proportions
by: Antić, Christian
Published: (2024)

Separability Properties of Monadically Dependent Graph Classes
by: Bonnet, Édouard, et al.
Published: (2025)

Epsilon-saturation for stable graphs and Littlestone classes
by: Malliaris, Maryanthe, et al.
Published: (2025)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)

Advances in Algorithmic Meta Theorems
by: Siebertz, Sebastian, et al.
Published: (2024)

Existential Positive Transductions of Sparse Graphs
by: Mählmann, Nikolas, et al.
Published: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
by: Dreier, Jan, et al.
Published: (2024)

Conditionals Based on Selection Functions, Modal Operators and Probabilities
by: Flaminio, Tommaso, et al.
Published: (2025)

SAT-Solving the Poset Cover Problem
by: Yuan, Chih-Cheng Rex, et al.
Published: (2025)

Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
by: Haar, Stefan, et al.
Published: (2025)

Verifying Sampling Algorithms via Distributional Invariants
by: Zilken, Daniel, et al.
Published: (2025)

On the number of asynchronous attractors in AND-NOT Boolean networks
by: Trinh, Van-Giang, et al.
Published: (2025)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
by: Van Caudenberg, Daimy, et al.
Published: (2025)

Learning Foundations Beneath the Stars
by: Cardone, Felice, et al.
Published: (2026)

Home Spaces and Invariants to Analyze Parameterized Petri Nets
by: Memmi, Gerard
Published: (2024)

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

Hypergraph rewriting and Causal structure of $λ-$calculus
by: Bajaj, Utkarsh
Published: (2024)

Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
by: Dreier, Jan
Published: (2021)

Analogical proportions II
by: Antić, Christian
Published: (2024)

First order complexity of finite random structures
by: Demin, Danila, et al.
Published: (2024)

First-order transducibility among classes of sparse graphs
by: Gajarský, Jakub, et al.
Published: (2025)

North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
by: Barnoff, Aaron, et al.
Published: (2025)

On the generalized coloring numbers
by: Siebertz, Sebastian
Published: (2025)

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

First-Order Logic and Twin-Width for Some Geometric Graphs
by: Geniet, Colin, et al.
Published: (2025)

Some remarks on the uncolored versions of the original CFI-graphs
by: Chen, Yijia, et al.
Published: (2025)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
by: Adler, Isolde, et al.
Published: (2025)

Queen Domination by SAT Solving
by: Rostami, Taha, et al.
Published: (2025)

Statistical Model Checking Beyond Means: Quantiles, CVaR, and the DKW Inequality (extended version)
by: Budde, Carlos E., et al.
Published: (2025)