Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

A New Proof-theoretical Linear Semantics for CHR

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 ωt semantics. We propose also a translation from this semantics to linear logic.

Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal.univ-angers.fr/hal-02715055
Contributeur : Okina Université d'Angers <>
Soumis le : lundi 1 juin 2020 - 19:56:40
Dernière modification le : mardi 2 juin 2020 - 04:03:49

Identifiants

  • HAL Id : hal-02715055, version 1
  • OKINA : ua18399

Collections

Citation

Igor Stephan. A New Proof-theoretical Linear Semantics for CHR. 34th International Conference on Logic Programming (ICLP 2018)., 2018, Oxford, United Kingdom. pp.4:1-4:18. ⟨hal-02715055⟩

Partager

Métriques

Consultations de la notice

15