Research summary: Analysing graph transformation systems using extended methods from constraint handling rules
Frank Raiser. Research summary: Analysing graph transformation systems using extended methods from constraint handling rules. 2009, 25th International Conference on Logic Programming, ICLP, volume 5649 of Lecture Notes in Computer Science, pages 540-541
Abstract:Research summary for doctoral consortium of ICLP’09.
Semi-automatic generation of CHR solvers for global constraints
Frank Raiser. Semi-automatic generation of CHR solvers for global constraints. 2008, Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, volume 5202 of Lecture Notes in Computer Science, pages 588-592
Abstract:Constraint programming often involves global constraints, for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR solvers for the subset of global constraints defineable by specific automata. The generation is based on a constraint logic program modelling an automaton and an improved version of the Prim-Miner algorithm. The solvers only need to be generated once and achieve arc-consistency for over 40 global constraints.
Graph Transformation Systems in CHR
Frank Raiser. Graph Transformation Systems in CHR. 2007, Logic Programming, 23rd International Conference, ICLP 2007, volume 4670 of Lecture Notes in Computer Science, pages 240-254
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.