Transformations between HCLP and PCSP

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2990

Full metadata record

DC Field	Value	Language
dc.contributor.author	Jampel, M	-
dc.contributor.author	Jacquet, JM	-
dc.contributor.author	Gilbert, D	-
dc.contributor.author	Hunt, S	-
dc.coverage.spatial	15	en
dc.date.accessioned	2009-01-29T13:28:02Z	-
dc.date.available	2009-01-29T13:28:02Z	-
dc.date.issued	1996	-
dc.identifier.citation	Proceedings of CP96: Second International Conference on Principles and Practice of Constraint Programming, Cambridge, Massachusetts, USA, August 1996, pp 252-266	en
dc.identifier.isbn	3-540-61551-2	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/2990	-
dc.description.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.	en
dc.format.extent	296575 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Springer	en
dc.title	Transformations between HCLP and PCSP	en
dc.type	Conference Paper	en
Appears in Collections:	Computer Science Dept of Computer Science Research Papers

Files in This Item:

File	Description	Size	Format
10.1.1.45.2908.pdf		289.62 kB	Adobe PDF	View/Open