A Nesting-Free Normal Form for Nested Conditions in Finite Lattices of Subgraphs
arXiv:2601.18376
Abstract
We present a nesting-free normal form for the formalism of nested conditions and constraints in the context of finite lattices of subgraphs.
21 pages; extended version of paper appearing at GCM 2026 (containing proofs)