Abstract
Experience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a problem-specific constraint solver. HAL is a new constraint logic programming language expressly designed to facilitate this process. It provides a well-defined solver interface, mutable global variables for implementing a constraint store, and dynamic scheduling for combining, extending and writing new constraint solvers. Equally importantly, HAL supports semi-optional type, mode and determinism declarations. These allow natural constraint specification by means of type overloading, better compile-time error checking and generation of more efficient run-time code.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Demoen, B., García de la Banda, M., Harvey, W., Marriott, K., Stuckey, P.J.: Herbrand constraint solving in HAL. In: Procs. of ICLP 1999 (to appear)
Demoen, B., García de la Banda, M., Stuckey, P.J.: Type constraint solving for parametric and ad-hoc polymorphism. In: Procs. of the 22nd Australian Comp. Sci. Conf., pp. 217–228 (1999)
Diaz, D., Codognet, P.: A minimal extension of the WAM for clpfd. In: Procs. of ICLP 1993, pp. 774–790 (1993)
Früwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming 37, 95–138 (1998)
Harvey, W., Stuckey, P.J.: Constraint representation for propagation. In: Procs. of PPCP 1998, pp. 235–249 (1998)
Heintze, N.C., Michaylov, S., Stuckey, P.J.: CLP(R) and some electrical engineering problems. Journal of Automated Reasoning 9, 231–260 (1992)
Hermenegildo, M., Bueno, F., Cabeza, D., García de la Banda, M., López, P., Puebla, G.: The CIAO multi-dialect compiler and system. In: Parallelism and Implementation of Logic and Constraint Logic Programming. Nova Science, Bombay (1999)
Holzbaur, C.: Metastructures vs. attributed variables in the context of extensible unification. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 260–268. Springer, Heidelberg (1992)
Jaffar, J., Michaylov, S., Stuckey, P., Yap, R.: The CLP(R) language and system. ACM Transactions on Programming Languages and Systems 4(3), 339–395 (1992)
Kelly, A., Macdonald, A., Marriott, K., Stuckey, P.J., Yap, R.H.C.: Effectiveness of optimizing compilation of CLP(R). In: Procs. of JICSLP 1992, pp. 37–51 (1996)
Marriott, K., Stuckey, P.J.: Programming with Constraints: an Introduction. MIT Press, Cambridge (1998)
Michel, L., Van Hentenryck, P.: Localizer: A modeling language for local search. In: Procs. of the PPCP 1997, pp. 237–251 (1997)
Somogyi, Z., Henderson, F., Conway, T.: The execution algorithm of Mercury: an efficient purely declarative logic programming language. Journal of Logic Programming 29, 17–64 (1996)
Wallace, M. (ed.): CP98 Workshop on Large Scale Combinatorial Optimization and Constraints (1998), http://www.icparc.ic.ac.uk/~mgw/chic2_workshop.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demoen, B., de la Banda, M.G., Harvey, W., Marriott, K., Stuckey, P. (1999). An Overview of HAL. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive