Abstract
In this paper we investigate how to extend a generic constraint solver that provides not only tell constraints (by adding the constraint to the store) but also ask tests (by checking whether the constraint is entailed by the store), with general ask constraints. Ask constraints are important for implementing constraint implication, extensible solvers using dynamic scheduling and reification. While the ask-test must be implemented by the solver writer, the compiler can extend this to provide ask behaviour for complex combinations of constraints, including constraints from multiple solvers. We illustrate the use of this approach within the HAL system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
García de la Banda, M., Demoen, B., Marriott, K., Stuckey, P.J.: To the gates of HAL: a HAL tutorial. In: Hu, Z., Rodríguez-Artalejo, M. (eds.) FLOPS 2002. LNCS, vol. 2441, pp. 47–66. Springer, Heidelberg (2002)
Duck, G.J., Stuckey, P.J., García de la Banda, M., Holzbaur, C.: Extending arbitrary solvers with constraint handling rules. In: Miller, D. (ed.) Proceedings of the Fifth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 79–90. ACM Press, New York (2003)
Holzbaur, C., Stuckey, P.J., García de la Banda, M., Jeffery, D.: Optimizing compilation of constraint handling rules. In: Codognet, P. (ed.) Logic Programming: Proceedings of the 17th International Conference. LNCS, pp. 74–89. Springer, Heidelberg (2001)
Jaffar, J., Lassez, J.-L.: Constraint logic programming. In: Proc. Fourteenth ACM Symp. Principles of Programming Languages, pp. 111–119. ACM Press, New York (1987)
Jaffar, J., Maher, M., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. Journal of Logic Programming 37(1-3), 1–46 (1998)
Saraswat, V.: Concurrent Constraint Programming Languages. PhD thesis, Carnegie- Mellon University (1989)
Schulte, C.: Programming deep concurrent constraint combinators. In: Pontelli, E., Santos Costa, V. (eds.) PADL 2000. LNCS, vol. 1753, pp. 215–229. Springer, Heidelberg (2000)
Ueda, K.: Guarded horn clauses. In: Shapiro, E. (ed.) Concurrent Prolog: Collected Papers, pp. 140–156. MIT Press, Cambridge (1987)
Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(FD). Journal of Logic Programming 37(1-3), 139–164 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duck, G.J., de la Banda, M.G., Stuckey, P.J. (2004). Compiling Ask Constraints. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-27775-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22671-0
Online ISBN: 978-3-540-27775-0
eBook Packages: Springer Book Archive