Persistent constraints in constraint handling rules

  • In the most abstract definition of its operational semantics, the declarative and concurrent programming language CHR is trivially non-terminating for a significant class of programs. Common refinements of this definition, in closing the gap to real-world implementations, compromise on declarativity and/or concurrency. Building on recent work and the notion of persistent constraints, we introduce an operational semantics avoiding trivial non-termination without compromising on its essential features.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS
  • Export XML

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Hariolf Betz, Frank Raiser, Thom Frühwirth
URN:urn:nbn:de:kobv:517-opus-41547
Document Type:Conference Proceeding
Language:English
Year of Completion:2010
Publishing Institution:Universität Potsdam
Contributing Corporation:Gesellschaft für Logische Programmierung e.V.
Release Date:2010/03/04
Source:Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 155 - 166
Organizational units:Extern / Extern
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Collections:Universität Potsdam / Tagungsbände/Proceedings / Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Constraint Handling Rules
Licence (German):License LogoKeine Nutzungslizenz vergeben - es gilt das deutsche Urheberrecht