A new criterion for ℳ, 𝒩-adhesivity, with an application to hierarchical graphs

01/01/2022
by   Davide Castelnovo, et al.
0

Adhesive categories provide an abstract framework for the algebraic approach to rewriting theory, where many general results can be recast and uniformly proved. However, checking that a model satisfies the adhesivity properties is sometimes far from immediate. In this paper we present a new criterion giving a sufficient condition for ℳ, 𝒩-adhesivity, a generalisation of the original notion of adhesivity. We apply it to several existing categories, and in particular to hierarchical graphs, a formalism that is notoriously difficult to fit in the mould of algebraic approaches to rewriting and for which various alternative definitions float around.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/04/2020

Abstract Mathematical morphology based on structuring element: Application to morpho-logic

A general definition of mathematical morphology has been defined within ...
12/03/2020

An Algebraic Graph Transformation Approach for RDF and SPARQL

We consider the recommendations of the World Wide Web Consortium (W3C) a...
07/22/2013

A generalized back-door criterion

We generalize Pearl's back-door criterion for directed acyclic graphs (D...
07/28/2019

On local real algebraic geometry and applications to kinematics

We address the question of identifying non-smooth points in affine real ...
01/14/2022

The Sassenfeld criterion revisited

The starting point of this article is a decades-old yet little-noticed s...
12/07/2020

Algebraic geometry of discrete interventional models

We investigate the algebra and geometry of general interventions in disc...
06/28/2021

Conormal Spaces and Whitney Stratifications

We describe a new algorithm for computing Whitney stratifications of com...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.