A complete and terminating execution model for Constraint Handling Rules

DOI10.1017/S147106841000030XzbMath1205.68215arXiv1007.3829MaRDI QIDQ3585170

Thom Frühwirth, Hariolf Betz, Frank Raiser

Publication date: 19 August 2010

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.3829

zbMATH Keywords

operational semanticsconstraint handling rulespersistent constraintsexecution model

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (4)

Parallelism, concurrency and distribution in constraint handling rules: A survey ⋮ The expressive power of CHR with priorities ⋮ Exhaustive Execution of CHR Through Source-to-Source Transformation ⋮ On proving confluence modulo equivalence for Constraint Handling Rules

Cites Work

• Confluence and semantics of constraint simplification rules
• As time goes by: Constraint Handling Rules
• Linear Logical Algorithms
• A Linear-Logic Semantics for Constraint Handling Rules
• Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities
• Constraint Handling Rules

This page was built for publication: A complete and terminating execution model for Constraint Handling Rules