Confluence of CHR Revisited: Invariants and Modulo Equivalence

Henning Christiansen; Maja Hanne Kirkeby

doi:10.1007/978-3-030-13838-7_6

Confluence of CHR Revisited: Invariants and Modulo Equivalence

Henning Christiansen, Maja Hanne Kirkeby

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

Abstract

Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under invariants of a given system, as it may reduce the number of proof cases to consider from infinity to a finite number. The classical confluence results for Constraint HThe invariant is formalizedandling Rules (CHR) can be explained in this way, using CHR as a simulation of itself. Using an abstract simulation based on a ground representation, we extend these results to include confluence under invariant and modulo equivalence, which have not been done in a satisfactory way before.

Original language	English
Title of host publication	Logic-Based Program Synthesis and Transformation : 28th International.Symposium, LOPSTR 2018, Frankfurt/Main, Germany, September 4-6, 2018, Revised Selected Papers
Editors	Fred Mesnard, Peter J. Stuckey
Volume	11408
Place of Publication	Cham
Publisher	Springer
Publication date	2019
Pages	94-111
ISBN (Print)	978-3-030-13837-0
ISBN (Electronic)	978-3-030-13838-7
DOIs	https://doi.org/10.1007/978-3-030-13838-7_6
Publication status	Published - 2019
Event	LOPSTR 2018 -28th International Symposium on Logic-Based Program Synthesis and Transformation - Göthe-University Frankfurt am Main, Frankfurt am Main, Germany Duration: 4 Sep 2018 → 6 Sep 2018 Conference number: 28 http://ppdp-lopstr-18.cs.uni-frankfurt.de/lopstr18.html

Conference

Conference	LOPSTR 2018 -28th International Symposium on Logic-Based Program Synthesis and Transformation
Number	28
Location	Göthe-University Frankfurt am Main
Country	Germany
City	Frankfurt am Main
Period	04/09/2018 → 06/09/2018
Internet address	http://ppdp-lopstr-18.cs.uni-frankfurt.de/lopstr18.html

Series	Lecture Notes in Computer Science
Volume	11408
ISSN	0302-9743

Series	Theoretical Computer Science and General Issues
Volume	11408

Keywords

Constraint Handling Rules
Confluence
Confluence modulo equivalence
Invariants
Observable confluence

Link to document

10.1007/978-3-030-13838-7_6

https://link.springer.com/content/pdf/10.1007%2F978-3-030-13838-7_6.pdf

Cite this

Christiansen, H., & Kirkeby, M. H. (2019). Confluence of CHR Revisited: Invariants and Modulo Equivalence. In F. Mesnard, & P. J. Stuckey (Eds.), Logic-Based Program Synthesis and Transformation: 28th International.Symposium, LOPSTR 2018, Frankfurt/Main, Germany, September 4-6, 2018, Revised Selected Papers (Vol. 11408, pp. 94-111). Springer. Lecture Notes in Computer Science Vol. 11408 Theoretical Computer Science and General Issues Vol. 11408 https://doi.org/10.1007/978-3-030-13838-7_6

Christiansen, Henning ; Kirkeby, Maja Hanne. / Confluence of CHR Revisited : Invariants and Modulo Equivalence. Logic-Based Program Synthesis and Transformation: 28th International.Symposium, LOPSTR 2018, Frankfurt/Main, Germany, September 4-6, 2018, Revised Selected Papers. editor / Fred Mesnard ; Peter J. Stuckey. Vol. 11408 Cham : Springer, 2019. pp. 94-111 (Lecture Notes in Computer Science, Vol. 11408). (Theoretical Computer Science and General Issues, Vol. 11408).

@inproceedings{fbbbcb9aafe745de8fadadaa7026456f,

title = "Confluence of CHR Revisited: Invariants and Modulo Equivalence",

abstract = "Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under invariants of a given system, as it may reduce the number of proof cases to consider from infinity to a finite number. The classical confluence results for Constraint HThe invariant is formalizedandling Rules (CHR) can be explained in this way, using CHR as a simulation of itself. Using an abstract simulation based on a ground representation, we extend these results to include confluence under invariant and modulo equivalence, which have not been done in a satisfactory way before.",

keywords = "Constraint Handling Rules, Confluence, Confluence modulo equivalence, Invariants, Observable confluence, Constraint Handling Rules, Confluence, Confluence modulo equivalence, Invariants, Observable confluence",

author = "Henning Christiansen and Kirkeby, {Maja Hanne}",

year = "2019",

doi = "10.1007/978-3-030-13838-7_6",

language = "English",

isbn = "978-3-030-13837-0",

volume = "11408",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "94--111",

editor = "Fred Mesnard and Stuckey, {Peter J.}",

booktitle = "Logic-Based Program Synthesis and Transformation",

note = "null ; Conference date: 04-09-2018 Through 06-09-2018",

url = "http://ppdp-lopstr-18.cs.uni-frankfurt.de/lopstr18.html",

}

Christiansen, H & Kirkeby, MH 2019, Confluence of CHR Revisited: Invariants and Modulo Equivalence. in F Mesnard & PJ Stuckey (eds), Logic-Based Program Synthesis and Transformation: 28th International.Symposium, LOPSTR 2018, Frankfurt/Main, Germany, September 4-6, 2018, Revised Selected Papers. vol. 11408, Springer, Cham, Lecture Notes in Computer Science, vol. 11408, Theoretical Computer Science and General Issues, vol. 11408, pp. 94-111, LOPSTR 2018 -28th International Symposium on Logic-Based Program Synthesis and Transformation, Frankfurt am Main, Germany, 04/09/2018. https://doi.org/10.1007/978-3-030-13838-7_6

Confluence of CHR Revisited : Invariants and Modulo Equivalence. / Christiansen, Henning ; Kirkeby, Maja Hanne.

Logic-Based Program Synthesis and Transformation: 28th International.Symposium, LOPSTR 2018, Frankfurt/Main, Germany, September 4-6, 2018, Revised Selected Papers. ed. / Fred Mesnard; Peter J. Stuckey. Vol. 11408 Cham : Springer, 2019. p. 94-111 (Lecture Notes in Computer Science, Vol. 11408). (Theoretical Computer Science and General Issues, Vol. 11408).

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

TY - GEN

T1 - Confluence of CHR Revisited

AU - Christiansen, Henning

AU - Kirkeby, Maja Hanne

N1 - Conference code: 28

PY - 2019

Y1 - 2019

N2 - Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under invariants of a given system, as it may reduce the number of proof cases to consider from infinity to a finite number. The classical confluence results for Constraint HThe invariant is formalizedandling Rules (CHR) can be explained in this way, using CHR as a simulation of itself. Using an abstract simulation based on a ground representation, we extend these results to include confluence under invariant and modulo equivalence, which have not been done in a satisfactory way before.

AB - Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under invariants of a given system, as it may reduce the number of proof cases to consider from infinity to a finite number. The classical confluence results for Constraint HThe invariant is formalizedandling Rules (CHR) can be explained in this way, using CHR as a simulation of itself. Using an abstract simulation based on a ground representation, we extend these results to include confluence under invariant and modulo equivalence, which have not been done in a satisfactory way before.

KW - Constraint Handling Rules

KW - Confluence

KW - Confluence modulo equivalence

KW - Invariants

KW - Observable confluence

KW - Constraint Handling Rules

KW - Confluence

KW - Confluence modulo equivalence

KW - Invariants

KW - Observable confluence

U2 - 10.1007/978-3-030-13838-7_6

DO - 10.1007/978-3-030-13838-7_6

M3 - Article in proceedings

SN - 978-3-030-13837-0

VL - 11408

T3 - Lecture Notes in Computer Science

SP - 94

EP - 111

BT - Logic-Based Program Synthesis and Transformation

A2 - Mesnard, Fred

A2 - Stuckey, Peter J.

PB - Springer

CY - Cham

Y2 - 4 September 2018 through 6 September 2018

ER -

Christiansen H , Kirkeby MH. Confluence of CHR Revisited: Invariants and Modulo Equivalence. In Mesnard F, Stuckey PJ, editors, Logic-Based Program Synthesis and Transformation: 28th International.Symposium, LOPSTR 2018, Frankfurt/Main, Germany, September 4-6, 2018, Revised Selected Papers. Vol. 11408. Cham: Springer. 2019. p. 94-111. (Lecture Notes in Computer Science, Vol. 11408). (Theoretical Computer Science and General Issues, Vol. 11408). https://doi.org/10.1007/978-3-030-13838-7_6