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

Henning Christiansen, Maja Hanne Kirkeby

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

Resumé

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.
OriginalsprogEngelsk
TitelFunctional and Constraint Logic Programming : 26th International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers
Antal sider130
Vol/bind11285
ForlagSpringer
Publikationsdato2019
Sider112
ISBN (Trykt)978-3-030-16201-6
DOI
StatusUdgivet - 2019
NavnLecture Notes in Computer Science
Vol/bind11285
ISSN0302-9743

Citer dette

Christiansen, H., & Kirkeby, M. H. (2019). Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs. I Functional and Constraint Logic Programming : 26th International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers (Bind 11285, s. 112). Springer . Lecture Notes in Computer Science, Bind. 11285 https://doi.org/10.1007/978-3-030-16202-3_7
Christiansen, Henning ; Kirkeby, Maja Hanne. / Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs. Functional and Constraint Logic Programming : 26th International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers. Bind 11285 Springer , 2019. s. 112 (Lecture Notes in Computer Science, Bind 11285).
@inproceedings{ae9314051271461a811beb8a2d3c6a1d,
title = "Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs",
abstract = "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.",
author = "Henning Christiansen and Kirkeby, {Maja Hanne}",
year = "2019",
doi = "10.1007/978-3-030-16202-3_7",
language = "English",
isbn = "978-3-030-16201-6",
volume = "11285",
pages = "112",
booktitle = "Functional and Constraint Logic Programming",
publisher = "Springer",

}

Christiansen, H & Kirkeby, MH 2019, Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs. i Functional and Constraint Logic Programming : 26th International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers. bind 11285, Springer , Lecture Notes in Computer Science, bind 11285, s. 112. 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.

Functional and Constraint Logic Programming : 26th International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers. Bind 11285 Springer , 2019. s. 112 (Lecture Notes in Computer Science, Bind 11285).

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer 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

VL - 11285

SP - 112

BT - Functional and Constraint Logic Programming

PB - Springer

ER -

Christiansen H, Kirkeby MH. Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs. I Functional and Constraint Logic Programming : 26th International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers. Bind 11285. Springer . 2019. s. 112. (Lecture Notes in Computer Science, Bind 11285). https://doi.org/10.1007/978-3-030-16202-3_7