Research Summary

Authors:
Frank Raiser
Affiliations:
Faculty of Engineering and Computer Sciences, Ulm University, Germany
Venue:
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Year:
2009

Citing 4
Cited 1

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)
Constraint Handling Rules

Constraint Handling Rules
Graph transformation systems in CHR

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Confluence of graph transformation revisited

Processes, Terms and Cycles

Analysing graph transformation systems through constraint handling rules

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint Handling Rules (CHR) [1] has become a general-purpose rule-based programming language throughout the last decade. The relations to many other formalisms have been investigated [2] and often results could be transferred from CHR to other formalisms, or vice versa.