Graph transformation systems in CHR

Authors:
Frank Raiser
Affiliations:
Faculty of Engineering and Computer Sciences, University of Ulm, Germany
Venue:
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Year:
2007

Citing 4
Cited 3

Relabelling in Graph Transformation

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Essentials of Constraint Programming

Essentials of Constraint Programming
Essentials of Constraint Programming

Essentials of Constraint Programming
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)

Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)

Research Summary

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Strong Joinability Analysis for Graph Transformation Systems in CHR

Electronic Notes in Theoretical Computer Science (ENTCS)
Analysing graph transformation systems through constraint handling rules

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show it is possible to embed graph transformation systems (GTS) soundly and completely in constraint handling rules (CHR). We suggest an encoding for the graph production rules and we investigate its soundness and completeness by ensuring equivalence of rule applicability and results. We furthermore compare the notion of confluence in both systems and show how to adjust a standard CHR confluence check to work for an embedded GTS.