2026-09-22T20:11:37Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9870 2026-09-22T15:12:43Z ddc:004 open_access

A New Proof-Theoretical Linear Semantics for CHR Stéphan, Igor Constraint Handling Rules Linear Logic 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Igor Stéphan 2018 Is Part Of OASIcs, Volume 64, Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ICLP.2018.4 urn:nbn:de:0030-drops-98707 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.4 eng https://creativecommons.org/licenses/by/3.0/legalcode