License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2018.4
URN: urn:nbn:de:0030-drops-98707
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9870/
Go to the corresponding OASIcs Volume Portal


St├ęphan, Igor

A New Proof-Theoretical Linear Semantics for CHR

pdf-format:
OASIcs-ICLP-2018-4.pdf (0.5 MB)


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.

BibTeX - Entry

@InProceedings{stphan:OASIcs:2018:9870,
  author =	{Igor St{\'e}phan},
  title =	{{A New Proof-Theoretical Linear Semantics for CHR}},
  booktitle =	{Technical Communications of the 34th International  Conference on Logic Programming (ICLP 2018)},
  pages =	{4:1--4:17},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-090-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{64},
  editor =	{Alessandro Dal Palu' and Paul Tarau and Neda Saeedloei and Paul Fodor},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9870},
  URN =		{urn:nbn:de:0030-drops-98707},
  doi =		{10.4230/OASIcs.ICLP.2018.4},
  annote =	{Keywords: Constraint Handling Rules, Linear Logic}
}

Keywords: Constraint Handling Rules, Linear Logic
Collection: Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)
Issue Date: 2018
Date of publication: 19.11.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI