Add to ORKGLinear logics have been shown to be able to embed both rewriting-based approaches and process calculi in a single, declarative framework. In this paper we are exploring the embedding of double-pushout graph transformations into quantified linear logic, leading to a Curry-Howard style isomorphism between graphs and transformations on one hand, formulas and proof terms on the other. With linear implication representing rules and reachability of graphs, and the tensor modelling parallel composition of graphs and transformations, we obtain a language able to encode graph transformation systems and their computations as well as reason about their properties
We have designed a new logic programming language called LM (Linear Meld) for programming graph-base...
Models of complex systems are widely used in the physical and socialsciences, and the concept of lay...
The algebraic approaches to graph transformation are based on the concept of gluing of graphs, mode...
Linear logics have been shown to be able to embed both rewriting-based approaches and process calcul...
Linear logics have been shown to be able to embed both rewriting-based approaches and process calcul...
Graph transformation has been used to model concurrent systems in software engineering, as well as i...
We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by ...
In this paper we investigate and compare four variants of the double-pushout approach to graph trans...
AbstractThis paper takes first steps towards a formalization of graph transformations in a general s...
Abstract. Given an intuitionistic proof net of linear logic, we abstract an order between its atomic...
A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri...
We introduce a new graphical representation for multiplicative and exponential linear logic proof-st...
We present a formalization of diagrammatic systems and transformations in a linear logic framework. ...
In the algebraic theory of graph grammars, it is common practice to present some notions or results ...
We extend our approach for verifying properties of graph transformation systems using suitable abstr...
We have designed a new logic programming language called LM (Linear Meld) for programming graph-base...
Models of complex systems are widely used in the physical and socialsciences, and the concept of lay...
The algebraic approaches to graph transformation are based on the concept of gluing of graphs, mode...
Linear logics have been shown to be able to embed both rewriting-based approaches and process calcul...
Linear logics have been shown to be able to embed both rewriting-based approaches and process calcul...
Graph transformation has been used to model concurrent systems in software engineering, as well as i...
We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by ...
In this paper we investigate and compare four variants of the double-pushout approach to graph trans...
AbstractThis paper takes first steps towards a formalization of graph transformations in a general s...
Abstract. Given an intuitionistic proof net of linear logic, we abstract an order between its atomic...
A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri...
We introduce a new graphical representation for multiplicative and exponential linear logic proof-st...
We present a formalization of diagrammatic systems and transformations in a linear logic framework. ...
In the algebraic theory of graph grammars, it is common practice to present some notions or results ...
We extend our approach for verifying properties of graph transformation systems using suitable abstr...
We have designed a new logic programming language called LM (Linear Meld) for programming graph-base...
Models of complex systems are widely used in the physical and socialsciences, and the concept of lay...
The algebraic approaches to graph transformation are based on the concept of gluing of graphs, mode...