Cover Image

Unfoldings and coverings of weighted graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Courcelle, Bruno
Format:	Preprint
Published:	2022
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 describing trees and quasi-trees from their leaves
by: Courcelle, Bruno
Published: (2025)

On first-order definable operations on relational structures
by: Courcelle, Bruno
Published: (2026)

Causal Unfoldings and Disjunctive Causes
by: de Visme, Marc, et al.
Published: (2020)

Methods for Efficient Unfolding of Colored Petri Nets
by: Bilgram, Alexander, et al.
Published: (2022)

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

Decomposing graphs into stable and ordered parts
by: Buffière, Hector, et al.
Published: (2025)

Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml
by: Chirica, Ion, et al.
Published: (2025)

Reflexive graph lenses in univalent foundations
by: Sterling, Jonathan
Published: (2024)

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

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, et al.
Published: (2022)

Minimal covers in the Weihrauch degrees
by: Lempp, Steffen, et al.
Published: (2023)

Many-valued coalgebraic logic over semi-primal varieties
by: Kurz, Alexander, et al.
Published: (2023)

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

Trees in graphs of large linear cliquewidth
by: Bojańczyk, Mikołaj, et al.
Published: (2025)

Extension preservation on dense graph classes
by: Eleftheriadis, Ioannis
Published: (2024)

Adhesive category theory for graph rewriting in Rocq
by: Arsac, Samuel, et al.
Published: (2025)

Model checking with temporal graphs and their derivative
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

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

Tree algebras and bisimulation-invariant MSO on finite graphs
by: Colcombet, Thomas, et al.
Published: (2024)

A finite presentation of graphs of treewidth at most three
by: Doumane, Amina, et al.
Published: (2024)

Stateful Realizers for Nonstandard Analysis
by: Dinis, Bruno, et al.
Published: (2022)

Classifying covering types in homotopy type theory
by: Mimram, Samuel, et al.
Published: (2025)

Order-invariant cluster first-order logic on graph classes of bounded degree
by: Ghasemi, Fatemeh, et al.
Published: (2026)

Sequent Calculi for Data-Aware Modal Logics
by: Areces, Carlos, et al.
Published: (2025)

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems
by: Brunar, Johanna, et al.
Published: (2025)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
by: Li, Shuo, et al.
Published: (2023)

Foundational propositions of hesitant fuzzy soft $β$-covering approximation spaces
by: Lu, Shizhan
Published: (2024)

Hardness of monadic second-order formulae over succinct graphs
by: Gamard, Guilhem, et al.
Published: (2023)

Countability constraints in order-theoretic approaches to computability
by: Hack, Pedro, et al.
Published: (2022)

Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)

Rethinking the notion of oracle: A prequel to Lawvere-Tierney topologies for computability theorists
by: Kihara, Takayuki
Published: (2022)

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

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
by: Lichter, Moritz
Published: (2022)

A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates
by: Oda, Yukihiro, et al.
Published: (2022)

On proving consistency of equational theories in Bounded Arithmetic
by: Beckmann, Arnold, et al.
Published: (2022)

Incompleteness for stably computable formal systems
by: Savelyev, Yasha
Published: (2022)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
by: Gheorghiu, Alexander V., et al.
Published: (2022)

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
by: Livson, Ori, et al.
Published: (2025)

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
by: Oda, Yukihiro
Published: (2025)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)