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.
Michael Jampel has been funded by City University during his PhD, and is currently funded by the European Community under the TMR scheme.
Jean-Marie Jacquet is supported by the Belgian National Fund for Scientific Research as a Research Associate. Part of this work was carried out in the context of the INTAS project 93-1702 “Efficient Symbolic Computing.”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Stefano Bistarelli, Ugo Montanari, and Francesca Rossi. Constraint Solving over Semirings. In IJCAI'95, Montreal, August 1995.
Alan Borning, Bjorn Freeman-Benson, and Molly Wilson. Constraint Hierarchies. Lisp and Symbolic Computation, 5:223–270, 1992.
Alan Borning, Michael Maher, Amy Martindale, and Molly Wilson. Constraint Hierarchies and Logic Programming. In ICLP'89 Lisbon, Portugal, June 1989.
Eugene Freuder. Partial Constraint Satisfaction. In IJCAI'89, August 1989.
Eugene Freuder. Exploiting Structure in Constraint Satisfaction Problems. In Constraint Programming: Proceedings 1993 NATO ASI Parnu, Estonia, pages 54–79. Springer, 1994.
Eugene Freuder and Richard Wallace. Partial Constraint Satisfaction. Artificial Intelligence, 58:21–70, 1992.
Joxan Jaffar and Jean-Louis Lassez. Constraint Logic Programming. In POPL'87 Munich, 1987.
Francisco Menezes, Pedro Barahona, and Philippe Codognet. An Incremental Hierarchical Constraint Solver. In Paris Kanellakis, Jean-Louis Lassez, and Vijay Saraswat, editors, PPCP'93: First Workshop on Principles and Practice of Constraint Programming, Providence RI, 1993.
Thomas Schiex, Hélène Fargier, and Gerard Verfaillie. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In IJCAP'95, Montreal, August 1995.
Molly Wilson. Hierarchical Constraint Logic Programming. PhD thesis, University of Washington, Seattle, May 1993. (Also available as Technical Report 93-05-01).
Molly Wilson and Alan Borning. Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison. In NACLP'89 Cleveland, Ohio, 1989.
Molly Wilson and Alan Borning. Hierarchical Constraint Logic Programming. Journal of Logic Programming, 16(3):277–318, July 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jampel, M., Jacquet, JM., Gilbert, D., Hunt, S. (1996). Transformations between HCLP and PCSP. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_79
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive