Publication date
January 2018
DOI Publisher
OASIcs - OpenAccess Series in Informatics. Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)Abstract
Constraint handling rules are a committed-choice language consisting of multiple-heads guarded rules that rewrite constraints into simpler ones until they are solved. We propose a new proof-theoretical declarative linear semantics for Constraint Handling Rules. We demonstrate completeness and soundness of our semantics w.r.t. operational omega_t. semantics. We propose also a translation from this semantics to linear logic
Add to ORKG