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.
| Identifer | oai:union.ndltd.org:Potsdam/oai:kobv.de-opus-ubp:4153 |
| Date | January 2010 |
| Creators | Abdennadher, Slim, Ismail, Haythem, Khoury, Frederick |
| Contributors | Gesellschaft für Logische Programmierung e.V. |
| Publisher | Universität Potsdam, Extern. Extern |
| Source Sets | Potsdam University |
| Language | English |
| Detected Language | English |
| Type | InProceedings |
| Format | application/pdf |
| Source | Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 139 - 153 |
| Rights | http://opus.kobv.de/ubp/doku/urheberrecht.php |
Page generated in 0.0142 seconds