### Abstract

Original language | English |
---|---|

Title of host publication | Functional and Constraint Logic Programming : 26.International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers |

Editors | Josep Silva |

Place of Publication | Cham |

Publisher | Springer |

Publication date | 2019 |

Pages | 112-130 |

ISBN (Print) | 978-3-030-16201-6 |

DOIs | |

Publication status | Published - 2019 |

Event | The 26th International Workshop on Functional and Logic Programming - Göthe-University Frankfurt am Main, Frankfurt, Germany Duration: 6 Sep 2018 → 6 Sep 2018 Conference number: 26 http://ppdp-lopstr-18.cs.uni-frankfurt.de/wflp18.html |

### Conference

Conference | The 26th International Workshop on Functional and Logic Programming |
---|---|

Number | 26 |

Location | Göthe-University Frankfurt am Main |

Country | Germany |

City | Frankfurt |

Period | 06/09/2018 → 06/09/2018 |

Internet address |

Series | Lecture Notes in Computer Science |
---|---|

Volume | 11285 |

ISSN | 0302-9743 |

Series | Theoretical Computer Science and General Issues |
---|---|

Number | 11285 |

### Cite this

*Functional and Constraint Logic Programming : 26.International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers*(pp. 112-130). Cham: Springer. Lecture Notes in Computer Science, Vol.. 11285, Theoretical Computer Science and General Issues, No. 11285 https://doi.org/10.1007/978-3-030-16202-3_7

}

*Functional and Constraint Logic Programming : 26.International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers.*Springer, Cham, Lecture Notes in Computer Science, vol. 11285, Theoretical Computer Science and General Issues, no. 11285, pp. 112-130, The 26th International Workshop on Functional and Logic Programming, Frankfurt, Germany, 06/09/2018. https://doi.org/10.1007/978-3-030-16202-3_7

**Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs.** / Christiansen, Henning; Kirkeby, Maja Hanne.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs

AU - Christiansen, Henning

AU - Kirkeby, Maja Hanne

PY - 2019

Y1 - 2019

N2 - Confluence of a nondeterministic program ensures a functional input-output relation, freeing the programmer from considering the actual scheduling strategy, and allowing optimized and perhaps parallel implementations. The more general property of confluence modulo equivalence ensures that equivalent inputs are related to equivalent outputs, that need not be identical. Confluence under invariants is also considered. Constraint Handling Rules (CHR) is an important example of a rewrite based logic programming language, and we aim at a mechanizable method for proving confluence modulo equivalence of terminating CHR programs. While earlier approaches to confluence for CHR programs concern an idealized logic subset, we refer to a semantics compatible with standard Prolog-based implementations. We specify a meta-level constraint language in which invariants and equivalences can be expressed and manipulated as is needed for confluence proofs, thus extending our previous theoretical results towards a practical implementation.

AB - Confluence of a nondeterministic program ensures a functional input-output relation, freeing the programmer from considering the actual scheduling strategy, and allowing optimized and perhaps parallel implementations. The more general property of confluence modulo equivalence ensures that equivalent inputs are related to equivalent outputs, that need not be identical. Confluence under invariants is also considered. Constraint Handling Rules (CHR) is an important example of a rewrite based logic programming language, and we aim at a mechanizable method for proving confluence modulo equivalence of terminating CHR programs. While earlier approaches to confluence for CHR programs concern an idealized logic subset, we refer to a semantics compatible with standard Prolog-based implementations. We specify a meta-level constraint language in which invariants and equivalences can be expressed and manipulated as is needed for confluence proofs, thus extending our previous theoretical results towards a practical implementation.

U2 - 10.1007/978-3-030-16202-3_7

DO - 10.1007/978-3-030-16202-3_7

M3 - Article in proceedings

SN - 978-3-030-16201-6

SP - 112

EP - 130

BT - Functional and Constraint Logic Programming

A2 - Silva, Josep

PB - Springer

CY - Cham

ER -