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.
Fields of Study & Subjects
Logic
Reasoning
and Knowledge
Advanced Graph Theory Research
Advanced Algebra and Logic
Publication details
- Journal / source
- Research Portal (King's College London)
- Publication date
- 26 January 2026
- Language
- EN