:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zorzenon, Davide, Raisch, Jörg
Format:	Preprint
Publié:	2023
Sujets:	Logic in Computer Science Discrete Mathematics Systems and Control
Accès en ligne:	https://arxiv.org/abs/2312.10764
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Infinite precedence graphs for consistency verification in P-time event graphs
par: Zorzenon, Davide, et autres
Publié: (2025)

Weak consistency of P-time event graphs
par: Zorzenon, Davide, et autres
Publié: (2022)

Periodic trajectories in P-time event graphs and the non-positive circuit weight problem
par: Zorzenon, Davide, et autres
Publié: (2021)

Switched max-plus linear-dual inequalities: cycle time analysis and applications
par: Zorzenon, Davide, et autres
Publié: (2023)

The domino problem is decidable for robust tilesets
par: Aubrun, Nathalie, et autres
Publié: (2024)

Fixed Point Certificates for Reachability and Expected Rewards in MDPs
par: Chatterjee, Krishnendu, et autres
Publié: (2025)

Some remarks on the uncolored versions of the original CFI-graphs
par: Chen, Yijia, et autres
Publié: (2025)

Computability of extender sets in multidimensional subshifts: asymptotic growths, dynamical constraints
par: Callard, Antonin, et autres
Publié: (2024)

Statistical Model Checking Beyond Means: Quantiles, CVaR, and the DKW Inequality (extended version)
par: Budde, Carlos E., et autres
Publié: (2025)

On first-order transductions of classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

Epsilon-saturation for stable graphs and Littlestone classes
par: Malliaris, Maryanthe, et autres
Publié: (2025)

Decomposition horizons and a characterization of stable hereditary classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

On Piecewise Affine Reachability with Bellman Operators
par: Varonka, Anton, et autres
Publié: (2025)

FO logic on cellular automata orbits equals MSO logic
par: Theyssier, Guillaume
Publié: (2024)

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

Boolean Variation and Boolean Logic BackPropagation
par: Nguyen, Van Minh
Publié: (2023)

First order distinguishability of sparse random graphs
par: Hershko, Tal, et autres
Publié: (2024)

First-order transducibility among classes of sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

3D-grids are not transducible from planar graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

First-order logic axiomatization of metric graph theory
par: Chalopin, Jérémie, et autres
Publié: (2022)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
par: Roberson, David E., et autres
Publié: (2023)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
par: Fuchser, Janne, et autres
Publié: (2025)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
par: Lyon, Tim S.
Publié: (2022)

Logic-based analogical proportions
par: Antić, Christian
Publié: (2024)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
par: Adler, Isolde, et autres
Publié: (2025)

Flipper games for monadically stable graph classes
par: Gajarský, Jakub, et autres
Publié: (2023)

Advances in Algorithmic Meta Theorems
par: Siebertz, Sebastian, et autres
Publié: (2024)

Separability Properties of Monadically Dependent Graph Classes
par: Bonnet, Édouard, et autres
Publié: (2025)

Existential Positive Transductions of Sparse Graphs
par: Mählmann, Nikolas, et autres
Publié: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
par: Buffière, Hector, et autres
Publié: (2026)

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

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
par: Dreier, Jan, et autres
Publié: (2024)

Elementary first-order model checking for sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2024)

Learning Foundations Beneath the Stars
par: Cardone, Felice, et autres
Publié: (2026)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
par: Bacik, Piotr, et autres
Publié: (2026)

Home Spaces and Invariants to Analyze Parameterized Petri Nets
par: Memmi, Gerard
Publié: (2024)

SAT-Solving the Poset Cover Problem
par: Yuan, Chih-Cheng Rex, et autres
Publié: (2025)

Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
par: Haar, Stefan, et autres
Publié: (2025)

Verifying Sampling Algorithms via Distributional Invariants
par: Zilken, Daniel, et autres
Publié: (2025)

On the number of asynchronous attractors in AND-NOT Boolean networks
par: Trinh, Van-Giang, et autres
Publié: (2025)