A nesting-free normal form for nested conditions in finite lattices of subgraphs

TL;DR

This paper introduces a nesting-free normal form for nested conditions in finite lattices of subgraphs, simplifying the representation of complex graph constraints.

Contribution

It proposes a novel nesting-free normal form for nested conditions, improving the expressiveness and simplicity of graph constraint formalisms.

Findings

Simplifies the representation of nested graph conditions.

Enhances the expressiveness of graph constraint formalisms.

Provides a formal basis for nesting-free conditions.

Abstract

We present a nesting-free normal form for the formalism of nested conditions and constraints in the context of finite lattices of subgraphs.