Please use this identifier to cite or link to this item:
|Title:||Transformations between HCLP and PCSP|
|Citation:||Proceedings of CP96: Second International Conference on Principles and Practice of Constraint Programming, Cambridge, Massachusetts, USA, August 1996, pp 252-266|
|Abstract:||We present a general methodology for transforming between HCLP and PCSP in both directions. HCLP and PCSP each have advantages when modelling problems, and each have advantages when implementing models and solving them. Using the work presented in this paper, the appropriate paradigm can be used for each of these steps, with a meaning-preserving transformation in between if necessary.|
|Appears in Collections:||Computer Science|
Dept of Computer Science Research Papers
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.