Transforming imperative algorithms to constraint handling rules

  • Different properties of programs, implemented in Constraint Handling Rules (CHR), have already been investigated. Proving these properties in CHR is fairly simpler than proving them in any type of imperative programming language, which triggered the proposal of a methodology to map imperative programs into equivalent CHR. The equivalence of both programs implies that if a property is satisfied for one, then it is satisfied for the other. The mapping methodology could be put to other beneficial uses. One such use is the automatic generation of global constraints, at an attempt to demonstrate the benefits of having a rule-based implementation for constraint solvers.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS
  • Export XML

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Slim Abdennadher, Haythem Ismail, Frederick Khoury
URN:urn:nbn:de:kobv:517-opus-41533
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. 139 - 153
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