A Nesting-Free Normal Form for Nested Conditions in Finite Lattices of Subgraphs
Abstract
We present a nesting-free normal form for the formalism of nested conditions and constraints in the context of finite lattices of subgraphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.