A Nesting-Free Normal Form for Nested Conditions in Finite Lattices of Subgraphs
classification
🧮 math.CT
cs.LO
keywords
conditionsfiniteformlatticesnestednesting-freenormalsubgraphs
read the original abstract
We present a nesting-free normal form for the formalism of nested conditions and constraints in the context of finite lattices of subgraphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.