A complete and terminating execution model for constraint handling rules

  • Authors:
  • Hariolf Betz;Frank Raiser;Thom FrÜhwirth

  • Affiliations:
  • Faculty of engineering and computer science, ulm university, germany (e-mail: firstname.lastname@uni-ulm.de);Faculty of engineering and computer science, ulm university, germany (e-mail: firstname.lastname@uni-ulm.de);Faculty of engineering and computer science, ulm university, germany (e-mail: firstname.lastname@uni-ulm.de)

  • Venue:
  • Theory and Practice of Logic Programming
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We observe that the various formulations of the operational semantics of Constraint Handling Rules proposed over the years fall into a spectrum ranging from the analytical to the pragmatic. While existing analytical formulations facilitate program analysis and formal proofs of program properties, they cannot be implemented as is. We propose a novel operational semantics ω!, which has a strong analytical foundation, while featuring a terminating execution model. We prove its soundness and completeness with respect to existing analytical formulations and we provide an implementation in the form of a source-to-source transformation to CHR with rule priorities.