Research Output per year
This project aims at extending existing results on proving confluence for CHR programs to confluence modulo an equivalence relation (CME). Given an equivalence relation ≈, a program is CME whenever alternative end states are equivalent modulo ≈. CME is highly relevant for CHR as it extends the notion of confluence to a much larger class of programs, including dynamic programming algorithms with pruning (such as Viterbi and Dijkstra's shortest path) and programs with redundant data structures (e.g., representing sets as lists or trees as in Union-Find).
|Effective start/end date||01/11/2015 → 31/12/2018|
- Det Frie Forskningsråd | Natur og Univers: €311,134.00
Research output: Contribution to journal › Journal article › Research › peer-review
Activities per year
Activity: Participating in or organising an event › Participation in workshop, seminar, course
Activity: Participating in or organising an event › Organisation and participation in conference